| 2020 | An Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat |
| 2020 | An Adaptive Approach to Recoverable Mutual Exclusion. Sahil Dhoked, Neeraj Mittal |
| 2020 | Asynchronous Byzantine Approximate Consensus in Directed Networks. Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya |
| 2020 | Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. Yuval Efron, Ofer Grossman, Seri Khoury |
| 2020 | Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time. Ashish Choudhury |
| 2020 | Brief Announcement: Byzantine Agreement with Unknown Participants and Failures. Pankaj Khanchandani, Roger Wattenhofer |
| 2020 | Brief Announcement: Classification of Distributed Binary Labeling Problems. Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela |
| 2020 | Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch |
| 2020 | Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning. Maciej Pacut, Mahmoud Parham, Stefan Schmid |
| 2020 | Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links. Maged M. Michael |
| 2020 | Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman |
| 2020 | Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion. Arik Rinberg, Idit Keidar |
| 2020 | Brief Announcement: Noisy Beeping Networks. Yagel Ashkenazi, Ran Gelles, Amir Leshem |
| 2020 | Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. Shir Cohen, Idit Keidar, Alexander Spiegelman |
| 2020 | Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory Model. Matthew Rodriguez, Michael F. Spear |
| 2020 | Brief Announcement: On Using Null Messages in a Byzantine Setting. Guy Goren, Yoram Moses |
| 2020 | Brief Announcement: On the Significance of Consecutive Ballots in Paxos. Eli Goldweber, Nuda Zhang, Manos Kapritsos |
| 2020 | Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. Petra Berenbrink, George Giakkoupis, Peter Kling |
| 2020 | Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks. Haimin Chen, Chaodong Zheng |
| 2020 | Brief Announcement: Round eliminator: a tool for automatic speedup simulation. Dennis Olivetti |
| 2020 | Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit |
| 2020 | Brief Announcement: The Only Undoable CRDTs are Counters. Stephen Dolan |
| 2020 | Brief Announcement: Why Extension-Based Proofs Fail. Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu |
| 2020 | Can Uncoordinated Beeps tell Stories? Fabien Dufoulon, Janna Burman, Joffroy Beauquier |
| 2020 | Compact Distributed Certification of Planar Graphs. Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca |
| 2020 | Computing Shortest Paths and Diameter in the Hybrid Network Model. Fabian Kuhn, Philipp Schneider |
| 2020 | DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan |
| 2020 | Distance-2 Coloring in the CONGEST Model. Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus |
| 2020 | Distributed Approximation on Power Graphs. Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju |
| 2020 | Distributed Computation and Reconfiguration in Actively Dynamic Networks. Othon Michail, George Skretas, Paul G. Spirakis |
| 2020 | Distributed Construction of Light Networks. Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2020 | Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. Alkida Balliu, Fabian Kuhn, Dennis Olivetti |
| 2020 | Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited. Yuan Lu, Zhenliang Lu, Qiang Tang, Guiling Wang |
| 2020 | Efficient Deterministic Distributed Coloring with Small Bandwidth. Philipp Bamberger, Fabian Kuhn, Yannic Maus |
| 2020 | Efficient and Simple Algorithms for Fault-Tolerant Spanners. Michael Dinitz, Caleb Robelle |
| 2020 | Exponentially Faster Shortest Paths in the Congested Clique. Michal Dory, Merav Parter |
| 2020 | Extending the Wait-free Hierarchy to Multi-Threaded Systems. Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin |
| 2020 | Fault-Tolerance in Distributed Optimization: The Case of Redundancy. Nirupam Gupta, Nitin H. Vaidya |
| 2020 | Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers. Kaile Huang, Yu Huang, Hengfeng Wei |
| 2020 | From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2020 | Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. Sebastian Brandt, Christoph Grunau, Václav Rozhon |
| 2020 | Genuinely Distributed Byzantine Machine Learning. El-Mahdi El-Mhamdi, Rachid Guerraoui, Arsany Guirguis, Lê Nguyên Hoang, Sébastien Rouault |
| 2020 | How much does randomness help with locally checkable problems? Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela |
| 2020 | K-set agreement bounds in round-based models through combinatorial topology. Adam Shimi, Armando Castañeda |
| 2020 | Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers |
| 2020 | Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. Sepehr Assadi, Gillat Kol, Rotem Oshman |
| 2020 | Massively Parallel Algorithms for Minimum Cut. Mohsen Ghaffari, Krzysztof Nowicki |
| 2020 | Multiple Source Replacement Path Problem. Manoj Gupta, Rahul Jain, Nitiksha Modi |
| 2020 | Noisy Beeps. Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena |
| 2020 | On Distributed Listing of Cliques. Keren Censor-Hillel, François Le Gall, Dean Leitersdorf |
| 2020 | On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems. Mads Frederik Madsen, Søren Debois |
| 2020 | PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020 Yuval Emek, Christian Cachin |
| 2020 | Perigee: Efficient Peer-to-Peer Network Design for Blockchains. Yifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, Kannan Srinivasan |
| 2020 | Positive Aging Admits Fast Asynchronous Plurality Consensus. Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc |
| 2020 | Probably Approximately Knowing. Yoram Moses, Nitzan Zamir |
| 2020 | Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. David Yu Cheng Chan, Philipp Woelfel |
| 2020 | Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. Ittai Abraham, Danny Dolev, Gilad Stern |
| 2020 | Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. Will Rosenbaum, Jukka Suomela |
| 2020 | Self-Stabilizing Leader Election in Regular Graphs. Hsueh-Ping Chen, Ho-Lin Chen |
| 2020 | Simple, Deterministic, Constant-Round Coloring in the Congested Clique. Artur Czumaj, Peter Davies, Merav Parter |
| 2020 | Single-Source Shortest Paths in the CONGEST Model with Improved Bound. Shiri Chechik, Doron Mukhtar |
| 2020 | Sleeping is Efficient: MIS in Soumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan |
| 2020 | The Energy Complexity of BFS in Radio Networks. Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie |
| 2020 | Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks. Ali Pourmiri, Bernard Mans |
| 2020 | Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. Sebastian Brandt, Dennis Olivetti |
| 2020 | Upper and Lower Bounds on the Space Complexity of Detectable Objects. Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky |
| 2020 | Want to Gather? No Need to Chatter! Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc |