Abstract is missing.
- Keynote: Time is not a Healer: Before and AfterNicola Santoro. 1 [doi]
- Keynote: Provable Slashing GuaranteesTim Roughgarden. 2 [doi]
- Determining Recoverable Consensus NumbersSean Ovens. 3-13 [doi]
- History-Independent Concurrent ObjectsHagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller. 14-24 [doi]
- MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-MemoryPrasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti. 25-35 [doi]
- Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail!Achour Mostéfaoui, Matthieu Perrin, Julien Weibel. 36-39 [doi]
- Game Dynamics and Equilibrium Computation in the Population Protocol ModelDan Alistarh, Krishnendu Chatterjee, Mehrdad Karrabi, John Lazarsfeld. 40-49 [doi]
- Dynamic Size Counting in the Population Protocol ModelDominik Kaaser, Maximilian Lohmann. 50-60 [doi]
- Brief Announcement: Optimally Encoding Information in Chemical Reaction NetworksAustin Luchsinger, David Doty, David Soloveichik. 61-64 [doi]
- Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable MatterAndreas Padalkin, Christian Scheideler. 65-75 [doi]
- Majority Consensus Thresholds in Competitive Lotka-Volterra PopulationsMatthias Függer, Thomas Nowak, Joel Rybicki. 76-86 [doi]
- Brief Announcement: Self-Stabilizing MIS Computation in the Beeping ModelGeorge Giakkoupis, Volker Turau, Isabella Ziccardi. 87-90 [doi]
- Brief Announcement: On the Limits of Information Spread by Memory-less AgentsNiccolò D'Archivio, Robin Vacus. 91-94 [doi]
- Tight Lower Bounds in the Supported LOCAL ModelAlkida Balliu, Thomas Boudier, Sebastian Brandt 0002, Dennis Olivetti. 95-105 [doi]
- A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL ModelYi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Mingyang Yang, Yu-Cheng Yeh. 106-116 [doi]
- Brief Announcement: Local Advice and Local DecompressionAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Krzysztof Nowicki 0002, Dennis Olivetti, Eva Rotenberg, Jukka Suomela. 117-120 [doi]
- System Optimizations for Enabling Training of Extreme Long Sequence Transformer ModelsSam Ade Jacobs, Masahiro Tanaka, Chengming Zhang 0006, Minjia Zhang, Reza Yazdani Aminadabi, Shuaiwen Leon Song, Samyam Rajbhandari, Yuxiong He. 121-130 [doi]
- Brief Announcement: A Case for Byzantine Machine LearningSadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta, Rafael Pinot. 131-134 [doi]
- Lumiere: Making Optimal BFT for Partial Synchrony PracticalAndrew Lewis-Pye, Dahlia Malkhi, Oded Naor, Kartik Nayak. 135-144 [doi]
- DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive CommunicationPierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira. 145-156 [doi]
- All Byzantine Agreement Problems Are ExpensivePierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Anton Paramonov, Manuel Vidigueira. 157-169 [doi]
- Probabilistic Byzantine Fault ToleranceDiogo Avelas, Hasan Heydari, Eduardo Alchieri, Tobias Distler, Alysson Bessani. 170-181 [doi]
- Computing Minimum Weight Cycle in the CONGEST ModelVignesh Manoharan, Vijaya Ramachandran. 182-193 [doi]
- Deterministic Expander Routing: Faster and More VersatileYi-Jun Chang, Shang-En Huang, Hsin-Hao Su. 194-204 [doi]
- Brief Announcement: Distributed Model Checking on Graphs of Bounded TreedepthFedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca. 205-208 [doi]
- Even-Cycle Detection in the Randomized and Quantum CONGEST ModelPierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca. 209-219 [doi]
- On the Power of Quantum Distributed ProofsAtsuya Hasegawa, Srijita Kundu, Harumichi Nishimura. 220-230 [doi]
- Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention ResolutionMichael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young. 231-242 [doi]
- Brief Announcement: Know Your Audience: Communication model and computability in anonymous networksBernadette Charron-Bost, Patrick Lambein-Monette. 243-246 [doi]
- Asynchrony-Resilient Sleepy Total-Order Broadcast ProtocolsFrancesco D'Amato, Giuliano Losa, Luca Zanolini. 247-256 [doi]
- TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT ConsensusQianyu Yu, Giuliano Losa, Xuechao Wang. 257-267 [doi]
- Fully Automated Selfish Mining Analysis in Efficient Proof Systems BlockchainsKrishnendu Chatterjee, Amirali Ebrahim-Zadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic. 268-278 [doi]
- Brief Announcement: Fair Ordering via Streaming Social Choice TheoryGeoffrey Ramseyer, Ashish Goel. 279-282 [doi]
- Swiper: a new paradigm for efficient weighted distributed protocolsAndrei Tonkikh, Luciano Freitas de Souza. 283-294 [doi]
- f+1 validationsRida A. Bazzi, Sara Tucci Piergiovanni. 295-305 [doi]
- Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel NetworksZeta Avarikioti, Stefan Schmid 0001, Samarth Tiwari. 306-309 [doi]
- The Computational Power of Distributed Shared-Memory Models with Bounded-Size RegistersCarole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers. 310-320 [doi]
- Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?Mohammad Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski. 321-331 [doi]
- Multi-Party Set Disjointness and Intersection with Bounded DependenceMark Braverman, Rotem Oshman, Tal Roth. 332-342 [doi]
- Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing SystemsSylvain Gay, Achour Mostéfaoui, Matthieu Perrin. 343-346 [doi]
- A LOCAL View of the Polynomial HierarchyFabian Reiter. 347-357 [doi]
- Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable FlowsMiguel Alves Ferreira, Nirav Atre, Justine Sherry, João Luis Sobrinho. 358-368 [doi]
- Completing the Node-Averaged Complexity Landscape of LCLs on TreesAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti, Gustav Schmid. 369-379 [doi]
- Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed ModelYi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider. 380-390 [doi]
- Improved All-Pairs Approximate Shortest Paths in Congested CliqueHong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf. 391-400 [doi]
- A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSPMohsen Ghaffari 0001, Anton Trygub. 401-411 [doi]
- Brief Announcement: Low-Distortion Clustering in Bounded Growth GraphsYi-Jun Chang, Varsha Dani, Thomas P. Hayes. 412-415 [doi]
- n) CommunicationMaxime Flin, Parth Mittal. 416-424 [doi]
- Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring AlgorithmsMarc Fuchs, Fabian Kuhn. 425-428 [doi]
- Brief Announcement: Global certification via perfect hashingNicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun. 429-431 [doi]
- Strong Linearizability using Primitives with Consensus Number 2Hagit Attiya, Armando Castañeda, Constantin Enea. 432-442 [doi]
- Strongly Linearizable LL/SC from CASFatemeh Naderi-Semiromi, Philipp Woelfel. 443-453 [doi]
- Faster Randomized Repeated Choice and DCASDante Bencivenga, George Giakkoupis, Philipp Woelfel. 454-464 [doi]
- Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory ModelGiuliano Losa, Eli Gafni. 465-468 [doi]
- Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive ConsistencyHanwen Feng 0001, Zhenliang Lu, Qiang Tang 0005. 469-479 [doi]
- On the Communication Complexity of Secure Multi-Party Computation With AbortsJames Bartusek, Thiago Bergamaschi, Seri Khoury, Saachi Mutreja, Orr Paradise. 480-491 [doi]
- Brief Announcement: Communication-Optimal Convex AgreementDiana Ghinea, Chen-Da Liu Zhang, Roger Wattenhofer. 492-495 [doi]
- Streaming Graph Algorithms in the Massively Parallel Computation ModelArtur Czumaj, Gopinath Mishra, Anish Mukherjee 0001. 496-507 [doi]
- Adaptive Massively Parallel Coloring in Sparse GraphsRustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto. 508-518 [doi]
- Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) RoundsQuanquan C. Liu, C. Seshadhri 0001. 519-522 [doi]
- Brief Announcement: Massively Parallel Ruling Set Made DeterministicJeff Giliberti, Zahra Parsaeian. 523-526 [doi]
- On Self-stabilizing Leader Election in Directed NetworksKarine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes. 527-537 [doi]
- Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficientColette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas. 538-548 [doi]
- Brief Announcement: Content-Oblivious Leader Election on RingsFabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin. 549-552 [doi]