| 2026 | Brief Announcement: Delay-Optimal Transaction Order Fairness. | Zhuo Cai, Amir Kafshdar Goharshady |
| 2026 | Ranking Opinions with Few States in Population Protocols. | Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid |
| 2026 | Meta-Theorems for Cuttable Distributed Problems. | Marthe Bonamy, Cyril Gavoille, Avinandan Das, Jukka Suomela, Timoth Picavet, Alexandra Wesolek |
| 2026 | Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs. | Llia Blin, Sylvain Gay, Isabella Ziccardi |
| 2026 | A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput. | Matthias Bentert, Chen Avin, Stefan Schmid |
| 2026 | Brief Announcement: Limit Laws for Consensus Protocols on the Complete Graph. | Julian Becker, Konstantinos Panagiotou |
| 2026 | Brief Announcement: Byzantine Machine Learning, MultiKrum and an Optimal Notion of Robustness. | Gilles Bareilles, Wassim Bouaziz, Julien Fageot, El-Mahdi El-Mhamdi |
| 2026 | Brief Announcement: On Energy Complexity and Multi-Instance Computation in the Congested Clique. | Dominick Banasik, Varsha Dani |
| 2026 | New Hardness Results for the LOCAL Model via a Simple Self-Reduction. | Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Dennis Olivetti |
| 2026 | Distributed Algorithms for Potential Problems. | Alkida Balliu, Thomas Boudier, Francesco d'Amore, Fabian Kuhn, Dennis Olivetti, Gustav Schmid, Jukka Suomela |
| 2026 | Distributed Renaming with Subquadratic Bits via Scalable Committee Election. | Sirui Bai, Xinyu Fu, Yuyi Wang, Chaodong Zheng |
| 2026 | Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers. | John Augustine, Henning Hillebrandt, Manish Kumar, Christian Scheideler, Julian Werthmann |
| 2026 | Brief Announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table. | Hagit Attiya, Rotem Oshman, Noa Schiller |
| 2026 | Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience. | Hagit Attiya, Itay Flam, Jennifer L. Welch |
| 2026 | Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing. | Hagit Attiya, Armando Castaeda, Constantin Enea |
| 2026 | Simple and Efficient Randomized Wait-Free Locks. | Kahbod Aeini, Dante Bencivenga, George Giakkoupis, Philipp Woelfel |
| 2026 | Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT. | Ittai Abraham, Sourav Das, Yuval Efron, Jovan Komatovic |
| 2026 | Nearly Quadratic Asynchronous Distributed Key Generation from Recursive Consensus. | Ittai Abraham, Renas Bacho, Julian Loss, Gilad Stern |
| 2025 | Minimalist Leader Election Under Weak Communication. | Robin Vacus, Isabella Ziccardi |
| 2025 | Clock Distribution with Gradient TRIX. | Shreyas Srinivas, Christoph Lenzen |
| 2025 | 3-Majority and 2-Choices with Many Opinions. | Nobutaka Shimizu, Takeharu Shiraga |
| 2025 | Brief Announcement: Revisiting Lower Bounds for Two-Step Consensus. | Fedor Ryabinin, Alexey Gotsman, Pierre Sutra |
| 2025 | Sublinear-Time Sampling of Spanning Trees in the Congested Clique. | Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel |
| 2025 | Perfectly-secure Network-agnostic MPC with Optimal Resiliency. | Shravani Patil, Arpita Patra |
| 2025 | An Exact Characterization of the Two-shot Deterministic Objects Solving Two-process Consensus. | Minh Tung Nguyen, Pierre Sutra |