Abstract is missing.
- 2022 Edsger W. Dijkstra Prize in Distributed ComputingMarcos Aguiliera, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, Philipp Woelfel. 1 [doi]
- 2022 Principles of Distributed Computing Doctoral Dissertation AwardYehuda Afek, Keren Censor Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld. 2 [doi]
- How Should We Think about Persistent Data Structures?Michael L. Scott. 3 [doi]
- Node and Edge Averaged Complexities of Local Graph ProblemsAlkida Balliu, Mohsen Ghaffari 0001, Fabian Kuhn, Dennis Olivetti. 4-14 [doi]
- Distributed Edge Coloring in Time Polylogarithmic in ΔAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti. 15-25 [doi]
- Overcoming Congestion in Distributed ColoringMagnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan. 26-36 [doi]
- The Landscape of Distributed Complexities on Trees and BeyondChristoph Grunau, Václav Rozhon, Sebastian Brandt 0002. 37-47 [doi]
- Brief Announcement: On Polynomial-Time Local DecisionEden Aldema Tshuva, Rotem Oshman. 48-50 [doi]
- Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower BoundsJohn Augustine, William K. Moses Jr., Gopal Pandurangan. 51-53 [doi]
- Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is LinearAntoine El-Hayek, Monika Henzinger, Stefan Schmid 0001. 54-56 [doi]
- Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic StreamsMichael Elkin, Chhaya Trehan. 57-59 [doi]
- A Recursive Early-Stopping Phase King ProtocolChristoph Lenzen 0001, Sahar Sheikholeslami. 60-69 [doi]
- Optimal Synchronous Approximate Agreement with Asynchronous FallbackDiana Ghinea, Chen-Da Liu Zhang, Roger Wattenhofer. 70-80 [doi]
- Internet Computer ConsensusJan Camenisch, Manu Drijvers, Timo Hanke, Yvonne Anne Pignolet, Victor Shoup, Dominic Williams 0003. 81-91 [doi]
- Perfectly-Secure Synchronous MPC with Asynchronous Fallback GuaranteesAnanya Appan, Anirudh Chandramouli, Ashish Choudhury. 92-102 [doi]
- Brief Announcement: Asynchronous Randomness and Consensus without Trusted SetupLuciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh. 103-105 [doi]
- Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication EfficiencyBogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski. 106-108 [doi]
- A Framework for Distributed Quantum Queries in the CONGEST ModelJoran van Apeldoorn, Tijn de Vos. 109-119 [doi]
- Quantum Complexity of Weighted Diameter and Radius in CONGEST NetworksXudong Wu, Penghui Yao. 120-130 [doi]
- What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphsLaurent Feuilloley, Nicolas Bousquet, Théo Pierron. 131-140 [doi]
- Distributed Computations in Fully-Defective NetworksKeren Censor Hillel, Shir Cohen, Ran Gelles, Gal Sela 0001. 141-150 [doi]
- Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter SpannersOmri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon. 151-162 [doi]
- Encrypted Distributed SystemsSeny Kamara. 163 [doi]
- Balanced Allocations with the Choice of NoiseDimitrios Los, Thomas Sauerwald. 164-175 [doi]
- The Space Complexity of Consensus from SwapSean Ovens. 176-186 [doi]
- Fast and Fair Randomized Wait-Free LocksNaama Ben-David, Guy E. Blelloch. 187-197 [doi]
- When is Recoverable Consensus Harder Than Consensus?Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert. 198-208 [doi]
- Blunting an Adversary Against Randomized Concurrent Programs with Linearizable ImplementationsHagit Attiya, Constantin Enea, Jennifer L. Welch. 209-219 [doi]
- Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data StructuresXialin Liu, Wojciech Golab. 220-223 [doi]
- Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinionsGregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling. 224-234 [doi]
- Early Adapting to Trends: Self-Stabilizing Information Spread using Passive CommunicationAmos Korman, Robin Vacus. 235-245 [doi]
- Near-Optimal Leader Election in Population Protocols on GraphsDan Alistarh, Joel Rybicki, Sasha Voitovych. 246-256 [doi]
- State Complexity of Protocols with LeadersJérôme Leroux. 257-264 [doi]
- Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC LayerLewis Tseng, Qinzi Zhang. 265-267 [doi]
- Brief Announcement: The Weakest Failure Detector for Genuine Atomic MulticastPierre Sutra. 268-270 [doi]
- Deterministic Near-Optimal Distributed Listing of CliquesKeren Censor Hillel, Dean Leitersdorf, David Vulakh. 271-280 [doi]
- Universally-Optimal Distributed Exact Min-CutMohsen Ghaffari 0001, Goran Zuzic. 281-291 [doi]
- Near-Optimal Distributed Dominating Set in Bounded Arboricity GraphsMichal Dory, Mohsen Ghaffari 0001, Saeed Ilchi. 292-300 [doi]
- Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander DecompositionsYi-Jun Chang, Hsin-Hao Su. 301-312 [doi]
- From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is GoodRachit Agarwal 0001, Shijin Rajakrishnan, David B. Shmoys. 313-323 [doi]
- A Graph Theoretic Approach for Resilient Distributed AlgorithmsMerav Parter. 324 [doi]
- Constant-Round Near-Optimal Spanners in Congested CliqueShiri Chechik, Tianyi Zhang. 325-334 [doi]
- The Laplacian Paradigm in the Broadcast Congested CliqueSebastian Forster, Tijn de Vos. 335-344 [doi]
- Massively Parallel Computation in a Heterogeneous RegimeOrr Fischer, Adi Horowitz, Rotem Oshman. 345-355 [doi]
- A Massively Parallel Modularity-Maximizing Algorithm with Provable GuaranteesVincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic. 356-365 [doi]
- Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling SetsShreyas Pai, Sriram V. Pemmaraju. 366-368 [doi]
- Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST ModelVignesh Manoharan, Vijaya Ramachandran. 369-371 [doi]
- Brief Announcement: Almost Universally Optimal Distributed Laplacian SolverIoannis Anagnostides, Christoph Lenzen 0001, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis. 372-374 [doi]
- Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine AgentsJion Hirose, Junya Nakamura 0001, Fukuhito Ooshita, Michiko Inoue. 375-377 [doi]
- Brief Announcement: Probabilistic Dynamic Input/Output AutomataPierre Civit, Maria Potop-Butucaru. 378-380 [doi]
- Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader AgreementIttai Abraham, Naama Ben-David, Sravya Yandamuri. 381-391 [doi]
- Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional SecurityIttai Abraham, Gilad Asharov. 392-398 [doi]
- Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved ComputationNicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren 0001, Mayank Varia, Zhuolun Xiang, Haibin Zhang. 399-417 [doi]
- Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal CommunicationNicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren 0001, Mayank Varia, Zhuolun Xiang, Haibin Zhang. 418-420 [doi]
- Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer WordsShir Cohen, Idit Keidar, Alexander Spiegelman. 421-423 [doi]
- Brief Announcement: Holistic Verification of Blockchain ConsensusNathalie Bertrand 0001, Vincent Gramoli, Igor Konnov 0001, Marijana Lazic, Pierre Tholoniat, Josef Widder. 424-426 [doi]
- Brief Announcement: How to Tame Multiple Spending in Decentralized CryptocurrenciesJoão Paulo Bezerra, Petr Kuznetsov. 427-429 [doi]
- Adaptively Secure Single Secret Leader Election from DDHDario Catalano, Dario Fiore 0001, Emanuele Giunta. 430-439 [doi]
- Optimal Clock Synchronization with SignaturesChristoph Lenzen, Julian Loss. 440-449 [doi]
- Revisiting the Power of Non-Equivocation in Distributed ProtocolsNaama Ben-David, Benjamin Y. Chan, Elaine Shi. 450-459 [doi]
- A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate AgreementPierre Fraigniaud, Ami Paz, Sergio Rajsbaum. 460-470 [doi]
- A Distributed Combinatorial Topology Approach to Arrow's Impossibility TheoremSergio Rajsbaum, Armajac Raventós-Pujol. 471-481 [doi]
- Parameterized Verification under Release Acquire is PSPACE-completeShankara Narayanan Krishna, Adwait Godbole, Roland Meyer 0001, Soham Chakraborty. 482-492 [doi]
- Brief Announcement: Fault Tolerant Coloring of the Asynchronous CyclePierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie. 493-495 [doi]