| 2024 | (Δ+1) Vertex Coloring in Maxime Flin, Parth Mittal |
| 2024 | A LOCAL View of the Polynomial Hierarchy. Fabian Reiter |
| 2024 | A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP. Mohsen Ghaffari, Anton Trygub |
| 2024 | A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Mingyang Yang, Yu-Cheng Yeh |
| 2024 | Adaptive Massively Parallel Coloring in Sparse Graphs. Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto |
| 2024 | All Byzantine Agreement Problems Are Expensive. Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Anton Paramonov, Manuel Vidigueira |
| 2024 | Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas |
| 2024 | Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols. Francesco D'Amato, Giuliano Losa, Luca Zanolini |
| 2024 | Brief Announcement: A Case for Byzantine Machine Learning. Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta, Rafael Pinot |
| 2024 | Brief Announcement: Communication-Optimal Convex Agreement. Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer |
| 2024 | Brief Announcement: Content-Oblivious Leader Election on Rings. Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin |
| 2024 | Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2024 | Brief Announcement: Fair Ordering via Streaming Social Choice Theory. Geoffrey Ramseyer, Ashish Goel |
| 2024 | Brief Announcement: Global certification via perfect hashing. Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun |
| 2024 | Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. Quanquan C. Liu, C. Seshadhri |
| 2024 | Brief Announcement: Know Your Audience: Communication model and computability in anonymous networks. Bernadette Charron-Bost, Patrick Lambein-Monette |
| 2024 | Brief Announcement: Local Advice and Local Decompression. Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela |
| 2024 | Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. Yi-Jun Chang, Varsha Dani, Thomas P. Hayes |
| 2024 | Brief Announcement: Massively Parallel Ruling Set Made Deterministic. Jeff Giliberti, Zahra Parsaeian |
| 2024 | Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel Networks. Zeta Avarikioti, Stefan Schmid, Samarth Tiwari |
| 2024 | Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems. Sylvain Gay, Achour Mostéfaoui, Matthieu Perrin |
| 2024 | Brief Announcement: On the Limits of Information Spread by Memory-less Agents. Niccolò D'Archivio, Robin Vacus |
| 2024 | Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks. Austin Luchsinger, David Doty, David Soloveichik |
| 2024 | Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail! Achour Mostéfaoui, Matthieu Perrin, Julien Weibel |
| 2024 | Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model. George Giakkoupis, Volker Turau, Isabella Ziccardi |
| 2024 | Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms. Marc Fuchs, Fabian Kuhn |
| 2024 | Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. Giuliano Losa, Eli Gafni |
| 2024 | Completing the Node-Averaged Complexity Landscape of LCLs on Trees. Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid |
| 2024 | Computing Minimum Weight Cycle in the CONGEST Model. Vignesh Manoharan, Vijaya Ramachandran |
| 2024 | DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication. Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira |
| 2024 | Determining Recoverable Consensus Numbers. Sean Ovens |
| 2024 | Deterministic Expander Routing: Faster and More Versatile. Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su |
| 2024 | Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive Consistency. Hanwen Feng, Zhenliang Lu, Qiang Tang |
| 2024 | Dynamic Size Counting in the Population Protocol Model. Dominik Kaaser, Maximilian Lohmann |
| 2024 | Even-Cycle Detection in the Randomized and Quantum CONGEST Model. Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca |
| 2024 | Faster Randomized Repeated Choice and DCAS. Dante Bencivenga, George Giakkoupis, Philipp Woelfel |
| 2024 | Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. Krishnendu Chatterjee, Amirali Ebrahim-Zadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic |
| 2024 | Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young |
| 2024 | Game Dynamics and Equilibrium Computation in the Population Protocol Model. Dan Alistarh, Krishnendu Chatterjee, Mehrdad Karrabi, John Lazarsfeld |
| 2024 | History-Independent Concurrent Objects. Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller |
| 2024 | Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows. Miguel Alves Ferreira, Nirav Atre, Justine Sherry, João Luis Sobrinho |
| 2024 | Improved All-Pairs Approximate Shortest Paths in Congested Clique. Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf |
| 2024 | Keynote: Provable Slashing Guarantees. Tim Roughgarden |
| 2024 | Keynote: Time is not a Healer: Before and After. Nicola Santoro |
| 2024 | Lumiere: Making Optimal BFT for Partial Synchrony Practical. Andrew Lewis-Pye, Dahlia Malkhi, Oded Naor, Kartik Nayak |
| 2024 | Majority Consensus Thresholds in Competitive Lotka-Volterra Populations. Matthias Függer, Thomas Nowak, Joel Rybicki |
| 2024 | MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory. Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti |
| 2024 | Multi-Party Set Disjointness and Intersection with Bounded Dependence. Mark Braverman, Rotem Oshman, Tal Roth |
| 2024 | Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed? Mohammad Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski |
| 2024 | On Self-stabilizing Leader Election in Directed Networks. Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes |
| 2024 | On the Communication Complexity of Secure Multi-Party Computation With Aborts. James Bartusek, Thiago Bergamaschi, Seri Khoury, Saachi Mutreja, Orr Paradise |
| 2024 | On the Power of Quantum Distributed Proofs. Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura |
| 2024 | Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. Andreas Padalkin, Christian Scheideler |
| 2024 | Probabilistic Byzantine Fault Tolerance. Diogo Avelas, Hasan Heydari, Eduardo Alchieri, Tobias Distler, Alysson Bessani |
| 2024 | Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, June 17-21, 2024 Ran Gelles, Dennis Olivetti, Petr Kuznetsov |
| 2024 | Streaming Graph Algorithms in the Massively Parallel Computation Model. Artur Czumaj, Gopinath Mishra, Anish Mukherjee |
| 2024 | Strong Linearizability using Primitives with Consensus Number 2. Hagit Attiya, Armando Castañeda, Constantin Enea |
| 2024 | Strongly Linearizable LL/SC from CAS. Fatemeh Naderi-Semiromi, Philipp Woelfel |
| 2024 | Swiper: a new paradigm for efficient weighted distributed protocols. Andrei Tonkikh, Luciano Freitas de Souza |
| 2024 | System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models. Sam Ade Jacobs, Masahiro Tanaka, Chengming Zhang, Minjia Zhang, Reza Yazdani Aminadabi, Shuaiwen Leon Song, Samyam Rajbhandari, Yuxiong He |
| 2024 | TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus. Qianyu Yu, Giuliano Losa, Xuechao Wang |
| 2024 | The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
| 2024 | The Fractional Spending Problem: Executing Payment transactions in parallel with less than Rida A. Bazzi, Sara Tucci Piergiovanni |
| 2024 | Tight Lower Bounds in the Supported LOCAL Model. Alkida Balliu, Thomas Boudier, Sebastian Brandt, Dennis Olivetti |
| 2024 | Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider |