Table of Contents

• Accountability and Reconfiguration: Self-Healing Lattice AgreementLuciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni. [doi]
• Recoverable and Detectable Fetch&AddLiad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler. [doi]
• An Improved Random Shift Algorithm for Spanners and Low Diameter DecompositionsSebastian Forster, Martin Grösbacher, Tijn de Vos. [doi]
• Twins: BFT Systems Made RobustShehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li, Avery Ching, Dahlia Malkhi. [doi]
• Strongly Linearizable Linked List and QueueSteven Munsu Hwang, Philipp Woelfel. [doi]
• Design and Analysis of a Logless Dynamic Reconfiguration ProtocolWilliam Schultz, Siyuan Zhou, Ian Dardik, Stavros Tripakis. [doi]
• Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized BoundsBapi Chatterjee, Sathya Peri, Muktikanta Sa, Komma Manogna. [doi]
• Asynchronous Rumor Spreading in Dynamic GraphsBernard Mans, Ali Pourmiri. [doi]
• Asynchronous Gathering in a TorusSayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada. [doi]
• Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete CategorizationIttai Abraham, Ling Ren 0001, Zhuolun Xiang. [doi]
• Distributed CONGEST Approximation of Weighted Vertex Covers and MatchingsSalwa Faour, Marc Fuchs, Fabian Kuhn. [doi]
• Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election AlgorithmsLélia Blin, Laurent Feuilloley, Gabriel Le Bouder. [doi]
• Near-Shortest Path Routing in Hybrid Communication NetworksSam Coy, Artur Czumaj, Michael Feldmann 0001, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs. [doi]
• Optimal Good-Case Latency for Rotating Leader Synchronous BFTIttai Abraham, Kartik Nayak, Nibesh Shrestha. [doi]
• Fast Graphical Population ProtocolsDan Alistarh, Rati Gelashvili, Joel Rybicki. [doi]
• RandSolomon: Optimally Resilient Random Number Generator with Deterministic TerminationLuciano Freitas de Souza, Andrei Tonkikh, Sara Tucci Piergiovanni, Renaud Sirdey, Oana Stan, Nicolas Quero, Petr Kuznetsov. [doi]
• Efficient Assignment of Identities in Anonymous PopulationsLeszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas. [doi]
• Using Nesting to Push the Limits of Transactional Data Structure LibrariesGal Assa, Hagar Meir, Guy Golan-Gueta, Idit Keidar, Alexander Spiegelman. [doi]
• Near-Optimal Dispersion on Arbitrary Anonymous GraphsAjay D. Kshemkalyani, Gokarna Sharma. [doi]
• Accountable Distributed Computing (Invited Talk)Petr Kuznetsov. [doi]
• Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small SeparatorsOrr Fischer, Rotem Oshman, Dana Shamir. [doi]
• Improved Distributed Fractional Coloring AlgorithmsAlkida Balliu, Fabian Kuhn, Dennis Olivetti. [doi]
• Arbitrarily Accurate Aggregation Scheme for Byzantine SGDAlexandre Maurer. [doi]
• Pattern Formation by Robots with Inaccurate MovementsKaustav Bose, Archak Das, Buddhadeb Sau. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• A Fresh Look at the Design and Implementation of Communication Paradigms (Invited Talk)Robbert van Renesse. [doi]
• Local Certification of Graph Decompositions and Applications to Minor-Free ClassesNicolas Bousquet, Laurent Feuilloley, Théo Pierron. [doi]
• Population Protocols for Graph Class Identification ProblemsHiroto Yasumi, Fukuhito Ooshita, Michiko Inoue. [doi]
• Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph ParametersAmir Nikabadi, Janne H. Korhonen. [doi]
• Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk)Nathalie Bertrand 0001. [doi]
• On Finality in BlockchainsEmmanuelle Anceaume, Antonella Del Pozzo, Thibault Rieutord, Sara Tucci Piergiovanni. [doi]
• Distributed Recoloring of Interval and Chordal GraphsNicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie. [doi]