| 2026 | Uniform Deployment of Myopic Luminous Robots in Rings. | Masahiro Shibata, Sayaka Kamei, Fukuhito Ooshita, Hirotsugu Kakugawa |
| 2026 | Distributed MIS Algorithms for Rational Agents Using Games. | Nithin Salevemula, Shreyas Pai |
| 2026 | Asynchronous Fault-Tolerant Mutual Visibility. | Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal |
| 2026 | A Formalization of Knowledge in Fault Tolerant Distributed Algorithms. | Ron van der Meyden, Godfrey Wong |
| 2026 | Distributed Sparsest Cut via Eigenvalue Estimation. | Yannic Maus, Tijn de Vos |
| 2026 | Indirect Coflow Scheduling. | Alexander Lindermayr, Kirk Pruhs, Andra W. Richa, Tegan Wilson |
| 2026 | Extending the Writing Distance: the R(d | Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Fukuhito Ooshita |
| 2026 | Towards Optimal Distributed Delta Coloring. | Manuel Jakob, Yannic Maus |
| 2026 | Online Exploration of Grid Graphs with Multiple Searchers. | Yuya Higashikawa, Shuichi Miyazaki, Daiki Okayama |
| 2026 | Byzantine Approximate Agreement Cross-chain Task. | Maurice Herlihy, Bo Pan, Maria Potop-Butucaru, Liuba Shrira |
| 2026 | Proving There Is a Leader Without Naming It. | Laurent Feuilloley, Josef Erik Sedlcek, Martin Slvik |
| 2026 | Polynomial Time Local Decision Revisited. | Laurent Feuilloley, Soumyadeep Paul, Ami Paz |
| 2026 | Universal Dancing by Luminous Robots Under Sequential Schedulers. | Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Nicola Santoro |
| 2026 | Multiparty Equality in the Local Broadcast Model. | Louis Esperet, Jean-Florent Raymond |
| 2026 | Fast Distributed Computation of Compact Routing Schemes. | Jinfeng Dou, Thorsten Gtte, Henning Hillebrandt, Christian Scheideler, Julian Werthmann |
| 2026 | Cow Path by Finite Agent: Time vs Pebbles. | Stefan Dobrev, Rastislav Krlovic, Richard Krlovic, Dana Pardubsk, Peter Rossmanith |
| 2026 | Fast Distributed Sampling of Colorings of Trees with Few Colors. | Varsha Dani, Asya Vitko |
| 2026 | Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks. | Antonio Cruciani |
| 2026 | Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness. | Jrmie Chalopin, Emmanuel Godard |
| 2026 | Silent Self-stabilising Leader Election in Programmable Matter Systems with Holes. | Jrmie Chalopin, Shantanu Das, Maria Kokkou |
| 2026 | A Lightweight Approach for State Machine Replication. | Christian Cachin, Jinfeng Dou, Christian Scheideler, Philipp Schneider |
| 2026 | On the Solvability of Byzantine-Tolerant Reliable Communication in Dynamic Networks. | Silvia Bonomi, Giovanni Farina, Sbastien Tixeuil |
| 2026 | Online Bisection with Ring Demands. | Mateusz Basiak, Marcin Bienkowski, Guy Even, Agnieszka Tatarczuk |
| 2026 | Minimum Deviation Distance Realization. | Amotz Bar-Noy, David Peleg, Mor Perry, Yingli Ran, Dror Rawitz |
| 2026 | Equivalence and Separation Between Heard-Of and Asynchronous Message-Passing Models. | Hagit Attiya, Armando Castaeda, Dhrubajyoti Ghosh, Thomas Nowak |