Table of Contents

• The Power of Abstract MAC Layer: A Fault-Tolerance PerspectiveQinzi Zhang, Lewis Tseng. [doi]
• A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-MemoryBenyamin Bashari, David Yu Cheng Chan, Philipp Woelfel. [doi]
• Efficient Signature-Free Validated AgreementPierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi. [doi]
• Brief Announcement: Best-Possible Unpredictable Proof-Of-StakeLei Fan 0002, Jonathan Katz, Zhenghao Lu, Phuc Thai, Hong-Sheng Zhou. [doi]
• Self-Stabilizing MIS Computation in the Beeping ModelGeorge Giakkoupis, Volker Turau, Isabella Ziccardi. [doi]
• Brief Announcement: Self-Stabilizing Graph Exploration by a Single AgentYuichi Sudo, Fukuhito Ooshita, Sayaka Kamei. [doi]
• Brief Announcement: Solvability of Three-Process General TasksHagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum. [doi]
• Fully Local Succinct Distributed ArgumentsEden Aldema Tshuva, Rotem Oshman. [doi]
• Brief Announcement: Reconfigurable Heterogeneous Quorum SystemsXiao Li, Mohsen Lesani. [doi]
• Brief Announcement: Unifying Partial SynchronyAndrei Constantinescu 0001, Diana Ghinea, Jakub Sliwinski, Roger Wattenhofer. [doi]
• Asynchronous Fault-Tolerant Distributed Proper Coloring of GraphsAlkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mikaël Rabie. [doi]
• Sing a Song of SimplexVictor Shoup. [doi]
• Brief Announcement: Distinct Gathering Under Round RobinFabian Frei, Koichi Wada 0001. [doi]
• Brief Announcement: Colorless Tasks and Extension-Based ProofsYusong Shi, Weidong Liu. [doi]
• A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate SnapshotYannis Coutouly, Emmanuel Godard. [doi]
• Hyperproperty-Preserving Register SpecificationsYoav Ben Shimon, Ori Lahav 0001, Sharon Shoham. [doi]
• Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic SpacePhilipp Czerner, Vincent Fischer, Roland Guttenberg. [doi]
• Brief Announcement: Concurrent Aggregate QueriesGal Sela 0001, Erez Petrank. [doi]
• Near-Linear Time Dispersion of Mobile AgentsYuichi Sudo, Masahiro Shibata, Junya Nakamura 0001, Yonghwan Kim 0001, Toshimitsu Masuzawa. [doi]
• Brief Announcement: Decreasing Verification Radius in Local CertificationJan Matyás Kristan, Josef Erik Sedlácek. [doi]
• Convex Consensus with Asynchronous FallbackAndrei Constantinescu 0001, Diana Ghinea, Roger Wattenhofer, Floris Westermann. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Brief Announcement: Agent-Based Leader Election, MST, and BeyondAjay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma. [doi]
• Content-Oblivious Leader Election on RingsFabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin. [doi]
• Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary StructuresPierre Fraigniaud, Minh-Hang Nguyen, Ami Paz. [doi]
• Sorting in One and Two Rounds Using t-ComparatorsRan Gelles, Zvi Lotker, Frederik Mallmann-Trenn. [doi]
• Communication Requirements for Linearizable RegistersRaïssa Nataf, Yoram Moses. [doi]
• Brief Announcement: Clock Distribution with Gradient TRIXChristoph Lenzen 0001, Shreyas Srinivas. [doi]
• Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual GraphsMaxime Flin, Magnús M. Halldórsson, Alexandre Nolin. [doi]
• Faster Cycle Detection in the Congested CliqueKeren Censor Hillel, Tomer Even, Virginia Vassilevska Williams. [doi]
• Quantum Byzantine Agreement Against Full-Information AdversaryLongcheng Li, Xiaoming Sun 0001, Jiadong Zhu. [doi]
• Connectivity Labeling in Faulty Colored GraphsAsaf Petruschka, Shay Spair, Elad Tzalik. [doi]
• Distributed Model Checking on Graphs of Bounded TreedepthFedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca. [doi]
• Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous RobotsCaterina Feletti, Debasish Pattanayak, Gokarna Sharma. [doi]
• Freeze-Tag in L₁ Has Wake-Up Time Five with Linear ComplexityNicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse. [doi]
• Vertical Atomic Broadcast and Passive ReplicationManuel Bravo, Gregory V. Chockler, Alexey Gotsman, Alejandro Naser-Pastoriza, Christian Roldán. [doi]
• Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial EdgesAntoine El-Hayek, Monika Henzinger, Stefan Schmid 0001. [doi]
• Memory Lower Bounds and Impossibility Results for Anonymous Dynamic BroadcastGarrett Parzych, Joshua J. Daymude. [doi]
• Massively Parallel Ruling Set Made DeterministicJeff Giliberti, Zahra Parsaeian. [doi]
• Almost Optimal Algorithms for Token Collision in Anonymous NetworksSirui Bai, Xinyu Fu 0009, Xudong Wu, Penghui Yao, Chaodong Zheng. [doi]
• Distributed Delta-Coloring Under Bandwidth LimitationsMagnús M. Halldórsson, Yannic Maus. [doi]
• On the Limits of Information Spread by Memory-Less AgentsNiccolò D'Archivio, Robin Vacus. [doi]
• Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant MemoryJérémie Chalopin, Shantanu Das 0001, Maria Kokkou. [doi]
• What Cannot Be Implemented on Weak Memory?Armando Castañeda, Gregory V. Chockler, Brijesh Dongol, Ori Lahav 0001. [doi]
• Granular SynchronyNeil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren 0001. [doi]
• Byzantine Resilient Distributed Computing on External DataJohn Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, Aishwarya Thiruvengadam. [doi]
• Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential ThresholdsPhilipp Czerner. [doi]
• Parallel Set Cover and Hypergraph Matching via Uniform Random SamplingLaxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic. [doi]
• Brief Announcement: Distributed Maximum Flow in Planar GraphsYaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann. [doi]
• A Knowledge-Based Analysis of Intersection ProtocolsKaya Alpturer, Joseph Y. Halpern, Ron van der Meyden. [doi]
• Lock-Free Augmented TreesPanagiota Fatourou, Eric Ruppert. [doi]
• On the Power of Graphical Reconfigurable CircuitsYuval Emek, Yuval Gil, Noga Harlev. [doi]
• Single Bridge Formation in Self-Organizing Particle SystemsShunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, Andréa W. Richa. [doi]
• Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message AdversaryTimothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas. [doi]
• The Computational Power of Discrete Chemical Reaction Networks with Bounded ExecutionsDavid Doty, Ben Heckmann. [doi]
• Speedup of Distributed Algorithms for Power Graphs in the CONGEST ModelLeonid Barenboim, Uri Goldenberg. [doi]