Programme and Accepted Papers

Programme

The full programme will be finalised and posted shortly, but the rough timings will be as follows:

8th June: reception (6pm onwards)

9th June: presentations and business meeting

10th June: presentations, excursion (12:40pm onwards), banquet (6pm onwards)

11th June: presentations and farewell

Accepted Papers

• Yaseen Abd-Elhaleem, Michal Dory and Oren Weimann. 
  A Simple Distributed Deterministic Planar Separator
• Duncan Adamson, George Mertzios and Paul Spirakis. 
  Maintaining Bipartite Colourings on Temporal Graphs on a Budget
• Virginia Aponte, Mathis Bouverot-Dupuis, Quentin Bramas, Pierre Courtieu, Lionel Rieg and Xavier Urbain. 
  Formal certification of ASYNC protocols: the case of Gathering in R^2 using Weber points
• Hagit Attiya, Armando Castañeda, Dhrubajyoti Ghosh and Thomas Nowak. 
  Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models
• Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz and Yingli Ran. 
  Minimum Deviation Distance Realization
• Mateusz Basiak, Marcin Bienkowski, Guy Even and Agnieszka Tatarczuk. 
  Online Bisection with Ring Demands
• Silvia Bonomi, Giovanni Farina and Sebastien Tixeuil. 
  On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks
• Christian Cachin, Jinfeng Dou, Christian Scheideler and Philipp Schneider. 
  A Lightweight Approach for State Machine Replication
• Jérémie Chalopin, Shantanu Das and Maria Kokkou. 
  Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
• Jérémie Chalopin and Emmanuel Godard. 
  Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
• Antonio Cruciani. 
  Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks
• Varsha Dani and Asya Vitko. 
  Fast distributed sampling of colorings of trees with few colors
• Stefan Dobrev, Rastislav Kralovic, Richard Kralovic, Dana Pardubska and Peter Rossmanith. 
  Cow Path by Finite Agent: Time vs Pebbles
• Louis Esperet and Jean-Florent Raymond. 
  Multiparty equality in the local broadcast model
• Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe and Nicola Santoro. 
  Universal Dancing by Luminous Robots Under Sequential Schedulers
• Laurent Feuilloley, Josef Erik Sedláček and Martin Slávik. 
  Proving there is a leader without naming it
• Laurent Feuilloley, Soumyadeep Paul and Ami Paz. 
  Polynomial Time Local Decision Revisited
• Thorsten Götte, Jinfeng Dou, Henning Hillebrandt, Julian Werthmann and Christian Scheideler. 
  Fast Distributed Computation of Compact Routing Schemes
• Yuya Higashikawa, Shuichi Miyazaki and Daiki Okayama. 
  Online Exploration of Grid Graphs with Multiple Searchers
• Manuel Jakob and Yannic Maus. 
  Towards Optimal Distributed Delta Coloring
• Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata and Fukuhito Ooshita. 
  Extending the writing distance: the R(dr)W(dw) communication model for self-stabilizing distributed algorithms
• Alexander Lindermayr, Kirk Pruhs, Andrea Richa and Tegan Wilson. 
  Indirect Coflow Scheduling
• Ron van der Meyden and Godfrey Wong. 
  A Formalization of Knowledge in Fault Tolerant Distributed Algorithms
• Bo Pan, Maurice Herlihy, Maria Potop-Butucaru and Liuba Shrira. 
  Byzantine Approximate Agreement Cross-chain Task
• Subhajit Pramanick, Saswata Jana and Partha Sarathi Mandal. 
  Asynchronous Fault-tolerant Mutual Visibility
• Nithin Salevemula and Shreyas Pai. 
  Distributed MIS Algorithms for Rational Agents using Games
• Masahiro Shibata, Sayaka Kamei, Fukuhito Ooshita and Hirotsugu Kakugawa. 
  Uniform deployment of myopic luminous robots in rings
• Tijn de Vos and Yannic Maus. 
  Distributed Sparsest Cut via Eigenvalue Estimation

Supporters of SIROCCO 2026