| 2026 | 29th International Conference on Principles of Distributed Systems, OPODIS 2025, Iaşi, Romania, December 3-5, 2025 Andrei Arusoaie, Emanuel Onica, Michael Spear, Sara Tucci Piergiovanni |
| 2025 | A General Input-Dependent Colorless Computability Theorem and Applications to Core-Dependent Adversaries. Yannis Coutouly, Emmanuel Godard |
| 2025 | A Hierarchy of Unrestricted Deterministic Objects with Consensus Number 1. Warren Zhu |
| 2025 | Asynchronous Approximate Agreement with Quadratic Communication. Mose Mizrahi Erbes, Roger Wattenhofer |
| 2025 | BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation. Alireza Kavousi, Duc Viet Le, Philipp Jovanovic, George Danezis |
| 2025 | Byzantine-Tolerant Phase Clock. Costas Busch, Pawel Garncarek, Dariusz R. Kowalski |
| 2025 | Computing in a Faulty Congested Clique. Keren Censor-Hillel, Pedro Soto |
| 2025 | Computing with Content-Oblivious Messages (Invited Talk). Giuseppe Antonio Di Luna |
| 2025 | Contention-Aware Cooperation. Timothé Albouy, Davide Frey, Mathieu Gestin, Michel Raynal, François Taïani |
| 2025 | Demand-Aware Small-World Networks on Clustered Demands. Chen Avin, Robert Elsässer, Aleksander Figiel, Darya Melnyk, Stefan Schmid |
| 2025 | Distributed (Δ+1)-Coloring in Graphs of Bounded Neighborhood Independence. Marc Fuchs, Fabian Kuhn |
| 2025 | Distributed Download from an External Data Source in Asynchronous Faulty Settings. John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg |
| 2025 | Efficient Byzantine Reliable Broadcast in the Failure Case. Thomas Locher |
| 2025 | Fast Re-Routing in Networks: On the Complexity of Perfect Resilience. Matthias Bentert, Esra Ceylan, Valentin Hübner, Stefan Schmid, Jirí Srba |
| 2025 | Fast Rerouting Against Dynamic Failures: 2-Resilience via Ear-Decomposition and Planarity. Wenkai Dai, Klaus-Tycho Foerster, Stefan Schmid |
| 2025 | Formalizing Rollback Netcodes for Robust and Real-Time Client-Server Architectures. Yérom-David Bromberg, Jérémie Decouchant, Manon Sourisseau, François Taïani |
| 2025 | Foundations of Fiat-Denominated Loans Collateralized by Cryptocurrencies. Pavel Hubácek, Jan Václavek, Michelle Yeo |
| 2025 | From Principles to Practice: Algorithmic Insights from Building the Internet Computer (Invited Talk). Yvonne-Anne Pignolet |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | How Exhaustive Does an Extension-Based Proof Need to Be? Faith Ellen, Shihao Liu, Leqi Zhu, Eli Gafni, Rati Gelashvili |
| 2025 | Making Democracy Work: Fixing and Simplifying Egalitarian Paxos. Fedor Ryabinin, Alexey Gotsman, Pierre Sutra |
| 2025 | Mobile Byzantine Agreement in a Trusted World. Bo Pan, Maria Potop-Butucaru |
| 2025 | Morpheus Consensus: Excelling on Trails and Autobahns. Andrew Lewis-Pye, Ehud Shapiro |
| 2025 | On Time-Optimal, Fault-Tolerant Algorithms for Connected Consensus Beyond Grade Two. Alan Ernesto Arteaga Vázquez |
| 2025 | On the Complexity of Distributed Edge Coloring and Orientation Problems. Sebastian Brandt, Fabian Kuhn, Zahra Parsaeian |
| 2025 | Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks. Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc |
| 2025 | Orientation Does Not Help with 3-Coloring a Grid in Online-LOCAL. Thomas Boudier, Filippo Casagrande, Avinandan Das, Massimo Equi, Henrik Lievonen, Augusto Modanese, Ronja Stimpert |
| 2025 | Recognizing Hereditary Properties in the Presence of Byzantine Nodes. David Cifuentes-Núñez, Pedro Montealegre, Ivan Rapaport |
| 2025 | Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors. Shota Takahashi, Haruki Kanaya, Shoma Hiraoka, Ryota Eguchi, Yuichi Sudo |
| 2025 | Recoverable Lock-Free Locks. Hagit Attiya, Panagiota Fatourou, Eleftherios Kosmas, Yuanhao Wei |
| 2025 | Resolving Conflicts with Grace: Dynamically Concurrent Universality. Petr Kuznetsov, Nathan Josia Schrodt |
| 2025 | SCONE Confidential Computing Environment: Protecting Applications Against Powerful Adversaries (Invited Talk). Christof Fetzer |
| 2025 | Solving Tasks with Fewer Registers Than Processes. Eli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld |
| 2025 | Tight Conditions for Binary-Output Tasks Under Crashes. Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Junlang Wang |
| 2025 | Time-Optimal and Energy-Efficient Deterministic Consensus. Shachar Meir, Hugo Mirault, David Peleg, Peter Robinson |
| 2025 | Uniform Deployment of Mobile Robots in Complete Bipartite Graphs. Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama, Toshimitsu Masuzawa, Quentin Bramas, Sébastien Tixeuil |
| 2025 | Weaker Assumptions for Asymmetric Trust. Ignacio Amores-Sesar, Christian Cachin, Simon Holmgaard Kamp, Juan Villacis |
| 2025 | Where to Place Your TEE? In Search of a Censorship-Resilient Design for Rollup Sequencers. Andrei Arusoaie, Claudiu-Nicu Barbieru, Oana-Otilia Captarencu, Pascal Felber, Corentin Libert, Emanuel Onica, Etienne Rivière, Valerio Schiavoni, Peterson Yuhala |