Tuesday
| Opening | 08:40 | |
| Session 1 | 08:45-09:05 | Deterministic Distributed Algorithms for Short Disjoint Paths |
| 09:05-09:25 | Girth Approximations in the CONGEST Model | |
| 09:25-09:45 | Distributed Treewidth Computation and Courcelle’s Theorem in the CONGEST Model | |
| 09:45-09:50 | Brief Announcement: On Energy Complexity and Multi-Instance Computation in the Congested Clique | |
| 09:50-09:55 | Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST | |
| 09:55-10:00 | Brief Announcement: 2-Coloring Cycles in One Round | |
| Coffee | 10:00-10:30 | |
| Session 2 | 10:30-10:50 | Simple and Efficient Randomized Wait-Free Locks |
| 10:50-11:10 | Generalized and Reinitializable Concurrent Fast Arrays | |
| 11:10-11:15 | Brief Announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table | |
| 11:15-11:20 | Brief Announcement: Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems | |
| Session 3 | 11:20-11:40 | Undecided State Dynamics with Many Opinions |
| 11:40-12:00 | Fast Gossip-Based Rumor Spreading Using Small Messages | |
| 12:00-12:20 | Complementary Time–Space Tradeoff for Self-Stabilizing Leader Election | |
| Lunch | 12:20-14:00 | |
| Session 4 | 14:00-14:20 | Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs |
| 14:20-14:40 | Early-Stabilizing Counting | |
| 14:40-15:00 | Gradient Clock Synchronization with Practically Constant Local Skew | |
| Session 5 | 15:05-15:25 | Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes |
| 15:25-15:45 | Distributed Algorithms for Potential Problems | |
| 15:45-15:50 | Brief Announcement: Exponential Quantum Advantage for Message Complexity in Distributed Algorithms | |
| 15:50-15:55 | Brief Announcement: Distributed Statistical Zero-Knowledge Proofs via Sumcheck | |
| 15:55-16:00 | Brief Announcement: Distributed Non-Interactive Zero-Knowledge Proofs | |
| Coffee | 16:00-16:25 | |
| Invited Talk | 16:25-17:35 | Keynote Talk: Parallel Algorithm Engineering Reconsidered |
| Business Meeting | 17:45 |
Wednesday
| Session 6 | 08:40-09:00 | From Few to Many Faults: Optimal Adaptive Byzantine Agreement |
| 09:00-09:20 | Reaching Univalency with Subquadratic Communication | |
| 09:20-09:40 | Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience | |
| 09:40-09:45 | Brief Announcement: Communication Efficient Byzantine Agreement with Predictions | |
| 09:45-09:50 | Brief Announcement: BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs | |
| 09:50-09:55 | Brief Announcement: What is Agreement About if not Common Knowledge? | |
| 09:55-10:00 | Brief Announcement: Byzantine Machine Learning, MultiKrum and an Optimal Notion of Robustness | |
| Coffee | 10:00-10:30 | |
| Dijkstra Talk | 10:30-11:30 | Dijkstra Prize Keynote: The $\tilde{\Omega}(D+\sqrt{n})$ Lower Bound Story of Distributed Algorithms |
| Session 7 | 11:35-11:55 | Efficient Counting and Simulation in Content-Oblivious Rings |
| 11:55-12:00 | Brief Announcement: Toward Uniform Content-Oblivious Leader Election on General Graphs | |
| 12:00-12:20 | Distinct Gathering and the Virtue of Self-Consistency | |
| Lunch | 12:20-14:00 | |
| Session 8 | 14:00-14:20 | Nearly Quadratic Asynchronous Distributed Key Generation from Recursive Consensus |
| 14:20-14:40 | Information-Theoretic Optimistic Verifiable Secret Sharing | |
| 14:40-15:00 | Balanced and Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Sub-Quadratic Communication | |
| 15:00-15:20 | Byzantine Consensus in the Partially Authenticated Setting | |
| 15:20-15:25 | Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity | |
| 15:25-15:30 | Brief Announcement: Subcubic Coin Tossing in Asynchrony without PKI | |
| Coffee | 15:30-15:55 | |
| Session 9 | 15:55-16:15 | New Hardness Results for the LOCAL Model via a Simple Self-Reduction |
| 16:15-16:35 | The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size | |
| 16:35-16:40 | Brief Announcement: Is a LOCAL Algorithm Computable? | |
| 16:40-16:45 | Brief Announcement: It Does Not Matter How You Define Locally Checkable Labelings | |
| 16:45-16:50 | Brief Announcement: Fast Deterministic Distributed Degree Splitting | |
| 16:50-16:55 | Brief Announcement: Sinkless Orientation Made Trivial | |
| Session 10 | 17:00-17:20 | Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers |
| 17:20-17:40 | The Task Completion Problem and its Application to Crash-Resilient Computation | |
| 17:40-18:00 | A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput | |
| Barbecue | 19:30 |
Thursday
| Session 11 | 08:40-09:00 | Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition |
| 09:00-09:20 | Meta-Theorems for Cuttable Distributed Problems | |
| 09:20-09:40 | Distributed Stochastic Graph Algorithms | |
| 09:40-10:00 | Improved Bounds for Distributed Random Walks and Spanning Trees | |
| Coffee | 10:00-10:30 | |
| Session 12 | 10:30-10:50 | Ranking Opinions with Few States in Population Protocols |
| 10:50-11:10 | Order Statistics in Population Protocols via Simple Dynamics | |
| 11:10-11:15 | Brief Announcement: DéjàVu: A Minimalistic Mechanism for Distributed Plurality Consensus | |
| 11:15-11:20 | Brief Announcement: Limit Laws for Consensus Protocols on the Complete Graph | |
| Session 13 | 11:20-11:40 | Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing |
| 11:40-12:00 | Conflict-Freedom as a Progress Condition | |
| 12:00-12:20 | Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model | |
| Lunch | 12:20-14:00 | |
| Session 14 | 14:00-14:20 | Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT |
| 14:20-14:40 | FEAT: Fair and Efficient Adversarial Transaction Ordering | |
| 14:40-15:00 | Fast Byzantine Total Order Broadcast | |
| 15:00-15:05 | Brief Announcement: Delay-Optimal Transaction Order Fairness | |
| Pause | 15:05 | |
| Session 15 | 15:10-15:30 | Distributed Renaming with Subquadratic Bits via Scalable Committee Election |
| 15:30-15:50 | Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience | |
| 15:50-16:10 | Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs | |
| 16:10-16:15 | Brief Announcement: Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience | |
| Coffee | 16:15-16:45 | |
| Invited Talk | 16:45-17:55 | Highly Asynchronous Concurrency in Data Structures |
| Closing Remarks | 17:55 |