Accepted Papers

Regular Papers

• James Aspnes and He Yang Er: Consensus with max registers
• Hagit Attiya and Constantin Enea: Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects
• Ahad Baig, Danny Hendler, Alessia Milani and Corentin Travers: Long-Lived Counters with Polylogarithmic Amortized Step Complexity
• Ruben Becker, Yuval Emek, Mohsen Ghaffari and Christoph Lenzen: Distributed Algorithms for Low Stretch Spanning Trees
• Ran Ben Basat, Guy Even, Ken-Ichi Kawarabayashi and Gregory Schwartzman: Optimal Distributed Covering Algorithms
• Ran Ben Basat, Ken-Ichi Kawarabayashi and Gregory Schwartzman: Parameterized Distributed Algorithms
• Shimon Bitton, Yuval Emek, Taisuke Izumi and Shay Kutten: Message Reduction in the LOCAL Model is a Free Lunch
• Mark Braverman, Gillat Kol, Rotem Oshman and Avishay Tal: On the Computational Power of Radio Channels
• Janna Burman, Joffroy Beauquier and Devan Sohier: Space-Optimal Naming in Population Protocols
• Keren Censor-Hillel, Bernhard Haeupler, D Ellis Hershkowitz and Goran Zuzic: Erasure Correction for Noisy Radio Networks
• Shiri Chechik and Doron Mukhtar: Reachability and Shortest Paths in the Broadcast CONGEST model
• Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland and Alex Samorodnitsky: On the Round Complexity of Randomized Byzantine Agreement
• Pierluigi Crescenzi, Pierre Fraigniaud and Ami Paz: Trade-offs in Distributed Interactive Proofs
• Michael Dinitz, Magnús M. Halldórsson, Calvin Newport and Alex Weaver: The Capacity of Smartphone Peer-to-Peer Networks
• Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn and Rotem Oshman: Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles
• Orr Fischer and Rotem Oshman: A Distributed Algorithm for Directed Minimum-Weight Spanning Tree
• Eli Gafni, Giuliano Losa and David Mazières: Stellar Consensus by Reduction
• Paweł Garncarek, Tomasz Jurdzinski and Dariusz Kowalski: Stable Memoryless Queuing under Contention
• Mohsen Ghaffari and Julian Portmann: Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond
• Seth Gilbert and Calvin Newport: On Bioelectric Algorithms
• Éric Goubault, Marijana Lazić, Jérémy Ledent and Sergio Rajsbaum: Wait-Free Solvability of Equality Negation Tasks
• Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic and Dragos-Adrian Seredinschi: Scalable Byzantine Reliable Broadcast
• Kristian Hinnenthal, Christian Scheideler and Martijn Struijs: Fast Distributed Algorithms for LP-Type Problems of Low Dimension
• Artem Khyzha, Hagit Attiya and Alexey Gotsman: Privatization-Safe Transactional Memories
• Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi and Taisuke Izumi: Low-Congestion Shortcut and Graph Parameters
• Christian Konrad, Sriram Pemmaraju, Talal Riaz and Peter Robinson: The Complexity of Symmetry Breaking in Massive Graphs
• Wei Quan Lim and Seth Gilbert: Parallel Finger Search Structures
• Ruslan Nikolaev: Scalable, portable, and memory-efficient lock-free FIFO queue
• Thomas Nowak and Joel Rybicki: Byzantine Approximate Agreement on Graphs
• Merav Parter: Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
• Adones Rukundo, Aras Atalar and Philippas Tsigas: Monotonically relaxing concurrent data-structure semantics for performance: An efficient 2D design framework
• Nobutaka Shimizu and Takeharu Shiraga: Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
• Seyed Mohammad Taheri Otaghsara, Arash Pourdamghani and Mohsen Lesani: Polynomial-time Fence Insertion For Structured Programs
• Hoa Vu and Hsin-Hao Su: Distributed Data Summarization in Well-Connected Networks

Brief Announcements

• Chen Avin, Iosif Salem and Stefan Schmid: Brief Announcement: On Self-Adjusting Skip List Networks
• Soheil Behnezhad, Mahsa Derakhshan, Mohammadtaghi Hajiaghayi, Marina Knittel and Hamed Saleh: Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring
• Grégoire Bonin, Achour Mostéfaoui and Matthieu Perrin: Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model
• Christian Cachin and Björn Tackmann: Brief Announcement: Asymmetric Distributed Trust
• Vicent Cholvi, Antonio Fernandez Anta, Chryssis Georgiou and Nicolas Nicolaou: Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects
• Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita and Koichi Wada: Brief Announcement: Neighborhood Mutual Remainder and its Self-Stabilizing Implementation of Look-Compute-Move Robots
• Xavier Défago, Adam Heriban, Sébastien Tixeuil and Koichi Wada: Brief Announcement: Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Continuous Spaces
• Laurent Feuilloley, Lélia Blin and Gabriel Le Bouder: Brief announcement: Memory lower bounds for self-stabilization
• Suyash Gupta, Jelle Hellings and Mohammad Sadoghi: Brief Announcement: revisiting consensus protocols through wait-free parallelization
• Jelle Hellings and Mohammad Sadoghi: Brief Announcement: the fault-tolerant cluster-sending problem
• Masoomeh Javidi Kishi, Ahmed Hassan and Roberto Palmieri: Brief Announcement: On the Correctness of Transaction Processing with External Dependency
• Chen-Da Liu-Zhang, Varun Maram and Ueli Maurer: Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models
• Ali Mashreghi and Valerie King: Brief Announcement: Faster asynchronous MST and low diameter tree construction with sublinear communication
• Yasamin Nazari and Michael Dinitz: Brief Announcement: Massively Parallel Approximate Distance Sketches
• Mien Brabeeba Wang and Nancy Lynch: Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit