| 2026 | Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST. | Tijn de Vos, Yannic Maus, Joakim Blikstad |
| 2026 | Keynote Talk: Highly Asynchronous Concurrency in Data Structures. | Robert E. Tarjan |
| 2026 | Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time. | Yuichi Sudo |
| 2026 | The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size. | Gustav Schmid, Alkida Balliu, Fabian Kuhn, Dennis Olivetti, Sebastian Brandt, Timoth Picavet |
| 2026 | Keynote Talk: Parallel Algorithm Engineering Reconsidered. | Peter Sanders |
| 2026 | Improved Bounds for Distributed Random Walks and Spanning Trees. | Gopal Pandurangan, Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel |
| 2026 | Dijkstra Prize Keynote: The Ω~(D+n) Lower Bound Story of Distributed Algorithms. | Gopal Pandurangan |
| 2026 | Brief Announcement: Sinkless Orientation Made Trivial. | Alexandre Nolin |
| 2026 | Fast Byzantine Total Order Broadcast. | Matteo Monti, Martina Camaioni, Pierre-Louis Roman |
| 2026 | Brief Announcement: Subcubic Coin Tossing in Asynchrony without PKI. | Mose Mizrahi, Roger Wattenhofer |
| 2026 | Brief Announcement: Fast Deterministic Distributed Degree Splitting. | Yannic Maus, Alexandre Nolin, Florian Schager |
| 2026 | Information-Theoretic Optimistic Verifiable Secret Sharing. | Chen-Da Liu-Zhang, Martin Hirt, Emanuele Marsicano |
| 2026 | Reaching Univalency with Subquadratic Communication. | Andrew Lewis-Pye |
| 2026 | Byzantine Consensus in the Partially Authenticated Setting. | Christoph Lenzen, Julian Loss, Kecheng Shi, Benedikt Wagner |
| 2026 | Early-Stabilizing Counting. | Christoph Lenzen, Julian Loss |
| 2026 | Gradient Clock Synchronization with Practically Constant Local Skew. | Christoph Lenzen |
| 2026 | Conflict-Freedom as a Progress Condition. | Petr Kuznetsov, Pierre Sutra, Guillermo Toyos-Marfurt |
| 2026 | Brief Announcement: Distributed Statistical Zero-Knowledge Proofs via Sumcheck. | Benjamin Jauregui, Masayuki Miyamoto |
| 2026 | Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model. | Benjamin Jauregui, Jason Li, Pedro Montealegre, Ioan Todinca |
| 2026 | Brief Announcement: Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience. | Michael Yiqing Hu, Alvin Hong Yao Yan, Jialin Li |
| 2026 | Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model. | Vassos Hadzilacos, Myles Thiessen, Sam Toueg |
| 2026 | Brief Announcement: Distributed Non-Interactive Zero-Knowledge Proofs. | Alex Bredariol Grilo, Ami Paz, Mor Perry |
| 2026 | Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience. | Diana Ghinea, Darya Melnyk, Tijana Milentijevic |
| 2026 | Deterministic Distributed Algorithms for Short Disjoint Paths. | Mohsen Ghaffari, Hsin-Hao Su |
| 2026 | Brief Announcement: Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems. | Vijay Kumar Garg, Rohan Garg |