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