| 2019 | 2019 Edsger W. Dijkstra Prize in Distributed Computing. Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela |
| 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 | A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. Sebastian Brandt, Yannic Maus, Jara Uitto |
| 2019 | A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners. Greg Bodwin, Shyamal Patel |
| 2019 | An Automatic Speedup Theorem for Distributed Problems. Sebastian Brandt |
| 2019 | Asymptotically Optimal Validated Asynchronous Byzantine Agreement. Ittai Abraham, Dahlia Malkhi, Alexander Spiegelman |
| 2019 | Bootstrapping Public Blockchains Without a Trusted Setup. Abhinav Aggarwal, Mahnush Movahedi, Jared Saia, Mahdi Zamani |
| 2019 | Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. Lijie Chen, Ofer Grossman |
| 2019 | Byzantine Fault Tolerant State Machine Replication in Any Programming Language. Ethan Buchman |
| 2019 | Can Distributed Uniformity Testing Be Local? Uri Meir, Dor Minzer, Rotem Oshman |
| 2019 | Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates. Klaus-Tycho Foerster |
| 2019 | Coded State Machine - Scaling State Machine Execution under Byzantine Faults. Songze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath |
| 2019 | Communication Complexity of Byzantine Agreement, Revisited. Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi |
| 2019 | Composable Computation in Discrete Chemical Reaction Networks. Eric E. Severson, David Haley, David Doty |
| 2019 | Connectivity Lower Bounds in Broadcast Congested Clique. Shreyas Pai, Sriram V. Pemmaraju |
| 2019 | Constant Amortized RMR Abortable Mutex for CC and DSM. Prasad Jayanti, Siddhartha Jayanti |
| 2019 | Deterministic Distributed Dominating Set Approximation in the CONGEST Model. Janosch Deurer, Fabian Kuhn, Yannic Maus |
| 2019 | Distributed Minimum Degree Spanning Trees. Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport |
| 2019 | Does Preprocessing Help under Congestion? Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid |
| 2019 | Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions. Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan |
| 2019 | Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols. David Doty, Mahsa Eftekhari |
| 2019 | Engineering Distributed Systems that We Can Trust (and Also Run). Ilya Sergey |
| 2019 | Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model. Muhammad Samir Khan, Syed Shalan Naqvi, Nitin H. Vaidya |
| 2019 | Fast Approximate Shortest Paths in the Congested Clique. Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf |
| 2019 | Fast Concurrent Data Sketches. Arik Rinberg, Alexander Spiegelman, Edward Bortnikov, Eshcar Hillel, Idit Keidar, Hadar Serviansky |
| 2019 | Fault Tolerant Gradient Clock Synchronization. Johannes Bund, Christoph Lenzen, Will Rosenbaum |
| 2019 | From Classical to Blockchain Consensus: What Are the Exact Algorithms? Yanhong A. Liu, Scott D. Stoller |
| 2019 | Hardness of Distributed Optimization. Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz |
| 2019 | Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot |
| 2019 | Hardness of Minimal Symmetry Breaking in Distributed Computing. Alkida Balliu, Juho Hirvonen, Dennis Olivetti, Jukka Suomela |
| 2019 | HotStuff: BFT Consensus with Linearity and Responsiveness. Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, Ittai Abraham |
| 2019 | How Fast Reads Affect Multi-Valued Register Simulations. Soma Chaudhuri, Reginald Frank, Jennifer L. Welch |
| 2019 | How to Spread a Rumor: Call Your Neighbors or Take a Walk? George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan |
| 2019 | Hyaline: Fast and Transparent Lock-Free Memory Reclamation. Ruslan Nikolaev, Binoy Ravindran |
| 2019 | Implementing Mediators with Asynchronous Cheap Talk. Ittai Abraham, Danny Dolev, Ivan Geffner, Joseph Y. Halpern |
| 2019 | Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. Michal Dory, Mohsen Ghaffari |
| 2019 | Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. Yi-Jun Chang, Thatchaphol Saranurak |
| 2019 | Layering Data Structures over Skip Graphs for Increased NUMA Locality. Samuel Thomas, Hammurabi Mendes |
| 2019 | Linearizable State Machine Replication of State-Based CRDTs without Logs. Jan Skrzypczak, Florian Schintke, Thorsten Schütt |
| 2019 | Local Computation Algorithms. Ronitt Rubinfeld |
| 2019 | Logarithmic Expected-Time Leader Election in Population Protocol Model. Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2019 | Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. Sepehr Assadi, Xiaorui Sun, Omri Weinstein |
| 2019 | Massively Parallel Computation of Matching and MIS in Sparse Graphs. Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto |
| 2019 | Message Reduction in the LOCAL Model is a Free Lunch. Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten |
| 2019 | Multiparty Interactive Communication with Private Channels. Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia |
| 2019 | Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. Michael Elkin, Shaked Matar |
| 2019 | On Counting the Population Size. Petra Berenbrink, Dominik Kaaser, Tomasz Radzik |
| 2019 | On Mixing Eventual and Strong Consistency: Bayou Revisited. Maciej Kokocinski, Tadeusz Kobus, Pawel T. Wojciechowski |
| 2019 | On Site Fidelity and the Price of Ignorance in Swarm Robotic Central Place Foraging Algorithms. Abhinav Aggarwal, G. Matthew Fricke, Diksha Gupta, Melanie E. Moses |
| 2019 | On Termination of a Flooding Process. Walter Hussak, Amitabh Trehan |
| 2019 | On the Complexity of Distributed Splitting Problems. Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto |
| 2019 | On the Parallels between Paxos and Raft, and how to Port Optimizations. Zhaoguo Wang, Changgeng Zhao, Shuai Mu, Haibo Chen, Jinyang Li |
| 2019 | On the Use of Randomness in Local Distributed Graph Algorithms. Mohsen Ghaffari, Fabian Kuhn |
| 2019 | Optimal Distributed Covering Algorithms. Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman |
| 2019 | Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel |
| 2019 | P-SLOCAL-Completeness of Maximum Independent Set Approximation. Yannic Maus |
| 2019 | Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm. Zhuolun Xiang, Nitin H. Vaidya |
| 2019 | Plain SINR is Enough! Magnús M. Halldórsson, Tigran Tonoyan |
| 2019 | Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. Peter Robinson, Faith Ellen |
| 2019 | Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. Taisuke Izumi, François Le Gall |
| 2019 | Randomized Concurrent Set Union and Generalized Wake-Up. Siddhartha V. Jayanti, Robert E. Tarjan, Enric Boix-Adserà |
| 2019 | Reconfigurable Atomic Transaction Commit. Manuel Bravo, Alexey Gotsman |
| 2019 | Secure Distributed Computing Made (Nearly) Optimal. Merav Parter, Eylon Yogev |
| 2019 | Self-Stabilizing Leader Election. Hsueh-Ping Chen, Ho-Lin Chen |
| 2019 | Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems. Chryssis Georgiou, Oskar Lundström, Elad Michael Schiller |
| 2019 | Strongly Linearizable Implementations of Snapshots and Other Types. Sean Ovens, Philipp Woelfel |
| 2019 | Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes. Jurek Czyzowicz, Leszek Gasieniec, Ryan Killick, Evangelos Kranakis |
| 2019 | The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, Yufan Zheng |
| 2019 | The Consensus Number of a Cryptocurrency. Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi |
| 2019 | The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela |
| 2019 | The Impact of RDMA on Agreement. Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Virendra J. Marathe, Igor Zablotchi |
| 2019 | The Recoverable Consensus Hierarchy. Wojciech M. Golab |
| 2019 | Topological Characterization of Consensus under General Message Adversaries. Thomas Nowak, Ulrich Schmid, Kyrill Winkler |
| 2019 | Towards a Theory of Randomized Shared Memory Algorithms. Philipp Woelfel |
| 2019 | Tutorial: Specifying, Implementing, and Verifying Algorithms for Persistent Memory. Diego Cepeda, Sakib Chowdhury, Wojciech M. Golab |
| 2019 | Vorpal: Vector Clock Ordering For Large Persistent Memory Systems. Kunal Korgaonkar, Joseph Izraelevitz, Jishen Zhao, Steven Swanson |
| 2019 | Weighted Matchings via Unweighted Augmentations. Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson |
| 2019 | With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. Avery Miller, Boaz Patt-Shamir, Will Rosenbaum |