


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

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.