| 2025 | A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. | Linda Cook, Eun Jung Kim, Toms Masark |
| 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 | When is liquid democracy possible?: On the manipulation of variance. | Krishnendu Chatterjee, Seth Gilbert, Stefan Schmid, Jakub Svoboda, Michelle Yeo |
| 2025 | Round and Communication Efficient Graph Coloring. | Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Farrel D. Salim |
| 2025 | Optimal Distributed Replacement Paths. | Yi-Jun Chang, Yanyu Chen, Dipan Dey, Gopinath Mishra, Hung Thuan Nguyen, Bryce Sanchez |
| 2025 | Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding. | Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, Mingyang Yang |
| 2025 | Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems. | Armando Castaeda, Gilde Valeria Rodrguez |
| 2025 | Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them. | Clment 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: Distributed Graph Algorithms with Predictions. | Joan Boyar, Faith Ellen, Kim S. Larsen |
| 2025 | Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines. | Yann Bourreau, Ananth Narayanan, Alexandre Nolin |
| 2025 | Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. | Marthe Bonamy, Cyril Gavoille, Timoth Picavet, Alexandra Wesolek |
| 2025 | Brief Announcement: Fast Atomic Snapshot and Asynchronous Latency. | Joo Paulo Bezerra, Petr Kuznetsov, Luciano Freitas de Souza |
| 2025 | Byzantine Agreement with Predictions. | Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Seth Gilbert |
| 2025 | Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs. | Malte Baumecker, Yannic Maus, Jara Uitto |
| 2025 | Optimal Local Certification on Graphs of Bounded Pathwidth. | Dan Alden Baterisna, Yi-Jun Chang |
| 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: Fast and Gas-efficient Private Sealed-bid Auctions. | Jonas Ballweg, Amir Kafshdar Goharshady, Zhaorun Lin |
| 2025 | Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost. | Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti, Mikal Rabie |
| 2025 | Brief Announcement: Robust and Scalable Renaming with Subquadratic Bits. | Sirui Bai, Xinyu Fu, Yuheng Wang, Yuyi Wang, Chaodong Zheng |
| 2025 | Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. | Henry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan |
| 2025 | A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols. | Henry Austin, Petra Berenbrink, Tom Friedetzky, Thorsten Gtte, Lukas Hintze |
| 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 | Solvability Characterization for General Three-Process Tasks. | Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2025 | Auditing without Leaks Despite Curiosity. | Hagit Attiya, Antonio Fernndez Anta, Alessia Milani, Alexandre Rapetti, Corentin Travers |