Table of Contents

• Efficient Multi-Word Compare and SwapRachid Guerraoui, Alex Kogan, Virendra J. Marathe, Igor Zablotchi. [doi]
• From Partial to Global Asynchronous Reliable BroadcastDiana Ghinea, Martin Hirt, Chen-Da Liu Zhang. [doi]
• Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant TimeGuy E. Blelloch, Yuanhao Wei. [doi]
• Improved Distributed Approximations for Maximum Independent SetKen-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman. [doi]
• Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and BeyondMohsen Ghaffari, Christoph Grunau, Ce Jin. [doi]
• Brief Announcement: Polygraph: Accountable Byzantine AgreementPierre Civit, Seth Gilbert, Vincent Gramoli. [doi]
• Improved Bounds for Distributed Load BalancingSepehr Assadi, Aaron Bernstein, Zachary Langley. [doi]
• Brief Announcement: Efficient Load-Balancing Through Distributed Token DroppingSebastian Brandt 0002, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto. [doi]
• Brief Announcement: What Can(Not) Be Perfectly Rerouted LocallyKlaus-Tycho Foerster, Juho Hirvonen, Yvonne Anne Pignolet, Stefan Schmid 0001, Gilles Trédan. [doi]
• Byzantine Lattice Agreement in Synchronous Message Passing SystemsXiong Zheng, Vijay K. Garg. [doi]
• Local Conflict Coloring Revisited: Linial for ListsYannic Maus, Tigran Tonoyan. [doi]
• Distributed Maximum Matching Verification in CONGESTMohamad Ahmadi, Fabian Kuhn. [doi]
• Distributed Constructions of Dual-Failure Fault-Tolerant Distance PreserversMerav Parter. [doi]
• Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation RevisitedAshish Choudhury. [doi]
• Distributed Planar Reachability in Nearly Optimal TimeMerav Parter. [doi]
• Models of Smoothing in Dynamic NetworksUri Meir, Ami Paz, Gregory Schwartzman. [doi]
• Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication ModelEmilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo. [doi]
• Singularly Optimal Randomized Leader ElectionShay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg. [doi]
• Fast Agreement in Networks with Byzantine NodesBogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski. [doi]
• Brief Announcement: Game Theoretical Framework for Analyzing Blockchains RobustnessPaolo Zappalà, Marianna Belotti, Maria Potop-Butucaru, Stefano Secci. [doi]
• Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case LatencyIttai Abraham, Kartik Nayak, Ling Ren 0001, Zhuolun Xiang. [doi]
• Communication Efficient Self-Stabilizing Leader ElectionXavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura. [doi]
• Distributed Dispatching in the Parallel Server ModelGuy Goren, Shay Vargaftik, Yoram Moses. [doi]
• Fast Distributed Algorithms for Girth, Cycles and Small SubgraphsKeren Censor Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman. [doi]
• Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine ProtocolsJohn Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, Jared Saia. [doi]
• Tight Bounds for Deterministic High-Dimensional Grid ExplorationSebastian Brandt 0002, Julian Portmann, Jara Uitto. [doi]
• Intermediate Value Linearizability: A Quantitative Correctness CriterionArik Rinberg, Idit Keidar. [doi]
• Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHPShir Cohen, Idit Keidar, Alexander Spiegelman. [doi]
• Distributed Computation with Continual Population GrowthDa-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, Quentin Soubeyran. [doi]
• Improved Extension Protocols for Byzantine Broadcast and AgreementKartik Nayak, Ling Ren 0001, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang. [doi]
• The Splay-List: A Distribution-Adaptive Concurrent Skip-ListVitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami. [doi]
• Classification of Distributed Binary Labeling ProblemsAlkida Balliu, Sebastian Brandt 0002, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela. [doi]
• Gathering on a Circle with Limited Visibility by Anonymous Oblivious RobotsGiuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi. [doi]
• Brief Announcement: Building Fast Recoverable Persistent Data Structures with MontageHaosen Wen, Wentao Cai, Mingzhe Du, Benjamin Valpey, Michael L. Scott. [doi]
• Asynchronous Reconfiguration with Byzantine FailuresPetr Kuznetsov, Andrei Tonkikh. [doi]
• Coloring Fast Without Learning Your Neighbors' ColorsMagnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin. [doi]
• Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip ProtocolsAurélien Bellet, Rachid Guerraoui, Hadrien Hendrikx. [doi]
• Spiking Neural Networks Through the Lens of Streaming AlgorithmsYael Hitron, Cameron Musco, Merav Parter. [doi]
• LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CASGuy E. Blelloch, Yuanhao Wei. [doi]
• Brief Announcement: Distributed Quantum Proofs for Replicated DataPierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz. [doi]
• The Complexity Landscape of Distributed Locally Checkable Problems on TreesYi-Jun Chang. [doi]
• Making Byzantine Consensus LiveManuel Bravo, Gregory V. Chockler, Alexey Gotsman. [doi]
• Spread of Information and Diseases via Random Walks in Sparse GraphsGeorge Giakkoupis, Hayk Saribekyan, Thomas Sauerwald. [doi]
• Improved Hardness of Approximation of Diameter in the CONGEST ModelOfer Grossman, Seri Khoury, Ami Paz. [doi]
• Brief Announcement: On Decidability of 2-Process Affine ModelsPetr Kuznetsov, Thibault Rieutord. [doi]
• Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic LensYi-Jun Chang, Jan Studený, Jukka Suomela. [doi]
• Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer QueueDolev Adas, Roy Friedman. [doi]
• Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMROded Naor, Idit Keidar. [doi]
• Distributed Dense Subgraph Detection and Low Outdegree OrientationHsin-Hao Su, Hoa T. Vu. [doi]
• Twenty-Two New Approximate Proof Labeling SchemesYuval Emek, Yuval Gil. [doi]
• Leaderless State-Machine Replication: Specification, Properties, LimitsTuanir França Rezende, Pierre Sutra. [doi]
• Message Complexity of Population ProtocolsTalley Amir, James Aspnes, David Doty, Mahsa Eftekhari, Eric E. Severson. [doi]
• Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and ConsensusMartin Hirt, Ard Kastrati, Chen-Da Liu Zhang. [doi]
• Brief Announcement: Reaching Approximate Consensus When Everyone May CrashLewis Tseng, Qinzi Zhang, Yifan Zhang. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]