Table of Contents

• Smoothed Analysis of Information Spreading in Dynamic NetworksMichael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport. [doi]
• Locally Restricted Proof Labeling SchemesYuval Emek, Yuval Gil, Shay Kutten. [doi]
• An Almost Singularly Optimal Asynchronous Distributed MST AlgorithmFabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg. [doi]
• Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population ProtocolsLeszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak. [doi]
• On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine FailuresXing Hu 0009, Sam Toueg. [doi]
• Broadcast CONGEST Algorithms Against EavesdroppersYael Hitron, Merav Parter, Eylon Yogev. [doi]
• Liveness and Latency of Byzantine State-Machine ReplicationManuel Bravo, Gregory V. Chockler, Alexey Gotsman. [doi]
• Fragmented ARES: Dynamic Storage for Large ObjectsChryssis Georgiou, Nicolas Nicolaou, Andria Trigeorgi. [doi]
• Brief Announcement: Computing Power of Hybrid Models in Synchronous NetworksPierre Fraigniaud, Pedro Montealegre 0001, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca. [doi]
• Brief Announcement: Survey of Persistent Memory Correctness ConditionsNaama Ben-David, Michal Friedman 0001, Yuanhao Wei. [doi]
• Fast Distributed Vertex Splitting with ApplicationsMagnús M. Halldórsson, Yannic Maus, Alexandre Nolin. [doi]
• Brief Announcement: Distributed Quantum Interactive ProofsFrançois Le Gall, Masayuki Miyamoto, Harumichi Nishimura. [doi]
• Brief Announcement: Null Messages, Information and CoordinationRaïssa Nataf, Guy Goren, Yoram Moses. [doi]
• Distributed Randomness from Approximate AgreementLuciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh. [doi]
• Brief Announcement: It's not easy to relax: liveness in chained BFT protocolsIttai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, Florian Suri-Payer. [doi]
• Brief Announcement: Authenticated Consensus in Synchronous Systems with Mixed FaultsIttai Abraham, Danny Dolev, Alon Kagan, Gilad Stern. [doi]
• Õptimal Dual Vertex Failure Connectivity LabelsMerav Parter, Asaf Petruschka. [doi]
• Space-Stretch Tradeoff in Routing RevisitedAnatoliy Zinovyev. [doi]
• Safe Permissionless ConsensusYouer Pu, Lorenzo Alvisi, Ittay Eyal. [doi]
• Brief Announcement: Gathering Despite Defected ViewYonghwan Kim 0001, Masahiro Shibata, Yuichi Sudo, Junya Nakamura 0001, Yoshiaki Katayama, Toshimitsu Masuzawa. [doi]
• Brief Announcement: An Effective Geometric Communication Structure for Programmable MatterIrina Kostitsyna, Tom Peters, Bettina Speckmann. [doi]
• Holistic Verification of Blockchain ConsensusNathalie Bertrand 0001, Vincent Gramoli, Igor Konnov 0001, Marijana Lazic, Pierre Tholoniat, Josef Widder. [doi]
• Brief Announcement: Foraging in Particle Systems via Self-Induced Phase ChangesShunhao Oh, Dana Randall, Andréa W. Richa. [doi]
• Polynomial-Time Verification and Testing of Implementations of the Snapshot Data StructureGal Amram, Avi Hayoun, Lior Mizrahi, Gera Weiss. [doi]
• How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio NetworksVarsha Dani, Thomas P. Hayes. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Packet Forwarding with a Locally Bursty AdversaryWill Rosenbaum. [doi]
• The Weakest Failure Detector for Genuine Atomic MulticastPierre Sutra. [doi]
• Brief Announcement: Temporal Locality in Online AlgorithmsMaciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid 0001, Jukka Suomela, Aleksandr Tereshchenko. [doi]
• Graph Coloring, Palette Sparsification, and Beyond (Invited Talk)Sepehr Assadi. [doi]
• The Space Complexity of Scannable Objects with Bounded ComponentsSean Ovens. [doi]
• On Payment Channels in Asynchronous Money Transfer SystemsOded Naor, Idit Keidar. [doi]
• Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network TopologiesWenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Stefan Schmid 0001. [doi]
• Brief Announcement: Asymmetric Mutual Exclusion for RDMAJacob Nelson-Slivon, Lewis Tseng, Roberto Palmieri. [doi]
• Contention Resolution Without Collision Detection: Constant Throughput And Logarithmic EnergyGianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak. [doi]
• Managing the Cyber Risk in a Decoupled World: Does This Bring Potential Opportunities in Computer Science? (Invited Talk)Roberto Baldoni. [doi]
• Distributed Construction of Lightweight Spanners for Unit Ball GraphsDavid Eppstein, Hadi Khodabandeh. [doi]
• Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New ApproachSharareh Alipour, Mohammadhadi Salari. [doi]
• Improved Deterministic Connectivity in Massively Parallel ComputationManuela Fischer, Jeff Giliberti, Christoph Grunau. [doi]
• Fault Tolerant Coloring of the Asynchronous CyclePierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie. [doi]
• Byzantine Connectivity Testing in the Congested CliqueJohn Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev. [doi]
• Near-Optimal Distributed Computation of Small Vertex CutsMerav Parter, Asaf Petruschka. [doi]
• Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic CaseTimothé Albouy, Davide Frey, Michel Raynal, François Taïani. [doi]
• Oracular Byzantine Reliable BroadcastMartina Camaioni, Rachid Guerraoui, Matteo Monti, Manuel Vidigueira. [doi]
• Routing Schemes and Distance Oracles in the Hybrid ModelFabian Kuhn, Philipp Schneider. [doi]
• Brief Announcement: Performance Anomalies in Concurrent Data Structure MicrobenchmarksRosina Kharal, Trevor Brown 0001. [doi]
• Dynamic Probabilistic Input Output AutomataPierre Civit, Maria Potop-Butucaru. [doi]
• How to Meet at a Node of Any Connected GraphSubhash Bhagat, Andrzej Pelc. [doi]
• Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira. [doi]
• Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion ShortcutsIoannis Anagnostides, Christoph Lenzen 0001, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis. [doi]
• Using Linearizable Objects in Randomized Concurrent Programs (Invited Talk)Jennifer L. Welch. [doi]
• Exponential Speedup over Locality in MPC with Optimal MemoryAlkida Balliu, Sebastian Brandt 0002, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto. [doi]
• Efficient Classification of Locally Checkable Problems in Regular TreesAlkida Balliu, Sebastian Brandt 0002, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela. [doi]