| 2020 | On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems. | Mads Frederik Madsen, Sren Debois |
| 2020 | Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited. | Yuan Lu, Zhenliang Lu, Qiang Tang, Guiling Wang |
| 2020 | Computing Shortest Paths and Diameter in the Hybrid Network Model. | Fabian Kuhn, Philipp Schneider |
| 2020 | Brief Announcement: Byzantine Agreement with Unknown Participants and Failures. | Pankaj Khanchandani, Roger Wattenhofer |
| 2020 | Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. | Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman |
| 2020 | Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers. | Kaile Huang, Yu Huang, Hengfeng Wei |
| 2020 | Distance-2 Coloring in the CONGEST Model. | Magns M. Halldrsson, Fabian Kuhn, Yannic Maus |
| 2020 | Fault-Tolerance in Distributed Optimization: The Case of Redundancy. | Nirupam Gupta, Nitin H. Vaidya |
| 2020 | Multiple Source Replacement Path Problem. | Manoj Gupta, Rahul Jain, Nitiksha Modi |
| 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 | From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. | Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld |
| 2020 | DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. | Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan |
| 2020 | Massively Parallel Algorithms for Minimum Cut. | Mohsen Ghaffari, Krzysztof Nowicki |
| 2020 | Compact Distributed Certification of Planar Graphs. | Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, ric Rmila, Ioan Todinca |
| 2020 | Distributed Construction of Light Networks. | Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2020 | Genuinely Distributed Byzantine Machine Learning. | El-Mahdi El-Mhamdi, Rachid Guerraoui, Arsany Guirguis, L Nguyn Hoang, Sbastien Rouault |
| 2020 | Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. | Yuval Efron, Ofer Grossman, Seri Khoury |
| 2020 | Noisy Beeps. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena |
| 2020 | Can Uncoordinated Beeps tell Stories? | Fabien Dufoulon, Janna Burman, Joffroy Beauquier |
| 2020 | Exponentially Faster Shortest Paths in the Congested Clique. | Michal Dory, Merav Parter |
| 2020 | Brief Announcement: The Only Undoable CRDTs are Counters. | Stephen Dolan |
| 2020 | Efficient and Simple Algorithms for Fault-Tolerant Spanners. | Michael Dinitz, Caleb Robelle |
| 2020 | An Adaptive Approach to Recoverable Mutual Exclusion. | Sahil Dhoked, Neeraj Mittal |
| 2020 | Simple, Deterministic, Constant-Round Coloring in the Congested Clique. | Artur Czumaj, Peter Davies, Merav Parter |