Monday, October 28: ADGA, Flower Tutorial (see workshop web-sites for details)
| 09:30 – 10:30 | ADGA |
| 10:30 – 11:00 | Coffee Break |
| 11:00 – 13:00 | ADGA |
| 13:00 – 14:30 | Lunch |
| 14:30 – 16:30 | ADGA / Flower Tutorial |
| 16:30 – 17:00 | Coffee Break |
| 17:00 – 18:00 | ADGA / Flower Tutorial |
| 18:00 – 19:00 | DISC Reception |
Tuesday, October 29
| 09:00 – 09:05 | Opening Remarks | |
| 09:05 – 10:05 | Keynote: Locality Challenges in Dependable Communication Networks, Stefan Schmid | |
| Session 1: Shared-Memory Algorithms | ||
| 10:05 – 10:25 | Lock-Free Augmented Trees (Best Paper Co-Winner) Panagiota Fatourou, Eric Ruppert | |
| 10:25 – 10:45 | A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory Benyamin Bashari, David Yu Cheng Chan, Philipp Woelfel | |
| 10:45 – 10:50 | BA: Concurrent Aggregate Queries Gal Sela, Erez Petrank | |
| 10:50 – 11:30 | Coffee Break | |
| Session 2: Challenges in Dynamic Networks | ||
| 11:30 – 11:50 | Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges Antoine El-Hayek, Monika Henzinger, Stefan Schmid | |
| 11:50 – 12:10 | Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast Garrett Parzych, Joshua J. Daymude | |
| 12:10 – 12:15 | BA: Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas | |
| Session 3: Distributed Assignment Problems | ||
| 12:15 – 12:35 | Near Optimal Algorithms for Token Collision in Anonymous Networks Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng | |
| 12:35 – 12:55 | Sorting in One and Two Rounds using t-Comparators Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn | |
| 12:55 – 13:00 | BA: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz | |
| 13:00 – 14:30 | Lunch | |
| Session 4: Distributed Graph Coloring and Friends | ||
| 14:30 – 14:50 | Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mikaël Rabie | |
| 14:50 – 15:10 | Connectivity Labeling in Faulty Colored Graphs Asaf Petruschka, Shay Spair, Elad Tzalik | |
| 15:10 – 15:15 | BA: Distributed Maximum Flow in Planar Graphs Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann | |
| 15:15 – 15:35 | Distributed Delta-Coloring under Bandwidth Limitations Magnús M. Halldórsson, Yannic Maus | |
| 15:35 – 15:55 | Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin | |
| 15:55 – 16:00 | BA: Agent-based Leader Election, MST, and Beyond Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma | |
| 16:00 – 16:30 | Coffee Break | |
| Session 5: Flavors of Synchrony | ||
| 16:30 – 16:50 | Granular Synchrony Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren | |
| 16:50 – 16:55 | BA: Unifying Partial Synchrony Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski, Roger Wattenhofer | |
| 16:55 – 17:15 | Convex Consensus with Asynchronous Fallback Andrei Constantinescu, Diana Ghinea, Roger Wattenhofer, Floris Westermann | |
| 17:15 – 17:45 | Break | |
| 17:45 – 19:30 | Business Meeting |
Wednesday, October 30
| 09:00 – 10:00 | Keynote: Federated Learning in the Presence of Heterogeneity, Gauri Joshi |
| Session 6: The Latest on Linearizability | |
| 10:00 – 10:20 | Hyperproperty-Preserving Register Specifications (Best Paper Co-Winner / Best Student Paper) Yoav Ben Shimon, Ori Lahav, Sharon Shoham |
| 10:20 – 10:40 | Communication Requirements for Linearizable Registers Raïssa Nataf, Yoram Moses |
| 10:45 – 11:30 | Coffee Break |
| Session 7: Sorry, but You Cannot Compute that Here | |
| 11:30 – 11:50 | What Cannot Be Implemented on Weak Memory? Armando Castañeda, Gregory Chockler, Brijesh Dongol, Ori Lahav |
| 11:50 – 12:10 | A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot Yannis Coutouly, Emmanuel Godard |
| 12:10 – 12:15 | BA: Solvability of Three-Process General Tasks Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 12:15 – 12:20 | BA: Colorless tasks and extension-based proofs Yusong Shi, Weidong Liu |
| Session 8: Distributed Protocols | |
| 12:20 – 12:40 | A Knowledge-Based Analysis of Intersection Protocols Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden |
| 12:40 – 13:00 | The Power of Abstract MAC Layer: A Fault-tolerance Perspective Qinzi Zhang, Lewis Tseng |
| 13:00 – 14:30 | Lunch |
| Session 9: Agreement and Replication | |
| 14:30 – 14:50 | Efficient Signature-Free Validated Agreement Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi |
| 14:50 – 15:10 | Sing a Song of Simplex Victor Shoup |
| 15:10 – 15:15 | BA: Best-Possible Unpredictable Proof-of-Stake Lei Fan, Jonathan Katz, Zhenghao Lu, Phuc Thai, Hong-Sheng Zhou |
| 15:15 – 15:35 | Vertical Atomic Broadcast and Passive Replication Manuel Bravo, Gregory Chockler, Alexey Gotsman, Alejandro Naser-Pastoriza, Christian Roldán |
| 15:35 – 15:55 | Content-Oblivious Leader Election on Rings Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin |
| 15:55 – 16:00 | BA: Reconfigurable Heterogeneous Quorum Systems Xiao Li, Mohsen Lesani |
| 16:00 – 16:30 | Coffee Break |
| Session 10: Byzantine-Resilient Computing | |
| 16:30 – 16:50 | Quantum Byzantine Agreement Against Full-information Adversary Longcheng Li, Xiaoming Sun, Jiadong Zhu |
| 16:50 – 17:10 | Byzantine Resilient Distributed Computing on External Data John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, Aishwarya Thiruvengadam |
| Session 11: Graphs, Rumors, and Clocks | |
| 17:00 – 17:20 | On the Power of Graphical Reconfigurable Circuits Yuval Emek, Yuval Gil, Noga Harlev |
| 17:20 – 17:40 | On the Limits of Information Spread by Memory-less Agents Niccolò D’Archivio, Robin Vacus |
| 17:40 – 17:45 | BA: Clock Distribution with Gradient TRIX Christoph Lenzen, Shreyas Srinivas |
| 17:45 – 20:00 | Free Time |
| 20:00 – 22:00 | Conference Banquet and Awards Ceremony (directions) |
Thursday, October 31
| 09:00 – 10:00 | Keynote: Resilient Coordination in Networked Multi-Robot Teams, Stefanie Gil |
| Session 12: Robots on a Plane | |
| 10:00 – 10:20 | Freeze-Tag in L1 has Wake-up Time Five with Linear Complexity Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse |
| 10:20 – 10:40 | Near-linear Time Dispersion of Mobile Agents Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, Toshimitsu Masuzawa |
| 10:40 – 10:45 | BA: Distinct Gathering Under Round Robin Fabian Frei, Koichi Wada |
| 10:45 – 10:50 | BA: Optimal Uniform Circle Formation by Asynchronous Luminous Robots Caterina Feletti, Debasish Pattanayak, Gokarna Sharma |
| 10:50 – 11:30 | Coffee Break |
| Session 13: Self-Organization | |
| 11:30 – 11:50 | Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory Jérémie Chalopin, Shantanu Das, Maria Kokkou |
| 11:50 – 12:10 | The computational power of discrete chemical reaction networks with bounded executions David Doty, Ben Heckmann |
| 12:10 – 12:15 | BA: The Expressive Power of Uniform Population Protocols with Logarithmic Space Philipp Czerner, Vincent Fischer, Roland Guttenberg |
| 12:15 – 12:35 | Single Bridge Formation in Self-Organizing Particle Systems Shunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, Andréa W. Richa |
| 12:35 – 12:55 | Breaking Through the Ω(n)-space Barrier: Population Protocols Decide Double-exponential Thresholds Philipp Czerner |
| 12:55 – 13:00 | BA: Self-stabilizing Graph Exploration by a Single Agent Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei |
| 13:00 – 14:30 | Lunch |
| Session 14: Navigating Graph Congestion | |
| 14:30 – 14:50 | Self-Stabilizing MIS Computation in the Beeping Model George Giakkoupis, Volker Turau, Isabella Ziccardi |
| 14:50 – 15:10 | Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model Leonid Barenboim, Uri Goldenberg |
| 15:10 – 15:30 | Faster cycle detection in the Congested Clique Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams |
| 15:30 – 16:00 | Coffee Break |
| Session 15: Parallel Graph Algorithms | |
| 16:00 – 16:20 | Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling Laxman Dhulipala, Michael Dinitz, Jakub Łącki, Slobodan Mitrović |
| 16:20 – 16:40 | Massively Parallel Ruling Set Made Deterministic Jeff Giliberti, Zahra Parsaeian |
| Session 16: Of Graphs and Proofs | |
| 16:40 – 17:00 | Distributed Model Checking on Graphs of Bounded Treedepth Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 17:00 – 17:20 | Fully Local Succinct Distributed Arguments Eden Aldema Tshuva, Rotem Oshman |
| 17:20 – 17:25 | BA: Decreasing verification radius in local certification Jan Matyáš Křišťan, Josef Erik Sedláček |
| 17:25 – 17:30 | Main Conference Closing |