| 2025 | 3-Majority and 2-Choices with Many Opinions. Nobutaka Shimizu, Takeharu Shiraga |
| 2025 | A Shared Archive of Snapshots. Prasad Jayanti, Siddhartha Visveswara Jayanti |
| 2025 | A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols. Henry Austin, Petra Berenbrink, Tom Friedetzky, Thorsten Götte, Lukas Hintze |
| 2025 | A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. Linda Cook, Eun Jung Kim, Tomás Masarík |
| 2025 | All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free. Orr Fischer, Merav Parter |
| 2025 | An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model. Antoine El-Hayek, Robert Elsässer, Stefan Schmid |
| 2025 | An Exact Characterization of the Two-shot Deterministic Objects Solving Two-process Consensus. Minh Tung Nguyen, Pierre Sutra |
| 2025 | Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. Ittai Abraham, Eli Chouatt, Yossi Gilad, Gilad Stern, Sophia Yakoubov |
| 2025 | Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems. Armando Castañeda, Gilde Valeria Rodríguez |
| 2025 | Auditing without Leaks Despite Curiosity. Hagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, Corentin Travers |
| 2025 | Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. Henry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan |
| 2025 | Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2025 | Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg |
| 2025 | Brief Announcement: Distributed Graph Algorithms with Predictions. Joan Boyar, Faith Ellen, Kim S. Larsen |
| 2025 | Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks. Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, Gopal Pandurangan |
| 2025 | Brief Announcement: Extending Asynchronous Byzantine Agreement with Crusader Agreement. Mose Mizrahi Erbes, Roger Wattenhofer |
| 2025 | Brief Announcement: Fast Atomic Snapshot and Asynchronous Latency. João Paulo Bezerra, Petr Kuznetsov, Luciano Freitas de Souza |
| 2025 | Brief Announcement: Fast and Gas-efficient Private Sealed-bid Auctions. Jonas Ballweg, Amir Kafshdar Goharshady, Zhaorun Lin |
| 2025 | Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL Model. Niccolò D'Archivio, Amos Korman, Emanuele Natale, Robin Vacus |
| 2025 | Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them. Clément L. Canonne, Yun Li, Seeun William Umboh |
| 2025 | Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols. Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid |
| 2025 | Brief Announcement: New Distributed Interactive Proofs for Planarity: A Matter of Left and Right. Yuval Gil, Merav Parter |
| 2025 | Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. Michael Anoprenko, Petr Kuznetsov, Vitaly Aksenov |
| 2025 | Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines. Yann Bourreau, Ananth Narayanan, Alexandre Nolin |
| 2025 | Brief Announcement: Revisiting Lower Bounds for Two-Step Consensus. Fedor Ryabinin, Alexey Gotsman, Pierre Sutra |
| 2025 | Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up. Peter Robinson, Ming Ming Tan |
| 2025 | Brief Announcement: Robust and Scalable Renaming with Subquadratic Bits. Sirui Bai, Xinyu Fu, Yuheng Wang, Yuyi Wang, Chaodong Zheng |
| 2025 | Brief Announcement: Self-Stabilizing Recoverable Mutual Exclusion. Wojciech Golab, Elad Michael Schiller |
| 2025 | Brief Announcement: Stranger-Free Tasks. Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld |
| 2025 | Brief Announcement: Strong and Hiding Distributed Certification of Augusto Modanese, Pedro Montealegre, Martín Ríos-Wilson |
| 2025 | Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding. Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, Mingyang Yang |
| 2025 | Brief Announcement: Towards Energy-Efficient Distributed Agreement. Hugo Mirault, Peter Robinson |
| 2025 | Brief Announcement: Towards Optimal Distributed Delta Coloring. Manuel Jakob, Yannic Maus |
| 2025 | Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees. Marc Fuchs, Diana Ghinea, Zahra Parsaeian |
| 2025 | Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing. Daniel Escudero, Elisaweta Masserova, Antigoni Polychroniadou |
| 2025 | Brief Announcement: Using Detectability to Simplify the Design of Concurrent Algorithms for Persistent Memory. Ahmed Fahmy, Wojciech Golab, Neeraj Mittal |
| 2025 | Byzantine Agreement with Predictions. Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Seth Gilbert |
| 2025 | Byzantine Stable Matching. Andrei Constantinescu, Marc Dufay, Diana Ghinea, Roger Wattenhofer |
| 2025 | Clock Distribution with Gradient TRIX. Shreyas Srinivas, Christoph Lenzen |
| 2025 | Communication-Optimal Convex Agreement. Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer |
| 2025 | DAG-based Consensus with Asymmetric Trust. Ignacio Amores-Sesar, Christian Cachin, Juan Villacis, Luca Zanolini |
| 2025 | Decentralized Distributed Graph Coloring: Cluster Graphs. Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin |
| 2025 | Density-Dependent Graph Orientation and Coloring in Scalable MPC. Mohsen Ghaffari, Christoph Grunau |
| 2025 | Deterministic Distributed DFS via Cycle Separators in Planar Graphs. Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport |
| 2025 | Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm. Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Taïssir Marcé |
| 2025 | Distributed Maximum Flow in Planar Graphs. Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann |
| 2025 | Improved Byzantine Agreement under an Adaptive Adversary. Fabien Dufoulon, Gopal Pandurangan |
| 2025 | Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols. Leszek Gasieniec, Tytus Grodzicki, Grzegorz Stachowiak |
| 2025 | Keynote: Disaggregated Memory and the Revival of Memory Research. Marcos K. Aguilera |
| 2025 | Keynote: Examples of Mantras as a Beacon in Guiding Research. Eli Gafni |
| 2025 | Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek |
| 2025 | Message Optimality and Message-Time Trade-offs for APSP and Beyond. Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson |
| 2025 | Minimalist Leader Election Under Weak Communication. Robin Vacus, Isabella Ziccardi |
| 2025 | Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols. Kaya Alpturer, Gerald Huang, Ron van der Meyden |
| 2025 | Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs. Malte Baumecker, Yannic Maus, Jara Uitto |
| 2025 | On Interplanetary and Relativistic Distributed Computing. Siddhartha Visveswara Jayanti |
| 2025 | Optimal Distributed Replacement Paths. Yi-Jun Chang, Yanyu Chen, Dipan Dey, Gopinath Mishra, Hung Thuan Nguyen, Bryce Sanchez |
| 2025 | Optimal Local Certification on Graphs of Bounded Pathwidth. Dan Alden Baterisna, Yi-Jun Chang |
| 2025 | Perfectly-secure Network-agnostic MPC with Optimal Resiliency. Shravani Patil, Arpita Patra |
| 2025 | Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2025, Hotel Las Brisas Huatulco, Huatulco, Mexico, June 16-20, 2025 Alkida Balliu, Fabian Kuhn |
| 2025 | Quantum Communication Advantage for Leader Election and Agreement. Fabien Dufoulon, Frédéric Magniez, Gopal Pandurangan |
| 2025 | Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement. Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira |
| 2025 | Round and Communication Efficient Graph Coloring. Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Farrel D. Salim |
| 2025 | Solvability Characterization for General Three-Process Tasks. Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2025 | Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost. Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti, Mikaël Rabie |
| 2025 | Sublinear-Time Sampling of Spanning Trees in the Congested Clique. Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel |
| 2025 | Tight Bounds on Channel Reliability via Generalized Quorum Systems. Alejandro Naser-Pastoriza, Gregory V. Chockler, Alexey Gotsman, Fedor Ryabinin |
| 2025 | Towards Optimal Deterministic LOCAL Algorithms on Trees. Sebastian Brandt, Ananth Narayanan |
| 2025 | When is liquid democracy possible?: On the manipulation of variance. Krishnendu Chatterjee, Seth Gilbert, Stefan Schmid, Jakub Svoboda, Michelle Yeo |
| 2025 | You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processes. Xing Hu, Sam Toueg |