Table of Contents

• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL ProblemsPeter Robinson 0002. [doi]
• Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic EfficiencyYuval Gelles, Ilan Komargodski. [doi]
• Brief Announcement: Line Formation in Silent Programmable MatterAlfredo Navarra, Francesco Piselli. [doi]
• Brief Announcement: Let It TEE: Asynchronous Byzantine Atomic Broadcast with n ≥ 2f+1Marc Leinweber, Hannes Hartenstein. [doi]
• Self-Stabilizing Clock Synchronization in Probabilistic NetworksBernadette Charron-Bost, Louis Penet de Monterno. [doi]
• List Defective Colorings: Distributed Algorithms and ApplicationsMarc Fuchs, Fabian Kuhn. [doi]
• Treasure Hunt with Volatile PheromonesEvangelos Bampas, Joffroy Beauquier, Janna Burman, William Guy-Obé. [doi]
• Communication Lower Bounds for Cryptographic Broadcast ProtocolsErica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu Zhang. [doi]
• Gorilla: Safe Permissionless Byzantine ConsensusYouer Pu, Ali Farahbakhsh, Lorenzo Alvisi, Ittay Eyal. [doi]
• Brief Announcement: BatchBoost: Universal Batching for Concurrent Data StructuresVitaly Aksenov, Michael Anoprenko, Alexander Fedorov, Michael F. Spear. [doi]
• Brief Announcement: Grassroots Distributed Systems: Concept, Examples, Implementation and ApplicationsEhud Shapiro. [doi]
• One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless TasksHagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum. [doi]
• Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set ProblemMélanie Cambus, Fabian Kuhn, Shreyas Pai, Jara Uitto. [doi]
• Brief Announcement: Recoverable and Detectable Self-Implementations of SwapTomer Lev Lehman, Hagit Attiya, Danny Hendler. [doi]
• Fast Deterministic Rendezvous in Labeled LinesAvery Miller, Andrzej Pelc. [doi]
• The Synchronization Power (Consensus Number) of Access-Control Objects: the Case of AllowList and DenyListDavide Frey, Mathieu Gestin, Michel Raynal. [doi]
• Cordial Miners: Fast and Efficient Consensus for Every EventualityIdit Keidar, Oded Naor, Ouri Poupko, Ehud Shapiro. [doi]
• Durable Algorithms for Writable LL/SC and CAS with Dynamic JoiningPrasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti. [doi]
• Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic NetworksGiuseppe Antonio Di Luna, Giovanni Viglietta. [doi]
• On the Inherent Anonymity of GossipingRachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Pinot, Sasha Voitovych. [doi]
• Efficient Collaborative Tree Exploration with Breadth-First Depth-NextRomain Cosson, Laurent Massoulié, Laurent Viennot. [doi]
• Topological Characterization of Task Solvability in General Models of ComputationHagit Attiya, Armando Castañeda, Thomas Nowak. [doi]
• Brief Announcement: On Implementing Wear Leveling in Persistent Synchronization StructuresJakeb Chouinard, Kush Kansara, Xialin Liu, Nihal Potdar, Wojciech Golab. [doi]
• Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHPShir Cohen, Idit Keidar. [doi]
• Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed SystemsMathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal. [doi]
• Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity QueuesAnh Tran, Edward Talmage. [doi]
• Colordag: An Incentive-Compatible BlockchainIttai Abraham, Danny Dolev, Ittay Eyal, Joseph Y. Halpern. [doi]
• Brief Announcement: Distributed Derandomization RevisitedSameep Dahal, Francesco D'Amore 0001, Henrik Lievonen, Timothé Picavet, Jukka Suomela. [doi]
• Every Bit Counts in ConsensusPierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Manuel Vidigueira. [doi]
• A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-AgreementYannis Coutouly, Emmanuel Godard. [doi]
• Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-CommitHagit Attiya, Jennifer L. Welch. [doi]
• Fast Coloring Despite Congested RelaysMaxime Flin, Magnús M. Halldórsson, Alexandre Nolin. [doi]
• Network Agnostic Perfectly Secure MPC Against General AdversariesAnanya Appan, Anirudh Chandramouli, Ashish Choudhury. [doi]
• Quorum Subsumption for Heterogeneous Quorum SystemsXiao Li, Eric Chan, Mohsen Lesani. [doi]
• Brief Announcement: The Space Complexity of Set Agreement Using SwapSean Ovens. [doi]
• Modular Recoverable Mutual Exclusion Under System-Wide FailuresSahil Dhoked, Wojciech Golab, Neeraj Mittal. [doi]
• Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved MajorityEli Gafni, Giuliano Losa. [doi]
• Certified Round Complexity of Self-Stabilizing AlgorithmsKarine Altisen, Pierre Corbineau, Stéphane Devismes. [doi]
• Distributed Certification for Classes of Dense GraphsPierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca. [doi]
• Base Fee Manipulation in Ethereum's EIP-1559 Transaction Fee MechanismSarah Azouvi, Guy Goren, Lioba Heimbach, Alexander Hicks. [doi]
• Fast Reconfiguration for Programmable MatterIrina Kostitsyna, Tom Peters, Bettina Speckmann. [doi]
• Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel ComputationsMichael Chen, A. Pavan 0001, N. V. Vinodchandran. [doi]
• Conditionally Optimal Parallel Coloring of ForestsChristoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto. [doi]
• The FIDS Theorems: Tensions Between Multinode and Multicore Performance in Transactional SystemsNaama Ben-David, Gal Sela 0001, Adriana Szekeres. [doi]
• On the Node-Averaged Complexity of Locally Checkable Problems on TreesAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti, Gustav Schmid. [doi]
• Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility ResultsGadi Taubenfeld. [doi]
• Null Messages, Information and CoordinationRaïssa Nataf, Guy Goren, Yoram Moses. [doi]