Table of Contents

• 2021 Edsger W. Dijkstra Prize in Distributed ComputingKeren Censor Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg. 1 [doi]
• 2021 Principles of Distributed Computing Doctoral Dissertation AwardMarcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi. 3 [doi]
• Differential Privacy in Distributed Environments: An Overview and Open QuestionsCynthia Dwork. 5 [doi]
• Elle: Finding Isolation Violations in Real-World DatabasesKyle Kingsbury. 7 [doi]
• Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited VisibilityDavid G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro. 9-19 [doi]
• On Implementing Stabilizing Leader Election with Weak Assumptions on Network DynamicsKarine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit. 21-31 [doi]
• Time-Optimal Self-Stabilizing Leader Election in Population ProtocolsJanna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty, Thomas Nowak, Eric E. Severson, Chuan Xu. 33-44 [doi]
• Lower Bounds on the State Complexity of Population ProtocolsPhilipp Czerner, Javier Esparza. 45-54 [doi]
• Comparison Dynamics in Population ProtocolsDan Alistarh, Martin Töpfer 0003, Przemyslaw Uznanski. 55-65 [doi]
• Diversity, Fairness, and Sustainability in Population ProtocolsNan Kang, Frederik Mallmann-Trenn, Nicolás Rivera. 67-76 [doi]
• Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact MajorityDavid Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Grzegorz Stachowiak, Przemyslaw Uznanski. 77-80 [doi]
• Search via Parallel Lévy Walks on Z2Andrea E. F. Clementi, Francesco D'Amore 0001, George Giakkoupis, Emanuele Natale. 81-91 [doi]
• A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological NetworksYuval Emek, Eyal Keren. 93-102 [doi]
• Efficient Deterministic Leader Election for Programmable MatterFabien Dufoulon, Shay Kutten, William K. Moses Jr.. 103-113 [doi]
• Decision Power of Weak Asynchronous Models of Distributed ComputingPhilipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza. 115-125 [doi]
• Contention Resolution with PredictionsSeth Gilbert, Calvin Newport, Nitin Vaidya, Alex Weaver. 127-137 [doi]
• Tight Trade-off in Contention Resolution without Collision DetectionHaimin Chen, Yonggang Jiang, Chaodong Zheng. 139-149 [doi]
• Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio NetworksVarsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie. 151-153 [doi]
• Hedging Against Sore Loser Attacks in Cross-Chain TransactionsYingjie Xue, Maurice Herlihy. 155-164 [doi]
• All You Need is DAGIdit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, Alexander Spiegelman. 165-175 [doi]
• Embedding a Deterministic BFT Protocol in a Block DAGMaria Anna Schett, George Danezis. 177-186 [doi]
• Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change ProtocolRati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang. 187-190 [doi]
• Brief Announcement: Classifying Trusted Hardware via Unidirectional CommunicationNaama Ben-David, Kartik Nayak. 191-194 [doi]
• Brief Announcement: Malicious Security Comes for Free in Consensus with LeadersMark Abspoel, Thomas Attema, Matthieu Rambaud. 195-198 [doi]
• Brief Announcement: Brokering with Hashed Timelock Contracts is NP-HardEric Chan, Mohsen Lesani. 199-202 [doi]
• Low-Congestion Shortcuts in Constant Diameter GraphsShimon Kogan, Merav Parter. 203-211 [doi]
• Low-Congestion Shortcuts for Graphs Excluding Dense MinorsMohsen Ghaffari, Bernhard Haeupler. 213-221 [doi]
• Constant-Round Spanners and Shortest Paths in Congested Clique and MPCMichal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf. 223-233 [doi]
• Ultra-Sparse Near-Additive EmulatorsMichael Elkin, Shaked Matar. 235-246 [doi]
• Can We Break Symmetry with o(m) Communication?Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson 0002. 247-257 [doi]
• Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and AgreementManish Kumar, Anisur Rahaman Molla. 259-262 [doi]
• Locally Checkable Problems in Rooted TreesAlkida Balliu, Sebastian Brandt 0002, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko. 263-272 [doi]
• Strong-Diameter Network DecompositionYi-Jun Chang, Mohsen Ghaffari. 273-281 [doi]
• Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in TreesAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti. 283-293 [doi]
• On the Locality of Nash-Williams Forest Decomposition and Star-Forest DecompositionDavid G. Harris, Hsin-Hao Su, Hoa T. Vu. 295-305 [doi]
• The Randomized Local Computation Complexity of the Lovász Local LemmaSebastian Brandt 0002, Christoph Grunau, Václav Rozhon. 307-317 [doi]
• Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per PartyElette Boyle, Ran Cohen, Aarushi Goel. 319-330 [doi]
• Good-case Latency of Byzantine Broadcast: a Complete CategorizationIttai Abraham, Kartik Nayak, Ling Ren 0001, Zhuolun Xiang. 331-341 [doi]
• Revisiting Optimal Resilience of Fast Byzantine ConsensusPetr Kuznetsov, Andrei Tonkikh, Yan X. Zhang. 343-353 [doi]
• A New Way to Achieve Round-Efficient Byzantine AgreementMatthias Fitzi, Chen-Da Liu Zhang, Julian Loss. 355-362 [doi]
• Reaching Consensus for Asynchronous Distributed Key GenerationIttai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu. 363-373 [doi]
• Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish FaultsJustin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha. 375-377 [doi]
• Approximate Byzantine Fault-Tolerance in Distributed OptimizationShuo Liu 0011, Nirupam Gupta, Nitin H. Vaidya. 379-389 [doi]
• Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?Rachid Guerraoui, Nirupam Gupta, Rafaël Pinot, Sébastien Rouault, John Stephan. 391-401 [doi]
• Stochastic Coordination in Heterogeneous Load Balancing SystemsGuy Goren, Shay Vargaftik, Yoram Moses. 403-414 [doi]
• The Topology of Randomized Symmetry-Breaking Distributed ComputingPierre Fraigniaud, Ran Gelles, Zvi Lotker. 415-425 [doi]
• Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial ComplexesJérémy Ledent. 427-430 [doi]
• Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for ConnectivityMoses Charikar, Weiyun Ma, Li-Yang Tan. 431-433 [doi]
• Restorable Shortest Path Tiebreaking for Edge-Faulty GraphsGreg Bodwin, Merav Parter. 435-443 [doi]
• Fault-Tolerant Labeling and Compact Routing SchemesMichal Dory, Merav Parter. 445-455 [doi]
• Time-Optimal Construction of Overlay NetworksThorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann. 457-468 [doi]
• Improved Deterministic (Δ+1) Coloring in Low-Space MPCArtur Czumaj, Peter Davies, Merav Parter. 469-479 [doi]
• Component Stability in Low-Space Massively Parallel ComputationArtur Czumaj, Peter Davies, Merav Parter. 481-491 [doi]
• Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths AlgorithmNairen Cao, Jeremy T. Fineman, Katina Russell. 493-496 [doi]
• Reductions and Extension-Based ProofsKayman Brusse, Faith Ellen. 497-507 [doi]
• The Space Complexity of Scannable Binary ObjectsSean Ovens. 509-519 [doi]
• On Register Linearizability and TerminationVassos Hadzilacos, Xing Hu, Sam Toueg. 521-531 [doi]
• Tight Lower Bound for the RMR Complexity of Recoverable Mutual ExclusionDavid Yu Cheng Chan, Philipp Woelfel. 533-543 [doi]
• An Efficient Adaptive Partial Snapshot ImplementationBenyamin Bashari, Philipp Woelfel. 545-555 [doi]
• Brief Announcement: Detectable Sequential Specifications for Recoverable Shared ObjectsNan Li, Wojciech M. Golab. 557-560 [doi]
• Brief Announcement: Linearizability: A TypoGal Sela 0001, Maurice Herlihy, Erez Petrank. 561-564 [doi]
• Brief Announcement: What's Live? Understanding Distributed ConsensusSaksham Chand, Yanhong A. Liu. 565-568 [doi]
• Byzantine Agreement and Leader Election: From Classical to the ModernJohn Augustine, Anisur Rahaman Molla, Gopal Pandurangan. 569-571 [doi]
• Security and Privacy for Distributed Optimization & Distributed Machine LearningNitin H. Vaidya. 573 [doi]
• Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized ApplicationsAmit K. Chopra, Samuel H. Christie V., Munindar P. Singh. 575-576 [doi]