Abstract is missing.
- Brief Announcement: Massively Parallel Approximate Distance SketchesMichael Dinitz, Yasamin Nazari. [doi]
- Stellar Consensus by InstantiationGiuliano Losa, Eli Gafni, David Mazières. [doi]
- Wait-Free Solvability of Equality Negation TasksÉric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum. [doi]
- Reachability and Shortest Paths in the Broadcast CONGEST ModelShiri Chechik, Doron Mukhtar. [doi]
- Low-Congestion Shortcut and Graph ParametersNaoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi. [doi]
- Brief Announcement: Asymmetric Distributed TrustChristian Cachin, Björn Tackmann. [doi]
- Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear CommunicationAli Mashreghi, Valerie King. [doi]
- Brief Announcement: On the Correctness of Transaction Processing with External DependencyMasoomeh Javidi Kishi, Ahmed Hassan, Roberto Palmieri. [doi]
- A Distributed Algorithm for Directed Minimum-Weight Spanning TreeOrr Fischer, Rotem Oshman. [doi]
- Brief Announcement: Revisiting Consensus Protocols through Wait-Free ParallelizationSuyash Gupta, Jelle Hellings, Mohammad Sadoghi. [doi]
- Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent ObjectsHagit Attiya, Constantin Enea. [doi]
- Trade-Offs in Distributed Interactive ProofsPierluigi Crescenzi, Pierre Fraigniaud, Ami Paz. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Erasure Correction for Noisy Radio NetworksKeren Censor Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. [doi]
- Parallel Finger Search StructuresSeth Gilbert, Wei Quan Lim. [doi]
- Scalable Byzantine Reliable BroadcastRachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi. [doi]
- Message Reduction in the LOCAL Model Is a Free LunchShimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten. [doi]
- Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger ObjectsVicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas C. Nicolaou. [doi]
- On Bioelectric AlgorithmsSeth Gilbert, James Maguire, Calvin Newport. [doi]
- Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and BeyondMohsen Ghaffari, Julian Portmann. [doi]
- Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial ModelsChen-Da Liu Zhang, Varun Maram, Ueli Maurer. [doi]
- Parameterized Distributed AlgorithmsRan Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman. [doi]
- Optimal Distributed Covering AlgorithmsRan Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman. [doi]
- Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival ModelGrégoire Bonin, Achour Mostéfaoui, Matthieu Perrin. [doi]
- Consensus with Max RegistersJames Aspnes, Heyang Er. [doi]
- On the Round Complexity of Randomized Byzantine AgreementRan Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky. [doi]
- Stable Memoryless Queuing under ContentionPawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski. [doi]
- On the Computational Power of Radio ChannelsMark Braverman, Gillat Kol, Rotem Oshman, Avishay Tal. [doi]
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO QueueRuslan Nikolaev 0001. [doi]
- Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move RobotsShlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada. [doi]
- Brief Announcement: The Fault-Tolerant Cluster-Sending ProblemJelle Hellings, Mohammad Sadoghi. [doi]
- Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design FrameworkAdones Rukundo, Aras Atalar, Philippas Tsigas. [doi]
- Brief Announcement: On Self-Adjusting Skip List NetworksChen Avin, Iosif Salem, Stefan Schmid 0001. [doi]
- Brief Announcement: Streaming and Massively Parallel Algorithms for Edge ColoringSoheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh. [doi]
- Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even CyclesTalya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman. [doi]
- Space-Optimal Naming in Population ProtocolsJanna Burman, Joffroy Beauquier, Devan Sohier. [doi]
- Small Cuts and Connectivity Certificates: A Fault Tolerant ApproachMerav Parter. [doi]
- Polynomial-Time Fence Insertion for Structured ProgramsMohammad Taheri, Arash Pourdamghani, Mohsen Lesani. [doi]
- Brief Announcement: Memory Lower Bounds for Self-StabilizationLélia Blin, Laurent Feuilloley, Gabriel Le Bouder. [doi]
- Fast Distributed Algorithms for LP-Type Problems of Low DimensionKristian Hinnenthal, Christian Scheideler, Martijn Struijs. [doi]
- Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean SpaceXavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada. [doi]
- The Complexity of Symmetry Breaking in Massive GraphsChristian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson 0002. [doi]
- Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural CircuitNancy A. Lynch, Mien Brabeeba Wang. [doi]
- Byzantine Approximate Agreement on GraphsThomas Nowak, Joel Rybicki. [doi]
- Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block ModelsNobutaka Shimizu, Takeharu Shiraga. [doi]
- Distributed Data Summarization in Well-Connected NetworksHsin-Hao Su, Hoa T. Vu. [doi]
- The Capacity of Smartphone Peer-To-Peer NetworksMichael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver. [doi]
- Long-Lived Counters with Polylogarithmic Amortized Step ComplexityMirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers. [doi]
- Privatization-Safe Transactional MemoriesArtem Khyzha, Hagit Attiya, Alexey Gotsman. [doi]
- Distributed Algorithms for Low Stretch Spanning TreesRuben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen. [doi]