| 2020 | Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. | Shir Cohen, Idit Keidar, Alexander Spiegelman |
| 2020 | Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time. | Ashish Choudhury |
| 2020 | Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks. | Haimin Chen, Chaodong Zheng |
| 2020 | Self-Stabilizing Leader Election in Regular Graphs. | Hsueh-Ping Chen, Ho-Lin Chen |
| 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 | Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. | David Yu Cheng Chan, Philipp Woelfel |
| 2020 | The Energy Complexity of BFS in Radio Networks. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie |
| 2020 | On Distributed Listing of Cliques. | Keren Censor-Hillel, Franois Le Gall, Dean Leitersdorf |
| 2020 | Want to Gather? No Need to Chatter! | Sbastien Bouchard, Yoann Dieudonn, Andrzej Pelc |
| 2020 | Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. | Petra Berenbrink, George Giakkoupis, Peter Kling |
| 2020 | Upper and Lower Bounds on the Space Complexity of Detectable Objects. | Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky |
| 2020 | Distributed Approximation on Power Graphs. | Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju |
| 2020 | Positive Aging Admits Fast Asynchronous Plurality Consensus. | Gregor Bankhamer, Robert Elssser, Dominik Kaaser, Matjaz Krnc |
| 2020 | Efficient Deterministic Distributed Coloring with Small Bandwidth. | Philipp Bamberger, Fabian Kuhn, Yannic Maus |
| 2020 | Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. | Alkida Balliu, Fabian Kuhn, Dennis Olivetti |
| 2020 | How much does randomness help with locally checkable problems? | Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela |
| 2020 | Brief Announcement: Classification of Distributed Binary Labeling Problems. | Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela |
| 2020 | Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. | Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers |
| 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 | Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. | Sepehr Assadi, Gillat Kol, Rotem Oshman |
| 2020 | Brief Announcement: Noisy Beeping Networks. | Yagel Ashkenazi, Ran Gelles, Amir Leshem |
| 2020 | Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. | Karine Altisen, Stphane Devismes, Anas Durand, Colette Johnen, Franck Petit |
| 2020 | Brief Announcement: Why Extension-Based Proofs Fail. | Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu |
| 2020 | Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. | Ittai Abraham, Danny Dolev, Gilad Stern |