| 2025 | 39th International Symposium on Distributed Computing, DISC 2025, Berlin, Germany, October 27-31, 2025 Dariusz R. Kowalski |
| 2025 | ABEL: Perfect Asynchronous Byzantine Extension from List-Decoding. Ittai Abraham, Gilad Asharov |
| 2025 | Amnesiac Flooding: Easy to Break, Hard to Escape. Henry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan |
| 2025 | An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention. Dan Alistarh, Faith Ellen, Alexander Fedorov |
| 2025 | Approach of Agents with Restricted Fuel Tanks. Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, Grzegorz Stachowiak |
| 2025 | Asynchronous Latency and Fast Atomic Snapshot. João Paulo Bezerra, Luciano Freitas de Souza, Petr Kuznetsov, Matthieu Rambaud |
| 2025 | Auditable Shared Objects: From Registers to Synchronization Primitives. Hagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, Corentin Travers |
| 2025 | Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection. Krishnendu Chatterjee, Jan Matyás Kristan, Stefan Schmid, Jakub Svoboda, Michelle Yeo |
| 2025 | Brief Announcement: Asynchronous Approximate Agreement with Quadratic Communication. Mose Mizrahi Erbes, Roger Wattenhofer |
| 2025 | Brief Announcement: Carry the Tail in Consensus Protocols. Suyash Gupta, Dakai Kang, Dahlia Malkhi, Mohammad Sadoghi |
| 2025 | Brief Announcement: Communication Patterns for Optimal Resilience. Hagit Attiya, Itay Flam, Jennifer L. Welch |
| 2025 | Brief Announcement: Concurrent Double-Ended Priority Queues. Panagiota Fatourou, Eric Ruppert, Ioannis Xiradakis |
| 2025 | Brief Announcement: Congested Clique Counting for Local Gibbs Distributions. Joshua Z. Sobel |
| 2025 | Brief Announcement: DAGs for the Masses. Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, Petr Kuznetsov |
| 2025 | Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings. John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg |
| 2025 | Brief Announcement: Distributed Sparsest Cut via Eigenvalue Estimation. Yannic Maus, Tijn de Vos |
| 2025 | Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs. Salwa Faour, Fabian Kuhn |
| 2025 | Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication. Andrei Constantinescu, Marc Dufay, Anton Paramonov, Roger Wattenhofer |
| 2025 | Brief Announcement: Highly Dynamic and Fully Distributed Data Structures. John Augustine, Antonio Cruciani, Iqra Altaf Gillani |
| 2025 | Brief Announcement: Incrementally Verifiable Distributed Computation. Eden Aldema Tshuva, Rotem Oshman |
| 2025 | Brief Announcement: Maintaining a Bounded Degree Expander in Dynamic Peer-To-Peer Networks. Antonio Cruciani |
| 2025 | Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2025 | Brief Announcement: Optimal Dispersion Under Asynchrony. Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma |
| 2025 | Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc |
| 2025 | Brief Announcement: Proximal Byzantine Agreement: Improved Accuracy for Fault-Tolerant Replicated Datastreams. Roy Shadmon, Owen Arden |
| 2025 | Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More. Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, Kui Ren |
| 2025 | Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics. Rida A. Bazzi, Anya Chaturvedi, Andréa W. Richa, Peter Vargas |
| 2025 | Brief Announcement: The Virtue of Self-Consistency. Fabian Frei, Koichi Wada |
| 2025 | Brief Announcement: Time, Fences and the Ordering of Events in TSO. Raïssa Nataf, Yoram Moses |
| 2025 | Brief Announcement: Universal Dancing by Luminous Robots Under Sequential Schedulers. Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Nicola Santoro |
| 2025 | Brief Announcement: Weaker Assumptions for Asymmetric Trust. Christian Cachin, Juan Villacis |
| 2025 | Byzantine Consensus in the Random Asynchronous Model. George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, Igor Zablotchi |
| 2025 | Compact Routing Schemes in Undirected and Directed Graphs. Avi Kadria, Liam Roditty |
| 2025 | Complexity Landscape for Local Certification. Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun |
| 2025 | Content-Oblivious Leader Election in 2-Edge-Connected Networks. Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2025 | Coordination Through Stochastic Channels. Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum |
| 2025 | DAG It Off: Latency Prefers No Common Coins. Ignacio Amores-Sesar, Viktor Grøndal, Adam Holmgård, Mads Ottendal |
| 2025 | Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity. Lélia Blin, Franck Petit, Sébastien Tixeuil |
| 2025 | Distributed Computation with Local Advice. Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela |
| 2025 | Distributed Download from an External Data Source in Byzantine Majority Settings. John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg |
| 2025 | Energy-Efficient Maximal Independent Sets in Radio Networks. Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, Gopal Pandurangan |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Hierarchical Consensus: Scalability Through Optimism and Weak Liveness. Pedro Antonino, Antoine Durand, A. W. Roscoe |
| 2025 | Kudzu: Fast and Simple High-Throughput BFT. Victor Shoup, Jakub Sliwinski, Yann Vonlanthen |
| 2025 | LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics. Martin Hilgendorf, Marina Papatriantafilou |
| 2025 | Lower Bounds for k-Set Agreement in Fault-Prone Networks. Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz, Ulrich Schmid, Hugo Rincon Galeana |
| 2025 | Model-Agnostic Approximation of Constrained Forest Problems. Corinna Coupette, Alipasha Montaseri, Christoph Lenzen |
| 2025 | Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs. Ashish Saxena, Kaushik Mondal |
| 2025 | New Distributed Interactive Proofs for Planarity: A Matter of Left and Right. Yuval Gil, Merav Parter |
| 2025 | New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs. Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d'Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Jukka Suomela |
| 2025 | On the Efficiency of Dynamic Transaction Scheduling in Blockchain Sharding. Ramesh Adhikari, Costas Busch, Miroslav Popovic |
| 2025 | On the Randomized Locality of Matching Problems in Regular Graphs. Seri Khoury, Manish Purohit, Aaron Schild, Joshua R. Wang |
| 2025 | On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. Matthias Artmann, Andreas Padalkin, Christian Scheideler |
| 2025 | On the h-Majority Dynamics with Many Opinions. Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis, Emanuele Natale |
| 2025 | PIPQ: Strict Insert-Optimized Concurrent Priority Queue. Olivia Grimes, Ahmed Hassan, Panagiota Fatourou, Roberto Palmieri |
| 2025 | Perpetual Exploration in Anonymous Synchronous Networks with a Byzantine Black Hole. Adri Bhattacharya, Pritam Goswami, Evangelos Bampas, Partha Sarathi Mandal |
| 2025 | Robust Predicate and Function Computation in Continuous Chemical Reaction Networks. Kim Calabrese, David Doty, Mina Latifi |
| 2025 | Strong Linearizability Without Compare&Swap: The Case of Bags. Faith Ellen, Gal Sela |
| 2025 | TEE Is Not a Healer: Rollback-Resistant Reliable Storage. Sadegh Keshavarzi, Gregory V. Chockler, Alexey Gotsman |
| 2025 | Team Formation and Applications. Yuval Emek, Shay Kutten, Ido Rafael, Gadi Taubenfeld |
| 2025 | The Complexity Landscape of Dynamic Distributed Subgraph Finding. Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, Mingyang Yang |
| 2025 | Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders. Emilio Cruciani, Sebastian Forster, Tijn de Vos |
| 2025 | Towards Fully Automatic Distributed Lower Bounds. Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Joonatan Saarhelo |
| 2025 | Towards Optimal Distributed Edge Coloring with Fewer Colors. Manuel Jakob, Yannic Maus, Florian Schager |
| 2025 | Two for One, One for All: Deterministic LDC-Based Robust Computation in Congested Clique. Keren Censor-Hillel, Orr Fischer, Ran Gelles, Pedro Soto |
| 2025 | Validity in Network-Agnostic Byzantine Agreement. Andrei Constantinescu, Marc Dufay, Diana Ghinea, Roger Wattenhofer |
| 2025 | Weight Reduction in Distributed Protocols: New Algorithms and Analysis. Anatoliy Zinovyev |
| 2025 | pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer. Orestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, Dionysis Zindros |