| 2022 | 2022 Edsger W. Dijkstra Prize in Distributed Computing. Marcos Aguiliera, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, Philipp Woelfel |
| 2022 | 2022 Principles of Distributed Computing Doctoral Dissertation Award. Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld |
| 2022 | A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem. Sergio Rajsbaum, Armajac Raventós-Pujol |
| 2022 | A Framework for Distributed Quantum Queries in the CONGEST Model. Joran van Apeldoorn, Tijn de Vos |
| 2022 | A Graph Theoretic Approach for Resilient Distributed Algorithms. Merav Parter |
| 2022 | A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees. Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic |
| 2022 | A Recursive Early-Stopping Phase King Protocol. Christoph Lenzen, Sahar Sheikholeslami |
| 2022 | A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2022 | Adaptively Secure Single Secret Leader Election from DDH. Dario Catalano, Dario Fiore, Emanuele Giunta |
| 2022 | Balanced Allocations with the Choice of Noise. Dimitrios Los, Thomas Sauerwald |
| 2022 | Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang |
| 2022 | Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. Hagit Attiya, Constantin Enea, Jennifer L. Welch |
| 2022 | Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic Streams. Michael Elkin, Chhaya Trehan |
| 2022 | Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis |
| 2022 | Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup. Luciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh |
| 2022 | Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang |
| 2022 | Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. Antoine El-Hayek, Monika Henzinger, Stefan Schmid |
| 2022 | Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer. Lewis Tseng, Qinzi Zhang |
| 2022 | Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency. Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski |
| 2022 | Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets. Shreyas Pai, Sriram V. Pemmaraju |
| 2022 | Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. John Augustine, William K. Moses Jr., Gopal Pandurangan |
| 2022 | Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle. Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie |
| 2022 | Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents. Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue |
| 2022 | Brief Announcement: Holistic Verification of Blockchain Consensus. Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder |
| 2022 | Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies. João Paulo Bezerra, Petr Kuznetsov |
| 2022 | Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words. Shir Cohen, Idit Keidar, Alexander Spiegelman |
| 2022 | Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. Vignesh Manoharan, Vijaya Ramachandran |
| 2022 | Brief Announcement: On Polynomial-Time Local Decision. Eden Aldema Tshuva, Rotem Oshman |
| 2022 | Brief Announcement: Probabilistic Dynamic Input/Output Automata. Pierre Civit, Maria Potop-Butucaru |
| 2022 | Brief Announcement: The Weakest Failure Detector for Genuine Atomic Multicast. Pierre Sutra |
| 2022 | Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data Structures. Xialin Liu, Wojciech M. Golab |
| 2022 | Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon |
| 2022 | Constant-Round Near-Optimal Spanners in Congested Clique. Shiri Chechik, Tianyi Zhang |
| 2022 | Deterministic Near-Optimal Distributed Listing of Cliques. Keren Censor-Hillel, Dean Leitersdorf, David Vulakh |
| 2022 | Distributed Computations in Fully-Defective Networks. Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela |
| 2022 | Distributed Edge Coloring in Time Polylogarithmic in Δ. Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti |
| 2022 | Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication. Amos Korman, Robin Vacus |
| 2022 | Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. Ittai Abraham, Naama Ben-David, Sravya Yandamuri |
| 2022 | Encrypted Distributed Systems. Seny Kamara |
| 2022 | Fast and Fair Randomized Wait-Free Locks. Naama Ben-David, Guy E. Blelloch |
| 2022 | From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good. Rachit Agarwal, Shijin Rajakrishnan, David B. Shmoys |
| 2022 | Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. Ittai Abraham, Gilad Asharov |
| 2022 | How Should We Think about Persistent Data Structures? Michael L. Scott |
| 2022 | Internet Computer Consensus. Jan Camenisch, Manu Drijvers, Timo Hanke, Yvonne-Anne Pignolet, Victor Shoup, Dominic Williams |
| 2022 | Massively Parallel Computation in a Heterogeneous Regime. Orr Fischer, Adi Horowitz, Rotem Oshman |
| 2022 | Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. Yi-Jun Chang, Hsin-Hao Su |
| 2022 | Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. Michal Dory, Mohsen Ghaffari, Saeed Ilchi |
| 2022 | Near-Optimal Leader Election in Population Protocols on Graphs. Dan Alistarh, Joel Rybicki, Sasha Voitovych |
| 2022 | Node and Edge Averaged Complexities of Local Graph Problems. Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti |
| 2022 | Optimal Clock Synchronization with Signatures. Christoph Lenzen, Julian Loss |
| 2022 | Optimal Synchronous Approximate Agreement with Asynchronous Fallback. Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer |
| 2022 | Overcoming Congestion in Distributed Coloring. Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan |
| 2022 | PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 Alessia Milani, Philipp Woelfel |
| 2022 | Parameterized Verification under Release Acquire is PSPACE-complete. Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty |
| 2022 | Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. Ananya Appan, Anirudh Chandramouli, Ashish Choudhury |
| 2022 | Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling |
| 2022 | Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. Xudong Wu, Penghui Yao |
| 2022 | Revisiting the Power of Non-Equivocation in Distributed Protocols. Naama Ben-David, Benjamin Y. Chan, Elaine Shi |
| 2022 | State Complexity of Protocols with Leaders. Jérôme Leroux |
| 2022 | The Landscape of Distributed Complexities on Trees and Beyond. Christoph Grunau, Václav Rozhon, Sebastian Brandt |
| 2022 | The Laplacian Paradigm in the Broadcast Congested Clique. Sebastian Forster, Tijn de Vos |
| 2022 | The Space Complexity of Consensus from Swap. Sean Ovens |
| 2022 | Universally-Optimal Distributed Exact Min-Cut. Mohsen Ghaffari, Goran Zuzic |
| 2022 | What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. Laurent Feuilloley, Nicolas Bousquet, Théo Pierron |
| 2022 | When is Recoverable Consensus Harder Than Consensus? Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert |