| 2025 | Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. | Michael Anoprenko, Petr Kuznetsov, Vitaly Aksenov |
| 2025 | DAG-based Consensus with Asymmetric Trust. | Ignacio Amores-Sesar, Christian Cachin, Juan Villacis, Luca Zanolini |
| 2025 | Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols. | Kaya Alpturer, Gerald Huang, Ron van der Meyden |
| 2025 | Keynote: Disaggregated Memory and the Revival of Memory Research. | Marcos K. Aguilera |
| 2025 | Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. | Ittai Abraham, Eli Chouatt, Yossi Gilad, Gilad Stern, Sophia Yakoubov |
| 2025 | Distributed Maximum Flow in Planar Graphs. | Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann |
| 2025 | You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processes. | Xing Hu, Sam Toueg |
| 2025 | Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up. | Peter Robinson, Ming Ming Tan |
| 2025 | Towards Optimal Deterministic LOCAL Algorithms on Trees. | Sebastian Brandt, Ananth Narayanan |
| 2025 | Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing. | Daniel Escudero, Elisaweta Masserova, Antigoni Polychroniadou |
| 2025 | Density-Dependent Graph Orientation and Coloring in Scalable MPC. | Mohsen Ghaffari, Christoph Grunau |
| 2025 | Byzantine Stable Matching. | Andrei Constantinescu, Marc Dufay, Diana Ghinea, Roger Wattenhofer |
| 2024 | TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus. | Qianyu Yu, Giuliano Losa, Xuechao Wang |
| 2024 | Swiper: a new paradigm for efficient weighted distributed protocols. | Andrei Tonkikh, Luciano Freitas de Souza |
| 2024 | Keynote: Time is not a Healer: Before and After. | Nicola Santoro |
| 2024 | Keynote: Provable Slashing Guarantees. | Tim Roughgarden |
| 2024 | A LOCAL View of the Polynomial Hierarchy. | Fabian Reiter |
| 2024 | Brief Announcement: Fair Ordering via Streaming Social Choice Theory. | Geoffrey Ramseyer, Ashish Goel |
| 2024 | Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. | Andreas Padalkin, Christian Scheideler |
| 2024 | Determining Recoverable Consensus Numbers. | Sean Ovens |
| 2024 | Strongly Linearizable LL/SC from CAS. | Fatemeh Naderi-Semiromi, Philipp Woelfel |
| 2024 | Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail! | Achour Mostfaoui, Matthieu Perrin, Julien Weibel |
| 2024 | Computing Minimum Weight Cycle in the CONGEST Model. | Vignesh Manoharan, Vijaya Ramachandran |
| 2024 | Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks. | Austin Luchsinger, David Doty, David Soloveichik |
| 2024 | Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. | Giuliano Losa, Eli Gafni |