Table of Contents

• Keynote: Disaggregated Memory and the Revival of Memory ResearchMarcos K. Aguilera. 1 [doi]
• Keynote: Examples of Mantras as a Beacon in Guiding ResearchEli Gafni. 2 [doi]
• Byzantine Agreement with PredictionsNaama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Seth Gilbert. 3-14 [doi]
• Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine AgreementPierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira. 15-27 [doi]
• Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected TimeIttai Abraham, Eli Chouatt, Yossi Gilad, Gilad Stern, Sophia Yakoubov. 28-38 [doi]
• Communication-Optimal Convex AgreementDiana Ghinea, Chen-Da Liu Zhang, Roger Wattenhofer. 39-49 [doi]
• Brief Announcement: Extending Asynchronous Byzantine Agreement with Crusader AgreementMose Mizrahi Erbes, Roger Wattenhofer. 50-53 [doi]
• Brief Announcement: Towards Round-Optimal Approximate Agreement on TreesMarc Fuchs, Diana Ghinea, Zahra Parsaeian. 54-57 [doi]
• Brief Announcement: Revisiting Lower Bounds for Two-Step ConsensusFedor Ryabinin, Alexey Gotsman, Pierre Sutra. 58-61 [doi]
• Brief Announcement: Optimal Construction of Unique Identifiers from Bounded RegistersMichael Anoprenko, Petr Kuznetsov, Vitaly Aksenov. 62-65 [doi]
• Towards Optimal Deterministic LOCAL Algorithms on TreesSebastian Brandt 0002, Ananth Narayanan. 66-76 [doi]
• Local Constant Approximation for Dominating Set on Graphs Excluding Large MinorsMarthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek. 77-87 [doi]
• Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphsMalte Baumecker, Yannic Maus, Jara Uitto. 88-98 [doi]
• Optimal Local Certification on Graphs of Bounded PathwidthDan Alden Baterisna, Yi-Jun Chang. 99-109 [doi]
• A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphsLinda Cook, Eun Jung Kim 0002, Tomás Masarík. 110-120 [doi]
• Perfectly-secure Network-agnostic MPC with Optimal ResiliencyShravani Patil, Arpita Patra. 121-130 [doi]
• Model Checking and Synthesis for Optimal Use of Knowledge in Consensus ProtocolsKaya Alpturer, Gerald Huang, Ron van der Meyden. 131-140 [doi]
• You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processesXing Hu 0009, Sam Toueg. 141-150 [doi]
• DAG-based Consensus with Asymmetric TrustIgnacio Amores-Sesar, Christian Cachin, Juan Villacis, Luca Zanolini. 151-161 [doi]
• Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-SharingDaniel Escudero 0001, Elisaweta Masserova, Antigoni Polychroniadou. 162-165 [doi]
• Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority SettingsJohn Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg. 166-168 [doi]
• Brief Announcement: Fast and Gas-efficient Private Sealed-bid AuctionsJonas Ballweg, Amir Kafshdar Goharshady, Zhaorun Lin. 169-172 [doi]
• Improved Byzantine Agreement under an Adaptive AdversaryFabien Dufoulon, Gopal Pandurangan. 173-180 [doi]
• Byzantine Stable MatchingAndrei Constantinescu 0001, Marc Dufay, Diana Ghinea, Roger Wattenhofer. 181-191 [doi]
• On Interplanetary and Relativistic Distributed ComputingSiddhartha Visveswara Jayanti. 192-202 [doi]
• Brief Announcement: Stranger-Free TasksEli Gafni, Giuliano Losa, Michel Raynal, Gadi Taubenfeld. 203-206 [doi]
• 3-Majority and 2-Choices with Many OpinionsNobutaka Shimizu, Takeharu Shiraga. 207-217 [doi]
• Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed SystemsArmando Castañeda, Gilde Valeria Rodríguez. 218-229 [doi]
• Quantum Communication Advantage for Leader Election and AgreementFabien Dufoulon, Frédéric Magniez, Gopal Pandurangan. 230-240 [doi]
• When is liquid democracy possible?: On the manipulation of varianceKrishnendu Chatterjee, Seth Gilbert, Stefan Schmid 0001, Jakub Svoboda, Michelle Yeo. 241-251 [doi]
• Brief Announcement: Using Detectability to Simplify the Design of Concurrent Algorithms for Persistent MemoryAhmed Fahmy, Wojciech Golab, Neeraj Mittal. 252-255 [doi]
• Brief Announcement: Self-Stabilizing Recoverable Mutual ExclusionWojciech Golab, Elad Michael Schiller. 256-259 [doi]
• Brief Announcement: Fast Atomic Snapshot and Asynchronous LatencyJoão Paulo Bezerra, Petr Kuznetsov, Luciano Freitas de Souza. 260-263 [doi]
• Brief Announcement: Robust and Scalable Renaming with Subquadratic BitsSirui Bai, Xinyu Fu 0009, Yuheng Wang, Yuyi Wang 0001, Chaodong Zheng. 264-267 [doi]
• Deterministic Distributed DFS via Cycle Separators in Planar GraphsBenjamin Jauregui, Pedro Montealegre 0001, Ivan Rapaport. 268-277 [doi]
• Distributed Maximum Flow in Planar GraphsYaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann. 278-286 [doi]
• Optimal Distributed Replacement PathsYi-Jun Chang, Yanyu Chen, Dipan Dey, Gopinath Mishra, Hung Thuan Nguyen, Bryce Sanchez. 287-298 [doi]
• Message Optimality and Message-Time Trade-offs for APSP and BeyondFabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson 0002. 299-309 [doi]
• Brief Announcement: Deciding FO Formulas Efficiently in Congested NetworksFedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca. 310-313 [doi]
• Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph FindingYi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, Mingyang Yang. 314-317 [doi]
• Brief Announcement: Towards Optimal Distributed Delta ColoringManuel Jakob, Yannic Maus. 318-321 [doi]
• Brief Announcement: Distributed Graph Algorithms with PredictionsJoan Boyar, Faith Ellen, Kim S. Larsen. 322-325 [doi]
• All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For FreeOrr Fischer, Merav Parter. 326-336 [doi]
• Sublinear-Time Sampling of Spanning Trees in the Congested CliqueSriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel. 337-348 [doi]
• Density-Dependent Graph Orientation and Coloring in Scalable MPCMohsen Ghaffari 0001, Christoph Grunau. 349-359 [doi]
• Round and Communication Efficient Graph ColoringYi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Farrel D. Salim. 360-371 [doi]
• Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid themClément L. Canonne, Yun Li, Seeun William Umboh. 372-374 [doi]
• Brief Announcement: New Distributed Interactive Proofs for Planarity: A Matter of Left and RightYuval Gil, Merav Parter. 375-378 [doi]
• Brief Announcement: Strong and Hiding Distributed Certification of $k$-ColoringAugusto Modanese, Pedro Montealegre 0001, Martín Ríos Wilson. 379-382 [doi]
• Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarmCyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Taïssir Marcé. 383-393 [doi]
• Decentralized Distributed Graph Coloring: Cluster GraphsMaxime Flin, Magnús M. Halldórsson, Alexandre Nolin. 394-405 [doi]
• Minimalist Leader Election Under Weak CommunicationRobin Vacus, Isabella Ziccardi. 406-416 [doi]
• Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy CostAlkida Balliu, Pierre Fraigniaud, Dennis Olivetti, Mikaël Rabie. 417-427 [doi]
• Brief Announcement: Towards Energy-Efficient Distributed AgreementHugo Mirault, Peter Robinson 0002. 428-431 [doi]
• Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio NetworksDominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, Gopal Pandurangan. 432-435 [doi]
• Brief Announcement: Optimal Deterministic Rendezvous in Labeled LinesYann Bourreau, Ananth Narayanan, Alexandre Nolin. 436-439 [doi]
• Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-upPeter Robinson 0002, Ming Ming Tan. 440-443 [doi]
• Tight Bounds on Channel Reliability via Generalized Quorum SystemsAlejandro Naser-Pastoriza, Gregory V. Chockler, Alexey Gotsman, Fedor Ryabinin. 444-454 [doi]
• Auditing without Leaks Despite CuriosityHagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, Corentin Travers. 455-465 [doi]
• A Shared Archive of SnapshotsPrasad Jayanti, Siddhartha Visveswara Jayanti. 466-476 [doi]
• An Exact Characterization of the Two-shot Deterministic Objects Solving Two-process ConsensusMinh-Tung Nguyen, Pierre Sutra. 477-487 [doi]
• Solvability Characterization for General Three-Process TasksHagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum. 488-498 [doi]
• Clock Distribution with Gradient TRIXShreyas Srinivas, Christoph Lenzen 0001. 499-509 [doi]
• Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population ProtocolsLeszek Gasieniec, Tytus Grodzicki, Grzegorz Stachowiak. 510-520 [doi]
• A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population ProtocolsHenry Austin, Petra Berenbrink, Tom Friedetzky, Thorsten Götte, Lukas Hintze. 521-531 [doi]
• An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol ModelAntoine El-Hayek, Robert Elsässer, Stefan Schmid 0001. 532-540 [doi]
• Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to EscapeHenry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan. 541-544 [doi]
• Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL ModelNiccolò D'Archivio, Amos Korman, Emanuele Natale, Robin Vacus. 545-548 [doi]
• Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population ProtocolsTom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid 0001. 549-552 [doi]