| 2021 | 2021 Edsger W. Dijkstra Prize in Distributed Computing. Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg |
| 2021 | 2021 Principles of Distributed Computing Doctoral Dissertation Award. Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi |
| 2021 | A New Way to Achieve Round-Efficient Byzantine Agreement. Matthias Fitzi, Chen-Da Liu-Zhang, Julian Loss |
| 2021 | A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks. Yuval Emek, Eyal Keren |
| 2021 | All You Need is DAG. Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, Alexander Spiegelman |
| 2021 | An Efficient Adaptive Partial Snapshot Implementation. Benyamin Bashari, Philipp Woelfel |
| 2021 | Approximate Byzantine Fault-Tolerance in Distributed Optimization. Shuo Liu, Nirupam Gupta, Nitin H. Vaidya |
| 2021 | Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. Elette Boyle, Ran Cohen, Aarushi Goel |
| 2021 | Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity. Moses Charikar, Weiyun Ma, Li-Yang Tan |
| 2021 | Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority. David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Grzegorz Stachowiak, Przemyslaw Uznanski |
| 2021 | Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. Nairen Cao, Jeremy T. Fineman, Katina Russell |
| 2021 | Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang |
| 2021 | Brief Announcement: Brokering with Hashed Timelock Contracts is NP-Hard. Eric Chan, Mohsen Lesani |
| 2021 | Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. Naama Ben-David, Kartik Nayak |
| 2021 | Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects. Nan Li, Wojciech M. Golab |
| 2021 | Brief Announcement: Linearizability: A Typo. Gal Sela, Maurice Herlihy, Erez Petrank |
| 2021 | Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha |
| 2021 | Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. Mark Abspoel, Thomas Attema, Matthieu Rambaud |
| 2021 | Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. Manish Kumar, Anisur Rahaman Molla |
| 2021 | Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes. Jérémy Ledent |
| 2021 | Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie |
| 2021 | Brief Announcement: What's Live? Understanding Distributed Consensus. Saksham Chand, Yanhong A. Liu |
| 2021 | Byzantine Agreement and Leader Election: From Classical to the Modern. John Augustine, Anisur Rahaman Molla, Gopal Pandurangan |
| 2021 | Can We Break Symmetry with o(m) Communication? Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson |
| 2021 | Comparison Dynamics in Population Protocols. Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski |
| 2021 | Component Stability in Low-Space Massively Parallel Computation. Artur Czumaj, Peter Davies, Merav Parter |
| 2021 | Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf |
| 2021 | Contention Resolution with Predictions. Seth Gilbert, Calvin Newport, Nitin H. Vaidya, Alex Weaver |
| 2021 | Decision Power of Weak Asynchronous Models of Distributed Computing. Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza |
| 2021 | Differential Privacy and Byzantine Resilience in SGD: Do They Add Up? Rachid Guerraoui, Nirupam Gupta, Rafaël Pinot, Sébastien Rouault, John Stephan |
| 2021 | Differential Privacy in Distributed Environments: An Overview and Open Questions. Cynthia Dwork |
| 2021 | Diversity, Fairness, and Sustainability in Population Protocols. Nan Kang, Frederik Mallmann-Trenn, Nicolás Rivera |
| 2021 | Efficient Deterministic Leader Election for Programmable Matter. Fabien Dufoulon, Shay Kutten, William K. Moses Jr. |
| 2021 | Elle: Finding Isolation Violations in Real-World Databases. Kyle Kingsbury |
| 2021 | Embedding a Deterministic BFT Protocol in a Block DAG. Maria Anna Schett, George Danezis |
| 2021 | Fault-Tolerant Labeling and Compact Routing Schemes. Michal Dory, Merav Parter |
| 2021 | Good-case Latency of Byzantine Broadcast: a Complete Categorization. Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang |
| 2021 | Hedging Against Sore Loser Attacks in Cross-Chain Transactions. Yingjie Xue, Maurice Herlihy |
| 2021 | Improved Deterministic (Δ+1) Coloring in Low-Space MPC. Artur Czumaj, Peter Davies, Merav Parter |
| 2021 | Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti |
| 2021 | Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized Applications. Amit K. Chopra, Samuel H. Christie V., Munindar P. Singh |
| 2021 | Locally Checkable Problems in Rooted Trees. Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko |
| 2021 | Low-Congestion Shortcuts for Graphs Excluding Dense Minors. Mohsen Ghaffari, Bernhard Haeupler |
| 2021 | Low-Congestion Shortcuts in Constant Diameter Graphs. Shimon Kogan, Merav Parter |
| 2021 | Lower Bounds on the State Complexity of Population Protocols. Philipp Czerner, Javier Esparza |
| 2021 | On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit |
| 2021 | On Register Linearizability and Termination. Vassos Hadzilacos, Xing Hu, Sam Toueg |
| 2021 | On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. David G. Harris, Hsin-Hao Su, Hoa T. Vu |
| 2021 | PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021 Avery Miller, Keren Censor-Hillel, Janne H. Korhonen |
| 2021 | Reaching Consensus for Asynchronous Distributed Key Generation. Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu |
| 2021 | Reductions and Extension-Based Proofs. Kayman Brusse, Faith Ellen |
| 2021 | Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. Greg Bodwin, Merav Parter |
| 2021 | Revisiting Optimal Resilience of Fast Byzantine Consensus. Petr Kuznetsov, Andrei Tonkikh, Yan X. Zhang |
| 2021 | Search via Parallel Lévy Walks on Z2. Andrea Clementi, Francesco d'Amore, George Giakkoupis, Emanuele Natale |
| 2021 | Security and Privacy for Distributed Optimization & Distributed Machine Learning. Nitin H. Vaidya |
| 2021 | Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro |
| 2021 | Stochastic Coordination in Heterogeneous Load Balancing Systems. Guy Goren, Shay Vargaftik, Yoram Moses |
| 2021 | Strong-Diameter Network Decomposition. Yi-Jun Chang, Mohsen Ghaffari |
| 2021 | The Randomized Local Computation Complexity of the Lovász Local Lemma. Sebastian Brandt, Christoph Grunau, Václav Rozhon |
| 2021 | The Space Complexity of Scannable Binary Objects. Sean Ovens |
| 2021 | The Topology of Randomized Symmetry-Breaking Distributed Computing. Pierre Fraigniaud, Ran Gelles, Zvi Lotker |
| 2021 | Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. David Yu Cheng Chan, Philipp Woelfel |
| 2021 | Tight Trade-off in Contention Resolution without Collision Detection. Haimin Chen, Yonggang Jiang, Chaodong Zheng |
| 2021 | Time-Optimal Construction of Overlay Networks. Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann |
| 2021 | Time-Optimal Self-Stabilizing Leader Election in Population Protocols. Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty, Thomas Nowak, Eric E. Severson, Chuan Xu |
| 2021 | Ultra-Sparse Near-Additive Emulators. Michael Elkin, Shaked Matar |