| 2021 | The Space Complexity of Scannable Binary Objects. | Sean Ovens |
| 2021 | Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects. | Nan Li, Wojciech M. Golab |
| 2021 | Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes. | Jrmy Ledent |
| 2021 | Revisiting Optimal Resilience of Fast Byzantine Consensus. | Petr Kuznetsov, Andrei Tonkikh, Yan X. Zhang |
| 2021 | Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. | Manish Kumar, Anisur Rahaman Molla |
| 2021 | Low-Congestion Shortcuts in Constant Diameter Graphs. | Shimon Kogan, Merav Parter |
| 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 | Elle: Finding Isolation Violations in Real-World Databases. | Kyle Kingsbury |
| 2021 | Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. | Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha |
| 2021 | All You Need is DAG. | Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, Alexander Spiegelman |
| 2021 | Diversity, Fairness, and Sustainability in Population Protocols. | Nan Kang, Frederik Mallmann-Trenn, Nicols Rivera |
| 2021 | On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. | David G. Harris, Hsin-Hao Su, Hoa T. Vu |
| 2021 | On Register Linearizability and Termination. | Vassos Hadzilacos, Xing Hu, Sam Toueg |
| 2021 | Differential Privacy and Byzantine Resilience in SGD: Do They Add Up? | Rachid Guerraoui, Nirupam Gupta, Rafal Pinot, Sbastien Rouault, John Stephan |
| 2021 | Time-Optimal Construction of Overlay Networks. | Thorsten Gtte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann |
| 2021 | Stochastic Coordination in Heterogeneous Load Balancing Systems. | Guy Goren, Shay Vargaftik, Yoram Moses |
| 2021 | Contention Resolution with Predictions. | Seth Gilbert, Calvin Newport, Nitin H. Vaidya, Alex Weaver |
| 2021 | Low-Congestion Shortcuts for Graphs Excluding Dense Minors. | Mohsen Ghaffari, Bernhard Haeupler |
| 2021 | Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. | Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang |
| 2021 | The Topology of Randomized Symmetry-Breaking Distributed Computing. | Pierre Fraigniaud, Ran Gelles, Zvi Lotker |
| 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 | Ultra-Sparse Near-Additive Emulators. | Michael Elkin, Shaked Matar |
| 2021 | Differential Privacy in Distributed Environments: An Overview and Open Questions. | Cynthia Dwork |
| 2021 | Efficient Deterministic Leader Election for Programmable Matter. | Fabien Dufoulon, Shay Kutten, William K. Moses Jr. |