Monday, October 27
Detailed workshop program TBA.
Tuesday, October 28
| 08:45 – 10:00 | Session 1: Concurrent data structures |
| PIPQ: Strict Insert-Optimized Concurrent Priority Queue Olivia Grimes, Ahmed Hassan, Panagiota Fatourou, and Roberto Palmieri | |
| TEE is not a Healer: Rollback-Resistant Reliable Storage Sadegh Keshavarzi, Gregory Chockler, and Alexey Gotsman | |
| LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics Martin Hilgendorf and Marina Papatriantafilou | |
| Brief Announcement: Highly Dynamic and Fully Distributed Data Structures John Augustine, Antonio Cruciani, and Iqra Altaf Gillani | |
| Brief Announcement: Concurrent Double-Ended Priority Queues Panagiota Fatourou, Eric Ruppert, and Ioannis Xiradakis | |
| 10:00 – 11:00 | Keynote 1: François Le Gall Recent developments in quantum distributed computing |
| 11:00 – 11:25 | Coffee break |
| 11:25 – 12:30 | Session 2: Highlighted presentations in mobility and communication |
| Team Formation and Applications Yuval Emek, Shay Kutten, Ido Rafael, and Gadi Taubenfeld | |
| Approach of Agents with Restricted Fuel Tanks Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, and Grzegorz Stachowiak | |
| Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique Keren Censor-Hillel, Orr Fischer, Ran Gelles, and Pedro Soto | |
| 12:30 – 13:45 | Lunch break |
| 13:45 – 15:40 | Session 3: Distributed graph algorithms |
| Towards Fully Automatic Distributed Lower Bounds Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Joonatan Saarhelo | |
| New Distributed Interactive Proofs for Planarity: A Matter of Left and Right Yuval Gil and Merav Parter | |
| The Complexity Landscape of Dynamic Distributed Subgraph Finding Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, and Mingyang Yang | |
| 14:40 – 14:45 | Short break during the session |
| Model-Agnostic Approximation of Constrained Forest Problems Corinna Coupette, Alipasha Montaseri, and Christoph Lenzen | |
| New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d’Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, and Jukka Suomela | |
| Brief Announcement: Distributed Sparsest Cut via Eigenvalue Estimation Yannic Maus and Tijn de Vos | |
| Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs Salwa Faour and Fabian Kuhn | |
| 15:40 – 16:00 | Coffee break |
| 16:00 – 17:45 | Session 4: Blockchain foundations |
| Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection Krishnendu Chatterjee, Jan Matyáš Křišťan, Stefan Schmid, Jakub Svoboda, and Michelle Yeo | |
| On the Efficiency of Dynamic Transaction Scheduling in Blockchain Sharding Ramesh Adhikari, Costas Busch, and Miroslav Popovic | |
| Hierarchical Consensus: Scalability through Optimism and Weak Liveness Pedro Antonino, Antoine Durand, and A. W. Roscoe | |
| 16:50 – 16:55 | Short break during the session |
| DAG it off: Latency Prefers No Common Coins Ignacio Amores-Sesar, Viktor Grøndal, Adam Holmgård, and Mads Ottendal | |
| Brief Announcement: DAGs for the Masses Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, and Petr Kuznetsov | |
| Brief Announcement: Carry the Tail in Consensus Protocols Suyash Gupta, Dakai Kang, Dahlia Malkhi, and Mohammad Sadoghi | |
| Brief Announcement: Weaker Assumptions for Asymmetric Trust Christian Cachin and Juan Villacis | |
| 18:00 – 19:30 | Business meeting |
Wednesday, October 29
| 08:45 – 10:00 | Session 5: Shared-memory and parallelism |
| Auditable Shared Objects: From Registers to Synchronization Primitives Hagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, and Corentin Travers | |
| Asynchronous Latency and Fast Atomic Snapshot João Paulo Bezerra, Luciano Freitas, and Petr Kuznetsov | |
| An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention Dan Alistarh, Faith Ellen, and Alexander Fedorov | |
| Brief Announcement: Time, Fences and the Ordering of Events in TSO Raïssa Nataf and Yoram Moses | |
| Brief Announcement: Incrementally Verifiable Distributed Computation Eden Aldema Tshuva and Rotem Oshman | |
| 10:00 – 11:00 | Keynote 2 (presented by 2025 Dijkstra Prize winner): Moni Naor What Can Be Computed and Verified Locally: A Three Decade Perspective |
| 11:00 – 11:25 | Coffee break (with posters) |
| 11:25 – 12:30 | Session 6: Best (student) paper awards |
| Complexity landscape for local certification (Best Paper Award) Nicolas Bousquet, Laurent Feuilloley, and Sébastien Zeitoun | |
| Content-Oblivious Leader Election in 2-Edge-Connected Networks (Best Student Paper co-Award) Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou | |
| pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer (Best Student Paper co-Award) Orestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, and Dionysis Zindros | |
| 12:30 – 13:45 | Lunch break (with posters) |
| 13:45 – 14:50 | Session 7: Highlighted presentations in fault-tolerance and shared-memory |
| Validity in Network-Agnostic Byzantine Agreement Andrei Constantinescu, Marc Dufay, Diana Ghinea, and Roger Wattenhofer | |
| Distributed Download from an External Data Source in Byzantine Majority Settings John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg | |
| Strong Linearizability without Compare&Swap: The Case of Bags Faith Ellen and Gal Sela | |
| 14:50 – 15:30 | Coffee break (with posters) |
| 15:30 – 16:55 | Session 8: Mobile agents |
| Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs Ashish Saxena and Kaushik Mondal | |
| On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits Matthias Artmann, Andreas Padalkin, and Christian Scheideler | |
| Perpetual exploration in anonymous synchronous networks with a Byzantine black hole Adri Bhattacharya, Pritam Goswami, Evangelos Bampas, and Partha Sarathi Mandal | |
| Brief Announcement: Universal Dancing by Luminous Robots under Sequential Schedulers Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, and Nicola Santoro | |
| Brief Announcement: The Virtue of Self-Consistency Fabian Frei and Koichi Wada | |
| Brief Announcement: Optimal Dispersion Under Asynchrony Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma | |
| 16:55 – 17:05 | Short break |
| 16:05 – 17:50 | Session 9: Fault-tolerance and synchronization |
| Lower Bounds for k-Set Agreement in Fault-Prone Networks Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz, Ulrich Schmid, and Hugo Rincon-Galeana | |
| Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg | |
| Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics Rida Bazzi, Anya Chaturvedi, Andréa W. Richa, and Peter Vargas | |
| Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou | |
| 19:00 – 22:00 | Conference banquet |
Thursday, October 30
| 08:45 – 10:00 | Session 10: Nature-inspired computation and dynamic networks |
| Robust predicate and function computation in continuous chemical reaction networks Kim Calabrese, David Doty, and Mina Latifi | |
| On the h-Majority Dynamics with Many Opinions Francesco d’Amore, Niccolò D’Archivio, George Giakkoupis, and Emanuele Natale | |
| Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders Emilio Cruciani, Sebastian Forster, and Tijn de Vos | |
| Brief Announcement: Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks Antonio Cruciani | |
| Brief Announcement: Congested Clique Counting for Local Gibbs Distributions Joshua Z. Sobel | |
| 10:00 – 11:00 | Keynote 3: Ittai Abraham |
| 11:00 – 11:25 | Coffee break |
| 11:25 – 12:30 | Session 11: Highlighted presentations in distributed graph algorithms |
| Towards Optimal Distributed Edge Coloring with Fewer Colors Manuel Jakob, Yannic Maus, and Florian Schager | |
| On the Randomized Locality of Matching Problems in Regular Graphs Seri Khoury, Manish Purohit, Aaron Schild, and Joshua R. Wang | |
| Distributed Computation with Local Advice Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, and Jukka Suomela | |
| 12:30 – 13:45 | Lunch break (with posters) |
| 13:45 – 15:00 | Session 12: Fault-tolerance and consensus |
| Byzantine Consensus in the Random Asynchronous Model George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, and Igor Zablotchi | |
| ABEL: Perfect Asynchronous Byzantine Extension from List-Decoding Ittai Abraham and Gilad Asharov | |
| Kudzu: Fast and Simple High-Throughput BFT Victor Shoup, Jakub Sliwinski, and Yann Vonlanthen | |
| Weight reduction in distributed protocols: new algorithms and analysis Anatoliy Zinovyev | |
| 15:00 – 15:20 | Coffee break |
| 15:20 – 17:00 | Session 13: Communication |
| Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity Lélia Blin, Franck Petit, and Sébastien Tixeuil | |
| Amnesiac Flooding: Easy to Break, Hard to Escape Henry Austin, Maximillien Gadouleau, George B. Mertzios, and Amitabh Trehan | |
| Coordination Through Stochastic Channels Pierre Fraigniaud, Boaz Patt-Shamir, and Sergio Rajsbaum | |
| Compact routing schemes in undirected and directed graphs Avi Kadria and Liam Roditty | |
| Energy-Efficient Maximal Independent Sets in Radio Networks Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, and Gopal Pandurangan | |
| Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks Adam Ganczorz, Tomasz Jurdzinski, and Andrzej Pelc | |
| 17:00 – 17:05 | Short break |
| 17:05- 17:45 | Session 14: Fault-tolerance and consensus continued |
| Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication Andrei Constantinescu, Marc Dufay, Anton Paramonov, and Roger Wattenhofer | |
| Brief Announcement: Asynchronous Approximate Agreement with Quadratic Communication Mose Mizrahi Erbes and Roger Wattenhofer | |
| Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, and Kui Ren | |
| Brief Announcement: Communication Patterns for Optimal Resilience Hagit Attiya, Itay Flam, and Jennifer L. Welch | |
| Brief Announcement: Proximal Byzantine Agreement: Improved accuracy for fault-tolerant replicated datastreams Roy Shadmon and Owen Arden | |
Friday, October 31
Detailed workshop program TBA.