| 2026 | Brief Announcement: Exponential Quantum Advantage for Message Complexity in Distributed Algorithms. | Franois Le Gall, Mal Luce, Joseph Marchand, Mathieu Roget |
| 2026 | Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs. | Marc Fuchs, Diana Ghinea, Zahra Parsaeian, Joel Rybicki |
| 2026 | Distinct Gathering and the Virtue of Self-Consistency. | Fabian Frei, Koichi Wada |
| 2026 | Brief Announcement: Toward Uniform Content-Oblivious Leader Election on General Graphs. | Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin |
| 2026 | Brief Announcement: 2-Coloring Cycles in One Round. | Maxime Flin, Alesya Raevskaya, Ronja Stimpert, Jukka Suomela, Qingxin Yang |
| 2026 | The Task Completion Problem and its Application to Crash-Resilient Computation. | Orr Fischer, Ran Gelles |
| 2026 | Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes. | Arnold Filtser, Orr Fischer |
| 2026 | Balanced and Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Sub-Quadratic Communication. | Hanwen Feng, Tiancheng Mai, Qiang Tang |
| 2026 | Brief Announcement: BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs. | Fatima Elsheimy, Simon Holmgaard Kamp |
| 2026 | Brief Announcement: Communication Efficient Byzantine Agreement with Predictions. | Muhammad Ayaz Dzulfikar, Seth Gilbert |
| 2026 | Fast Gossip-Based Rumor Spreading Using Small Messages. | Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan |
| 2026 | FEAT: Fair and Efficient Adversarial Transaction Ordering. | Tien Tuan Anh Dinh, Dakai Kang, Mohammad Sadoghi |
| 2026 | Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition. | Peter Davies-Peck |
| 2026 | Brief Announcement: What is Agreement About if not Common Knowledge? | Or David, Yoram Moses |
| 2026 | Order Statistics in Population Protocols via Simple Dynamics. | Niccol D'Archivio, Hind AlMahmoud, Emanuele Natale, Frederik Mallmann-Trenn |
| 2026 | Brief Announcement: DjVu: A Minimalistic Mechanism for Distributed Plurality Consensus. | Francesco d'Amore, Niccol D'Archivio, George Giakkoupis, Frdric Giroire, Emanuele Natale |
| 2026 | Brief Announcement: It Does Not Matter How You Define Locally Checkable Labelings. | Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela |
| 2026 | Brief Announcement: Is a LOCAL Algorithm Computable? | Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela |
| 2026 | Undecided State Dynamics with Many Opinions. | Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga |
| 2026 | From Few to Many Faults: Optimal Adaptive Byzantine Agreement. | Andrei Constantinescu, Marc Dufay, Anton Paramonov, Roger Wattenhofer |
| 2026 | Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity. | Ashish Choudhury, Madhav Natarajan H |
| 2026 | Girth Approximations in the CONGEST Model. | Shiri Chechik, Gur Lifshitz, Doron Mukhtar |
| 2026 | Efficient Counting and Simulation in Content-Oblivious Rings. | Jrmie Chalopin, Yi-Jun Chang, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2026 | Distributed Stochastic Graph Algorithms. | Keren Censor-Hillel, Aditi Dudeja, George Giakkoupis |
| 2026 | Generalized and Reinitializable Concurrent Fast Arrays. | N. Efe ekirge, Owen Chen, Siddhartha Jayanti, Evan Lucca |