Accepted Papers

  • Nayuta Yanagisawa. Wait-Free Solvability of Colorless Tasks in Anonymous Shared-Memory Model
  • Armando Castaneda, Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum and Michel Raynal. Making Local Algorithms Wait-free: The Case of Ring Coloring
  • Pierre Fraigniaud, Sergio Rajsbaum and Corentin Travers. Perfect Failure Detection with Very Few Bits
  • Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand and Lawrence Larmore. Leader Election in Rings with Bounded Multiplicity (Short Paper)
  • Gokarna Sharma, Ramachandran Vaidyanathan, Jerry Trahan, Costas Busch and Suresh Rai. Complete Visibility for Robots with Lights in O(1) Time
  • Gerry Siegemund and Volker Turau. PSVR – Self-stabilizing Publish/Subscribe Communication for Ad-hoc Networks (Short Paper)
  • Quentin Bramas, Dianne Foreback, Mikhail Nesterenko and Sebastien Tixeuil. Packet Efficient Implementation of the Omega Failure Detector
  • Quentin Bramas and Sebastien Tixeuil. Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper)
  • Mikaël Rabie. Global Versus Local Computations: Fast Computing with Identifiers (Short Paper)
  • Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita. Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers
  • Mohammed Haddad, Colette Johnen and Sven Köhler. Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper)
  • Joffroy Beauquier, Blanchard Peva, Janna Burman and Oksana Denysiuk. On the power of oracle Omega? for self-stabilizing leader election in population protocols
  • Olaf Landsiedel, Thomas Petig and Elad Michael Schiller. DecTDMA: A Decentralized-TDMA with Link Quality Estimation for WSNs
  • Lucas Perronne and Sara Bouchenak. Towards Efficient and Robust BFT Protocols (Short Paper)
  • Marjorie Bournat, Ajoy Datta and Swan Dubois. Self-Stabilizing Robots in Highly Dynamic Environments
  • Pankaj Khanchandani and Christoph Lenzen. Self-stabilizing Byzantine Clock Synchronization with Optimal Precision
  • Florence Leve, Khaled Mohamed and Vincent Villain. Snap-Stabilizing PIF on Arbitrary Connected Networks In Message Passing Model
  • Davide Canepa, Xavier Défago, Taisuke Izumi and Maria Potop-Butucaru. Flocking with Oblivious Robots
  • Marijn J. H. Heule, Rezwana Reaz, H. B. Acharya and Mohamed G. Gouda. Analysis of Computing Policies Using SAT Solvers (Short Paper)
  • Christoph Lenzen and Joel Rybicki. Near-Optimal Self-Stabilising Counting and Firing Squads
  • Alexander Binun, Thierry Coupaye, Shlomi Dolev, Mohammed Kassi Lahlou, Marc Lacoste, Alex Palesandro, Reuven Yagel and Leonid Yankulin. Self-Stabilizing Byzantine-Tolerant Distributed Replicated State Machine
  • Emmanuel Godard. Snap-Stabilizing Tasks in Anonymous Networks
  • Lili Su and Nitin Vaidya. Asynchronous Non-Bayesian Learning in the Presence of Crash Failures
  • Lili Su and Nitin Vaidya. Robust Multi-Agent Optimization: Coping with Byzantine Agents with Input Redundancy
  • Guy Even, Moti Medina and Boaz Patt-Shamir. On-Line Path Computation and Function Placement in SDNs
  • Jonas Lefèvre, Robert Gmyr and Christian Scheideler. Self-stabilizing Metric Graphs
  • Mohammad Roohitavaf and Sandeep Kulkarni. Automatic Addition of Conflicting Properties
  • Alexandre Dambreville, Joanna Tomasik and Johanne Cohen. Meta-algorithm to choose a good on-line prediction (Short Paper)
  • Dianne Foreback, Mikhail Nesterenko and Sebastien Tixeuil. Infinite Unlimited Churn (Short Paper)
  • Michiko Inoue, Fukuhito Ooshita and Sebastien Tixeuil. An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers
  • Taichi Uehara, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita. Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space
  • Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil and Xavier Urbain. Synchronous Gathering without Multiplicity Detection: A Certified Algorithm