| 2019 | Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model. | Muhammad Samir Khan, Syed Shalan Naqvi, Nitin H. Vaidya |
| 2019 | Randomized Concurrent Set Union and Generalized Wake-Up. | Siddhartha V. Jayanti, Robert E. Tarjan, Enric Boix-Adser |
| 2019 | 2019 Principles of Distributed Computing Doctoral Dissertation Award. | Prasad Jayanti, Nancy A. Lynch, Boaz Patt-Shamir, Ulrich Schmid |
| 2019 | A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. | Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi |
| 2019 | Constant Amortized RMR Abortable Mutex for CC and DSM. | Prasad Jayanti, Siddhartha Jayanti |
| 2019 | Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. | Taisuke Izumi, Franois Le Gall |
| 2019 | On Termination of a Flooding Process. | Walter Hussak, Amitabh Trehan |
| 2019 | Plain SINR is Enough! | Magns M. Halldrsson, Tigran Tonoyan |
| 2019 | The Consensus Number of a Cryptocurrency. | Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi |
| 2019 | The Recoverable Consensus Hierarchy. | Wojciech M. Golab |
| 2019 | How to Spread a Rumor: Call Your Neighbors or Take a Walk? | George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan |
| 2019 | On the Use of Randomness in Local Distributed Graph Algorithms. | Mohsen Ghaffari, Fabian Kuhn |
| 2019 | Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems. | Chryssis Georgiou, Oskar Lundstrm, Elad Michael Schiller |
| 2019 | Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions. | Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan |
| 2019 | Weighted Matchings via Unweighted Augmentations. | Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson |
| 2019 | Does Preprocessing Help under Congestion? | Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid |
| 2019 | Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates. | Klaus-Tycho Foerster |
| 2019 | Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. | Michael Elkin, Shaked Matar |
| 2019 | Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols. | David Doty, Mahsa Eftekhari |
| 2019 | Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. | Michal Dory, Mohsen Ghaffari |
| 2019 | Distributed Minimum Degree Spanning Trees. | Michael Dinitz, Magns M. Halldrsson, Taisuke Izumi, Calvin Newport |
| 2019 | Deterministic Distributed Dominating Set Approximation in the CONGEST Model. | Janosch Deurer, Fabian Kuhn, Yannic Maus |
| 2019 | Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes. | Jurek Czyzowicz, Leszek Gasieniec, Ryan Killick, Evangelos Kranakis |
| 2019 | Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. | Lijie Chen, Ofer Grossman |
| 2019 | Self-Stabilizing Leader Election. | Hsueh-Ping Chen, Ho-Lin Chen |