| 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 | Fault-Tolerant Labeling and Compact Routing Schemes. | Michal Dory, Merav Parter |
| 2021 | Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. | Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf |
| 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 | Component Stability in Low-Space Massively Parallel Computation. | Artur Czumaj, Peter Davies, Merav Parter |
| 2021 | Improved Deterministic (Δ+1) Coloring in Low-Space MPC. | Artur Czumaj, Peter Davies, Merav Parter |
| 2021 | Decision Power of Weak Asynchronous Models of Distributed Computing. | Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza |
| 2021 | Lower Bounds on the State Complexity of Population Protocols. | Philipp Czerner, Javier Esparza |
| 2021 | Search via Parallel Lvy Walks on Z2. | Andrea Clementi, Francesco d'Amore, George Giakkoupis, Emanuele Natale |
| 2021 | Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized Applications. | Amit K. Chopra, Samuel H. Christie V., Munindar P. Singh |
| 2021 | Tight Trade-off in Contention Resolution without Collision Detection. | Haimin Chen, Yonggang Jiang, Chaodong Zheng |
| 2021 | Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity. | Moses Charikar, Weiyun Ma, Li-Yang Tan |
| 2021 | Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. | David Yu Cheng Chan, Philipp Woelfel |
| 2021 | Brief Announcement: Brokering with Hashed Timelock Contracts is NP-Hard. | Eric Man Chan, Mohsen Lesani |
| 2021 | Strong-Diameter Network Decomposition. | Yi-Jun Chang, Mohsen Ghaffari |
| 2021 | Brief Announcement: What's Live? Understanding Distributed Consensus. | Saksham Chand, Yanhong A. Liu |
| 2021 | 2021 Edsger W. Dijkstra Prize in Distributed Computing. | Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg |
| 2021 | Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. | Nairen Cao, Jeremy T. Fineman, Katina Russell |
| 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 | Reductions and Extension-Based Proofs. | Kayman Brusse, Faith Ellen |
| 2021 | Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. | Elette Boyle, Ran Cohen, Aarushi Goel |
| 2021 | Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. | Greg Bodwin, Merav Parter |
| 2021 | Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. | Naama Ben-David, Kartik Nayak |
| 2021 | An Efficient Adaptive Partial Snapshot Implementation. | Benyamin Bashari, Philipp Woelfel |
| 2021 | Locally Checkable Problems in Rooted Trees. | Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studen, Jukka Suomela, Aleksandr Tereshchenko |