Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
A. Balliu, P. Fraigniaud, D. Olivetti, M. Rabie<\/p>\n\n\n\n
Perfectly-secure Network-agnostic MPC with Optimal Resiliency
S. Patil, A. Patra<\/p>\n\n\n\n
Density-Dependent Graph Orientation and Coloring in Scalable MPC
M. Ghaffari, C. Grunau<\/p>\n\n\n\n
Optimal Local Certification on Graphs of Bounded Pathwidth
D. Baterisna, Y. Chang<\/p>\n\n\n\n
An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
A. El-Hayek, R. Els\u00e4sser, S. Schmid<\/p>\n\n\n\n
Message Optimality and Message-Time Trade-offs for APSP and Beyond
F. Dufoulon, S. Pai, G. Pandurangan, S. Pemmaraju, P. Robinson<\/p>\n\n\n\n
Round and Communication Efficient Graph Coloring
Y. Chang, G. Mishra, H. Nguyen, F. Salim<\/p>\n\n\n\n
Quantum Communication Advantage for Leader Election and Agreement
F. Dufoulon, F. Magniez, G. Pandurangan<\/p>\n\n\n\n
Sublinear-time Sampling of Spanning Trees in the Congested Clique
S. Pemmaraju, S. Roy, J. Sobel<\/p>\n\n\n\n
3-Majority and 2-Choices with Many Opinions
N. Shimizu, T. Shiraga<\/p>\n\n\n\n
Optimal Distributed Replacement Paths
Y. Chang, Y. Chen, D. Dey, G. Mishra, H. Nguyen, B. Sanchez<\/p>\n\n\n\n
Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems
A. Casta\u00f1eda, G. Rodr\u00edguez<\/p>\n\n\n\n
Auditing without Leaks Despite Curiosity
H. Attiya, A. Anta, A. Milani, A. Rapetti, C. Travers<\/p>\n\n\n\n
Byzantine Agreement with Predictions
N. Ben-David, M. Dzulfikar, F. Ellen, S. Gilbert<\/p>\n\n\n\n
Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement
P. Civit, M. Dzulfikar, S. Gilbert, R. Guerraoui, J. Komatovic, M. Vidigueira<\/p>\n\n\n\n
Distributed Maximum Flow in Planar Graphs
Y. Abd-Elhaleem, M. Dory, M. Parter, O. Weimann<\/p>\n\n\n\n
Clock Distribution with Gradient TRIX
S. Srinivas, C. Lenzen<\/p>\n\n\n\n
Byzantine Stable Matching
A. Constantinescu, M. Dufay, D. Ghinea, R. Wattenhofer<\/p>\n\n\n\n
DAG-based Consensus with Asymmetric Trust
I. Amores-Sesar, C. Cachin, J. Villacis, L. Zanolini<\/p>\n\n\n\n
Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
L. Gasieniec, T. Grodzicki, G. Stachowiak<\/p>\n\n\n\n
Tight Bounds on Channel Reliability via Generalized Quorum Systems
A. Naser-Pastoriza, G. Chockler, A. Gotsman, F. Ryabinin<\/p>\n\n\n\n
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
M. Bonamy, C. Gavoille, T. Picavet, A. Wesolek<\/p>\n\n\n\n
Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time
I. Abraham, E. Chouatt, Y. Gilad, G. Stern, S. Yakoubov<\/p>\n\n\n\n
An Exact Characterization of the Two-shot Deterministic Objects Solving Two-process Consensus
M. Nguyen, P. Sutra<\/p>\n\n\n\n
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
O. Fischer, M. Parter<\/p>\n\n\n\n
Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm
C. Gavoille, N. Hanusse, G. Le Bouder, T. Marc\u00e9<\/p>\n\n\n\n
A Shared Archive of Snapshots
P. Jayanti, S. Jayanti<\/p>\n\n\n\n
When is liquid democracy possible? On the manipulation of variance
K. Chatterjee, S. Gilbert, S. Schmid, J. Svoboda, M. Yeo<\/p>\n\n\n\n
Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs
M. Baumecker, Y. Maus, J. Uitto<\/p>\n\n\n\n
Solvability Characterization for General Three-Process Tasks
H. Attiya, P. Fraigniaud, A. Paz, S. Rajsbaum<\/p>\n\n\n\n
Decentralized Distributed Graph Coloring: Cluster Graphs
M. Flin, M. Halld\u00f3rsson, A. Nolin<\/p>\n\n\n\n
You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processes
X. HU, S. Toueg<\/p>\n\n\n\n
Communication-Optimal Convex Agreement
D. Ghinea, C. Liu-Zhang, R. Wattenhofer<\/p>\n\n\n\n
Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols
K. Alpturer, G. Huang, R. van der Meyden<\/p>\n\n\n\n
Improved Byzantine Agreement under an Adaptive Adversary
F. Dufoulon, G. Pandurangan<\/p>\n\n\n\n
A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
H. Austin, P. Berenbrink, T. Friedetzky, T. G\u00f6tte, L. Hintze<\/p>\n\n\n\n
Deterministic Distributed DFS via Cycle Separators in Planar Graphs
B. Jauregui, P. Montealegre, I. Rapaport<\/p>\n\n\n\n
Minimalist Leader Election Under Weak Communication
R. Vacus, I. Ziccardi<\/p>\n\n\n\n
A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs
L. Cook, E. Kim, T. Masa\u0159\u00edk<\/p>\n\n\n\n
A Relationship between Relativistic and Classical Distributed Computation
S. Jayanti<\/p>\n\n\n\n
Towards Optimal Deterministic LOCAL Algorithms on Trees
S. Brandt, A. Narayanan<\/p>\n\n\n\n
Brief Announcement: Efficient Extensions for Asynchronous Byzantine Agreement via Weak Agreement
M. Mizrahi Erbes, R. Wattenhofer<\/p>\n\n\n\n
Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up
P. Robinson, M. Tan<\/p>\n\n\n\n
Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks
F. Fomin, P. Fraigniaud, P. Golovach, P. Montealegre, I. Rapaport, I. Todinca<\/p>\n\n\n\n
Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
T. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid<\/p>\n\n\n\n
Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
C. Canonne, Y. Li, S. Umboh<\/p>\n\n\n\n
Brief Announcement: Using Detectability to Simplify the Design of Concurrent Algorithms for Persistent Memory
A. Fahmy, W. Golab, N. Mittal<\/p>\n\n\n\n
Brief Announcement: Towards Optimal Distributed Delta Coloring
M. Jakob, Y. Maus<\/p>\n\n\n\n
Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding
Y. Chang, L. Chen, Y. Chen, G. Mishra, M. Yang<\/p>\n\n\n\n
Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape
H. Austin, M. Gadouleau, G. Mertzios, A. Trehan<\/p>\n\n\n\n
Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings
J. Augustine, S. Chatterjee, V. King, M. Kumar, S. Meir, D. Peleg<\/p>\n\n\n\n
Brief Announcement: Distributed Graph Algorithms with Predictions
J. Boyar, F. Ellen, K. Larsen<\/p>\n\n\n\n
Brief Announcement: Fast and Gas-efficient Private Sealed-bid Auctions
J. Ballweg, A. Goharshady, Z. Lin<\/p>\n\n\n\n
Brief Announcement: New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
Y. Gil, M. Parter<\/p>\n\n\n\n
Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines
Y. Bourreau, A. Narayanan, A. Nolin<\/p>\n\n\n\n
Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers
M. Anoprenko, P. Kuznetsov, V. Aksenov<\/p>\n\n\n\n
Brief Announcement: Fast Atomic Snapshot and Asynchronous Latency
J. Bezerra, P. Kuznetsov, L. de Souza<\/p>\n\n\n\n
Brief Announcement: Revisiting Lower Bounds for Two-Step Consensus
F. Ryabinin, A. Gotsman, P. Sutra<\/p>\n\n\n\n
Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL Model
N. D’Archivio, E. Natale, A. Korman, R. Vacus<\/p>\n\n\n\n
Brief Announcement: Stranger-Free Tasks
E. Gafni, G. Losa, M. Raynal, G. Taubenfeld<\/p>\n\n\n\n
Brief Announcement: Strong and Hiding Distributed Certification of $k$-Coloring
A. Modanese, P. Montealegre, M. R\u00edos-Wilson<\/p>\n\n\n\n
Brief Announcement: Towards Energy-Efficient Distributed Agreement
H. Mirault, P. Robinson<\/p>\n\n\n\n
Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees
M. Fuchs, D. Ghinea, Z. Parsaeian<\/p>\n\n\n\n
Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing
D. Escudero, E. Masserova, A. Polychroniadou<\/p>\n\n\n\n
Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks
D. Banasik, V. Dani, F. Dufoulon, A. Gupta, T. Hayes, G. Pandurangan<\/p>\n\n\n\n
Brief Announcement: Robust and Scalable Renaming with Subquadratic Bits
S. Bai, X. Fu, Y. Wang, Y. Wang, C. Zheng<\/p>\n\n\n\n
Brief Announcement: Self-Stabilizing Recoverable Mutual Exclusion
W. Golab, E. Schiller<\/p>\n","protected":false},"excerpt":{"rendered":"
Full papers Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy CostA. Balliu, P. Fraigniaud, D. Olivetti, M. Rabie Perfectly-secure Network-agnostic MPC with Optimal ResiliencyS. Patil, A. Patra Density-Dependent Graph Orientation and Coloring in Scalable MPCM. Ghaffari, C. Grunau Optimal Local Certification on Graphs of Bounded PathwidthD. Baterisna, Y. Chang An Almost Tight Lower Bound for … Continue reading “List of Accepted Papers”<\/span><\/a><\/p>\n","protected":false},"author":27,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-343","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/pages\/343","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/users\/27"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/comments?post=343"}],"version-history":[{"count":4,"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/pages\/343\/revisions"}],"predecessor-version":[{"id":348,"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/pages\/343\/revisions\/348"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2025\/wp-json\/wp\/v2\/media?parent=343"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}