Table of Contents

• Fast Plurality Consensus in Regular ExpandersColin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga. [doi]
• Interactive Compression for Multi-Party ProtocolGillat Kol, Rotem Oshman, Dafna Sadeh. [doi]
• Brief Announcement: Shape Formation by Programmable ParticlesGiuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi. [doi]
• Which Broadcast Abstraction Captures k-Set Agreement?Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal. [doi]
• Brief Announcement: Compact Topology of Shared-Memory AdversariesPetr Kuznetsov, Thibault Rieutord, Yuan He 0003. [doi]
• Brief Announcement: Towards a Complexity Theory for the Congested CliqueJanne H. Korhonen, Jukka Suomela. [doi]
• Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication ComplexityItay Hazan, Eyal Kushilevitz. [doi]
• Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as ConsensusChristoph Lenzen, Joel Rybicki. [doi]
• Brief Announcement: A Note on Hardness of Diameter ApproximationKarl Bringmann, Sebastian Krinninger. [doi]
• Some Lower Bounds in Dynamic Networks with Oblivious AdversariesIrvan Jahja, Haifeng Yu, Yuda Zhao. [doi]
• Brief Announcement: On Connectivity in the Broadcast Congested CliqueTomasz Jurdzinski, Krzysztof Nowicki 0002. [doi]
• Three Notes on Distributed Property TestingGuy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca. [doi]
• Hybrid Consensus: Efficient Consensus in the Permissionless ModelRafael Pass, Elaine Shi. [doi]
• Improved Distributed Degree Splitting and Edge ColoringMohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto. [doi]
• Cost of Concurrency in Hybrid Transactional MemoryTrevor Brown 0001, Srivatsan Ravi. [doi]
• Phase Transitions and Emergent Phenomena in Random Structures and Algorithms (Keynote Talk)Dana Randall. [doi]
• Brief Announcement: Applying Predicate Detection to the Stable Marriage ProblemVijay K. Garg. [doi]
• Dalí: A Periodically Persistent Hash MapFaisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B. Morrey III, Dhruva R. Chakrabarti, Michael L. Scott. [doi]
• Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity HierarchyManuela Fischer, Mohsen Ghaffari. [doi]
• Quadratic and Near-Quadratic Lower Bounds for the CONGEST ModelKeren Censor Hillel, Seri Khoury, Ami Paz. [doi]
• How Large Is Your Graph?Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo. [doi]
• Improved Deterministic Distributed Construction of SpannersOfer Grossman, Merav Parter. [doi]
• Consistency Models with Global Operation Sequencing and their CompositionAlexey Gotsman, Sebastian Burckhardt. [doi]
• Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph ProblemChristoph Lenzen, Reut Levi. [doi]
• Near-Optimal Distributed DFS in Planar GraphsMohsen Ghaffari, Merav Parter. [doi]
• Certification of Compact Low-Stretch Routing SchemesAlkida Balliu, Pierre Fraigniaud. [doi]
• Brief Announcement: Crash-Tolerant Consensus in Directed Graph RevisitedAshish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar. [doi]
• Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend/ResumeShady Issa, Pascal Felber, Alexander Matveev, Paolo Romano 0002. [doi]
• Error-Sensitive Proof-Labeling SchemesLaurent Feuilloley, Pierre Fraigniaud. [doi]
• Demand-Aware Network Designs of Bounded DegreeChen Avin, Kaushik Mondal, Stefan Schmid. [doi]
• Improved Deterministic Distributed Matching via RoundingManuela Fischer. [doi]
• Brief Announcement: Distributed SplayNetsBruna Soares Peres, Olga Goussevskaia, Stefan Schmid, Chen Avin. [doi]
• Blockchain Consensus Protocols in the Wild (Keynote Talk)Christian Cachin, Marko Vukolic. [doi]
• Simple and Near-Optimal Distributed Coloring for Sparse GraphsMohsen Ghaffari, Christiana Lymouri. [doi]
• Recommenders: from the Lab to the Wild (Keynote Talk)Anne-Marie Kermarrec. [doi]
• Dynamic Reconfiguration: Abstraction and Optimal Asynchronous SolutionAlexander Spiegelman, Idit Keidar, Dahlia Malkhi. [doi]
• Derandomizing Local Distributed Algorithms under Bandwidth RestrictionsKeren Censor Hillel, Merav Parter, Gregory Schwartzman. [doi]
• Brief Announcement: Black-Box Concurrent Data Structures for NUMA ArchitecturesIrina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera. [doi]
• Brief Announcement: The Synergy of Finite State MachinesYehuda Afek, Yuval Emek, Noa Kolikant. [doi]
• Brief Announcement: On the Parallel Undecided-State Dynamics with Two ColorsAndrea E. F. Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca. [doi]
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming ModelsRuben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen. [doi]
• Brief Announcement: Fast Aggregation in Population ProtocolsRyota Eguchi, Taisuke Izumi. [doi]
• Asynchronous Approach in the Plane: A Deterministic Polynomial AlgorithmSébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, Franck Petit. [doi]
• Meeting in a Polygon by Anonymous Oblivious RobotsGiuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita. [doi]
• Front Matter, Table of Contents, Preface, Symposium Organization, Awards [doi]
• Brief Announcement: Towards Reduced Instruction Sets for SynchronizationRati Gelashvili, Idit Keidar, Alexander Spiegelman, Roger Wattenhofer. [doi]
• Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile MemoryMichal Friedman, Maurice Herlihy, Virendra J. Marathe, Erez Petrank. [doi]
• Brief Announcement: Practical Synchronous Byzantine ConsensusIttai Abraham, Srinivas Devadas, Kartik Nayak, Ling Ren 0001. [doi]
• Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary GraphsLélia Blin, Sébastien Tixeuil. [doi]
• Recovering Shared Objects Without Stable StorageEllis Michael, Dan R. K. Ports, Naveen Kr. Sharma, Adriana Szekeres. [doi]
• Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away DescriptorsMaya Arbel-Raviv, Trevor Brown 0001. [doi]
• Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling SetsShreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson 0002. [doi]
• Brief Announcement: Rapid Mixing of Local Dynamics on GraphsLaurent Massoulié, Rémi Varloot. [doi]
• Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural NetworksNancy A. Lynch, Cameron Musco, Merav Parter. [doi]
• An Efficient Communication Abstraction for Dense Wireless NetworksMagnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, Calvin Newport. [doi]
• On the Number of Objects with Distinct Power and the Linearizability of Set Agreement ObjectsDavid Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg. [doi]
• Recoverable FCFS Mutual Exclusion with Wait-Free RecoveryPrasad Jayanti, Anup Joshi. [doi]
• Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic NetworksMatthias Függer, Thomas Nowak, Manfred Schwarz. [doi]
• Dynamic Analysis of the Arrow Distributed Directory Protocol in General NetworksAbdolhamid Ghodselahi, Fabian Kuhn. [doi]
• Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous SystemsHammurabi Mendes, Maurice Herlihy. [doi]