Programme and Accepted Papers
Programme
Downloadable .pdf version
Monday, June 8th
| 18:00 | Reception WB-0002, WB-0003 ,WB-0004 in the Waterside Building (north side of the city centre) |
Tuesday, June 9th
| 08:50 – 09:00 | Opening remarks Scott Logic Lecture Theatre, Department of Mathematical Sciences & Department of Computer Science |
| 09:00 – 10:00 | Keynote Lecture 1: Jukka Suomela, Distributed Quantum Advantage |
| 10:00 – 10:30 | Coffee break |
| 10:30 – 13:00 | Session 1 |
| 10:30 – 10:55 | Tijn de Vos and Yannic Maus, Distributed Sparsest Cut via Eigenvalue Estimation |
| 10:55 – 11:20 | Yaseen Abd-Elhaleem, Michal Dory and Oren Weimann, A Simple Distributed Deterministic Planar Separator |
| 11:20 – 11:45 | Nithin Salevemula and Shreyas Pai, Distributed MIS Algorithms for Rational Agents using Games |
| 11:45 – 12:10 | Laurent Feuilloley, Josef Erik Sedláček and Martin Slávik, Proving there is a Leader without Naming it |
| 12:10 – 12:35 | Manuel Jakob and Yannic Maus, Towards Optimal Distributed Delta Coloring |
| 12:35 – 13:00 | Louis Esperet and Jean-Florent Raymond, Multiparty Equality in the Local Broadcast Model |
| 13:00 – 14:30 | Lunch |
| 14:30 – 16:10 | Session 2 |
| 14:30 – 14:55 | 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 |
| 14:55 – 15:20 | Masahiro Shibata, Sayaka Kamei, Fukuhito Ooshita and Hirotsugu Kakugawa, Uniform Deployment of Myopic Luminous Robots in Rings |
| 15:20 – 15:45 | Subhajit Pramanick, Saswata Jana and Partha Sarathi Mandal, Asynchronous Fault-tolerant Mutual Visibility |
| 15:45 – 16:10 | Yuya Higashikawa, Shuichi Miyazaki and Daiki Okayama, Online Exploration of Grid Graphs with Multiple Searchers |
| 16:10 – 16:30 | Coffee break |
| 16:30 – 18:10 | Session 3 |
| 16:30 – 16:55 | Alexander Lindermayr, Kirk Pruhs, Andrea Richa and Tegan Wilson, Indirect Coflow Scheduling |
| 16:55 – 17:20 | Amotz Bar-Noy, David Peleg, Mor Perry, Yingli Ran and Dror Rawitz, Minimum Deviation Distance Realization |
| 17:20 – 17:45 | Duncan Adamson, George Mertzios and Paul Spirakis, Maintaining Bipartite Colourings on Temporal Graphs on a Budget |
| 17:45 – 18:10 | Mateusz Basiak, Marcin Bienkowski, Guy Even and Agnieszka Tatarczuk, Online Bisection with Ring Demands |
| 18:30 – 19:30 | Business meeting |
Wednesday, June 10th
| 09:00 – 10:00 | Keynote Lecture 2: Dariusz Kowalski, Distributed Protocols on Shared Channels 2026 Prize for Innovation in Distributed Computing |
| 10:00 – 10:20 | Coffee break |
| 10:20 – 12:00 | Session 4 |
| 10:20 – 10:45 | Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe and Nicola Santoro, Universal Dancing by Luminous Robots Under Sequential Schedulers (Best paper) |
| 10:45 – 11:10 | Laurent Feuilloley, Soumyadeep Paul and Ami Paz, Polynomial Time Local Decision Revisited (Best student paper) |
| 11:10 – 11:35 | Stefan Dobrev, Rastislav Kralovic, Richard Kralovic, Dana Pardubska and Peter Rossmanith, Cow Path by Finite Agent: Time vs Pebbles |
| 11:35 – 12:00 | Varsha Dani and Asya Vitko, Fast Distributed Sampling of Colorings of Trees with Few Colors |
| 12:00 – 13:00 | Lunch |
| 13:00 – 18:00 | Excursion Beamish Museum Coach will depart from near the conference venue. |
| 18:00 | Banquet Beamish Hall Hotel |
Thursday, June 11th
| 09:00 – 10:00 | Keynote Lecture 3: Maria Potop-Butucaru, Smart Contracts and Distributed Cross-Chain Protocols |
| 10:00 – 10:30 | Coffee break |
| 10:30 – 13:00 | Session 5 |
| 10:30 – 10:55 | Bo Pan, Maurice Herlihy, Maria Potop-Butucaru and Liuba Shrira, Byzantine Approximate Agreement Cross-chain Task |
| 10:55 – 11:20 | Christian Cachin, Jinfeng Dou, Christian Scheideler and Philipp Schneider, A Lightweight Approach for State Machine Replication |
| 11:20 – 11:45 | Silvia Bonomi, Giovanni Farina and Sebastien Tixeuil, On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks |
| 11:45 – 12:10 | Hagit Attiya, Armando Castañeda, Dhrubajyoti Ghosh and Thomas Nowak, Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models |
| 12:10 – 12:35 | Ron van der Meyden and Godfrey Wong, A Formalization of Knowledge in Fault Tolerant Distributed Algorithms |
| 12:35 – 13:00 | Antonio Cruciani, Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks |
| 13:00 – 14:00 | Lunch |
| 14:00 – 15:40 | Session 6 |
| 14:00 – 14:25 | 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 |
| 14:25 – 14:50 | Jérémie Chalopin, Shantanu Das and Maria Kokkou, Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes |
| 14:50 – 15:15 | Thorsten Götte, Jinfeng Dou, Henning Hillebrandt, Julian Werthmann and Christian Scheideler, Fast Distributed Computation of Compact Routing Schemes |
| 15:15 – 15:40 | Jérémie Chalopin and Emmanuel Godard, Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness |
| 15:40 | Coffee and Closing remarks |
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
