| 2021 | Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. | Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti |
| 2021 | Byzantine Agreement and Leader Election: From Classical to the Modern. | John Augustine, Anisur Rahaman Molla, Gopal Pandurangan |
| 2021 | On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. | Karine Altisen, Stphane Devismes, Anas Durand, Colette Johnen, Franck Petit |
| 2021 | Comparison Dynamics in Population Protocols. | Dan Alistarh, Martin Tpfer, Przemyslaw Uznanski |
| 2021 | 2021 Principles of Distributed Computing Doctoral Dissertation Award. | Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi |
| 2021 | Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. | Mark Abspoel, Thomas Attema, Matthieu Rambaud |
| 2021 | Good-case Latency of Byzantine Broadcast: a Complete Categorization. | Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang |
| 2021 | Reaching Consensus for Asynchronous Distributed Key Generation. | Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu |
| 2021 | Approximate Byzantine Fault-Tolerance in Distributed Optimization. | Shuo Liu, Nirupam Gupta, Nitin H. Vaidya |
| 2021 | The Randomized Local Computation Complexity of the Lovsz Local Lemma. | Sebastian Brandt, Christoph Grunau, Vclav Rozhon |
| 2021 | Brief Announcement: Linearizability: A Typo. | Gal Sela, Maurice Herlihy, Erez Petrank |
| 2020 | K-set agreement bounds in round-based models through combinatorial topology. | Adam Shimi, Armando Castaeda |
| 2020 | Asynchronous Byzantine Approximate Consensus in Directed Networks. | Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya |
| 2020 | Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. | Will Rosenbaum, Jukka Suomela |
| 2020 | Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory Model. | Matthew Rodriguez, Michael F. Spear |
| 2020 | Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion. | Arik Rinberg, Idit Keidar |
| 2020 | Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks. | Ali Pourmiri, Bernard Mans |
| 2020 | Extending the Wait-free Hierarchy to Multi-Threaded Systems. | Matthieu Perrin, Achour Mostfaoui, Grgoire Bonin |
| 2020 | Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning. | Maciej Pacut, Mahmoud Parham, Stefan Schmid |
| 2020 | Brief Announcement: Round eliminator: a tool for automatic speedup simulation. | Dennis Olivetti |
| 2020 | An | Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat |
| 2020 | Probably Approximately Knowing. | Yoram Moses, Nitzan Zamir |
| 2020 | Distributed Computation and Reconfiguration in Actively Dynamic Networks. | Othon Michail, George Skretas, Paul G. Spirakis |
| 2020 | Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links. | Maged M. Michael |
| 2020 | Perigee: Efficient Peer-to-Peer Network Design for Blockchains. | Yifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, Kannan Srinivasan |