| 2022 | Overcoming Congestion in Distributed Coloring. | Magns M. Halldrsson, Alexandre Nolin, Tigran Tonoyan |
| 2022 | Exploring the use of Strongly Consistent Distributed Shared Memory in 3D NVEs. | Theophanis Hadjistasi, Nicolas Nicolaou, Efstathios Stavrakis |
| 2022 | DARTS: Distributed IoT Architecture for Real-Time, Resilient and AI-Compressed Workflows. | Ragini Gupta, Bo Chen, Shengzhong Liu, Tianshi Wang, Sandeep Singh Sandha, Abel Souza, Klara Nahrstedt, Tarek F. Abdelzaher, Mani B. Srivastava, Prashant J. Shenoy, Jeffrey Smith, Maggie B. Wigness, Niranjan Suri |
| 2022 | The Landscape of Distributed Complexities on Trees and Beyond. | Christoph Grunau, Vclav Rozhon, Sebastian Brandt |
| 2022 | Optimal Synchronous Approximate Agreement with Asynchronous Fallback. | Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer |
| 2022 | A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. | Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2022 | Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle. | Pierre Fraigniaud, Patrick Lambein-Monette, Mikal Rabie |
| 2022 | The Laplacian Paradigm in the Broadcast Congested Clique. | Sebastian Forster, Tijn de Vos |
| 2022 | Massively Parallel Computation in a Heterogeneous Regime. | Orr Fischer, Adi Horowitz, Rotem Oshman |
| 2022 | What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. | Laurent Feuilloley, Nicolas Bousquet, Tho Pierron |
| 2022 | Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic Streams. | Michael Elkin, Chhaya Trehan |
| 2022 | Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. | Antoine El-Hayek, Monika Henzinger, Stefan Schmid |
| 2022 | Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. | Michal Dory, Mohsen Ghaffari, Saeed Ilchi |
| 2022 | When is Recoverable Consensus Harder Than Consensus? | Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert |
| 2022 | Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words. | Shir Cohen, Idit Keidar, Alexander Spiegelman |
| 2022 | A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees. | Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic |
| 2022 | Brief Announcement: Probabilistic Dynamic Input/Output Automata. | Pierre Civit, Maria Potop-Butucaru |
| 2022 | Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency. | Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski |
| 2022 | Constant-Round Near-Optimal Spanners in Congested Clique. | Shiri Chechik, Tianyi Zhang |
| 2022 | Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. | Yi-Jun Chang, Hsin-Hao Su |
| 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 | Adaptively Secure Single Secret Leader Election from DDH. | Dario Catalano, Dario Fiore, Emanuele Giunta |
| 2022 | Internet Computer Consensus. | Jan Camenisch, Manu Drijvers, Timo Hanke, Yvonne-Anne Pignolet, Victor Shoup, Dominic Williams |
| 2022 | Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies. | Joo Paulo Bezerra, Petr Kuznetsov |