Full Papers
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
P. Fraigniaud, M. Luce, F. Magniez, I. Todinca
Game Dynamics and Equilibrium Computation in the Population Protocol Model
D. Alistarh, K. Chatterjee, M. Karrabi, J. Lazarsfeld
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
K. Chatterjee, A. Ebrahim-Zadeh, M. Karrabi, K. Pietrzak, M. Yeo, Đ. Žikelić
Streaming Graph Algorithms in the Massively Parallel Computation Model
A. Czumaj, G. Mishra, A. Mukherjee
Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive Consistency
H. Feng, Z. Lu, Q. Tang
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
A. Balliu, S. Brandt, F. Kuhn, D. Olivetti, G. Schmid
A LOCAL View of the Polynomial Hierarchy
F. Reiter
Determining Recoverable Consensus Numbers
S. Ovens
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
A. Padalkin, C. Scheideler
Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows
M. Ferreira, N. Atre, J. Sherry, J. Sobrinho
On Self-stabilizing Leader Election in Directed Networks
K. Altisen, A. Cournier, G. Defalque, S. Devismes
Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
L. Zanolini, F. D’Amato, G. Losa
All Byzantine Agreement Problems are Expensive
P. Civit, S. Gilbert, R. Guerraoui, J. Komatovic, A. Paramonov, M. Vidigueira
TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
Q. Yu, G. Losa, X. Wang
Lumiere: Making Optimal BFT for Partial Synchrony Practical
A. Lewis-Pye, D. Malkhi, O. Naor, K. Nayak
On the Power of Quantum Distributed Proofs
A. Hasegawa, S. Kundu, H. Nishimura
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
C. Delporte-Gallet, H. Fauconnier, P. Fraigniaud, S. Rajsbaum, C. Travers
Strong Linearizability using Primitives with Consensus Number 2
H. Attiya, A. Castaneda, C. Enea
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
Y. Chang, O. Hecht, D. Leitersdorf, P. Schneider
DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication
P. Civit, M. Dzulfikar, S. Gilbert, R. Guerraoui, J. Komatovic, M. Vidigueira
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
Y. Chang, G. Mishra, H. Nguyen, M. Yang, Y. Yeh
Multi-Party Set Disjointness and Intersection with Bounded Dependence
M. Braverman, R. Oshman, T. Roth
(Δ+1)-Vertex Coloring in O(n) Communication
M. Flin, P. Mittal
Deterministic Expander Routing: Faster and More Versatile
Y. Chang, S. Huang, H. Su
Tight Lower Bounds in the Supported LOCAL Model
A. Balliu, T. Boudier, S. Brandt, D. Olivetti
Swiper: a new paradigm for efficient weighted distributed protocols
A. Tonkikh, L. Freitas
Strongly Linearizable LL/SC
F. Naderi Semiromi, P. Woelfel
Computing Minimum Weight Cycle in the CONGEST Model
V. Manoharan, V. Ramachandran
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient
C. Johnen, S. Devismes, F. Mazoit, D. Ilcinkas
Improved All-Pairs Approximate Shortest Paths in Congested Clique
H. Bui, S. Chandra, Y. Chang, M. Dory, D. Leitersdorf
System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models
S. Jacobs, M. Tanaka, C. Zhang, M. Zhang, R. Aminadabi, S. Song, S. Rajbhandari, Y. He
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
M. Bender, J. Fineman, S. Gilbert, J. Kuszmaul, M. Young
Probabilistic Byzantine Fault Tolerance
D. Avelas, H. Heydari, T. Distler, E. Alchieri, A. Bessani
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
M. Ghaffari, A. Trygub
History-Independent Concurrent Objects
H. Attiya, M. Bender, M. Farach-Colton, R. Oshman, N. Schiller
On the Communication Complexity of Secure Multi-Party Computation With Aborts
J. Bartusek, T. Bergamaschi, S. Khoury, S. Mutreja, O. Paradise
The Fractional Spending Problem: Executing Payment transactions in parallel with less than f+1 validations
R. Bazzi, S. Tucci-Piergiovanni
An Efficient RMWable Snapshot Algorithm
P. Jayanti, S. Jayanti, S. Jayanti
Adaptive Massively Parallel Coloring in Sparse Graphs
R. Latypov, Y. Maus, S. Pai, J. Uitto
Majority consensus thresholds in competitive Lotka-Volterra populations
M. Függer, T. Nowak, J. Rybicki
Dynamic Size Counting in the Population Protocol Model
D. Kaaser, M. Lohmann
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?
M. Hajiaghayi, D. Kowalski, J. Olkowski
Faster Randomized Repeated Choice and DCAS
D. Bencivenga, G. Giakkoupis, P. Woelfel
Brief announcements
Brief Announcement: Global certification via perfect hashing
N. Bousquet, L. Feuilloley, S. Zeitoun
Communication-Optimal Convex Agreement
D. Ghinea, C. Liu-Zhang, R. Wattenhofer
Know Your Audience
B. Charron-Bost, P. Lambein-Monette
Content-Oblivious Leader Election on Rings
F. Frei, R. Gelles, A. Ghazy, A. Nolin
A Case for Byzantine Robustness Against Data Poisoning
S. Farhadkhani, R. Guerraoui, N. Gupta, R. Pinot
Local Advice and Local Decompression
A. Balliu, S. Brandt, F. Kuhn, K. Nowicki, D. Olivetti, E. Rotenberg, J. Suomela
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
M. Fuchs, F. Kuhn
Self-Stabilizing MIS Computation in the Beeping Model
G. Giakkoupis, V. Turau, I. Ziccardi
On the Limits of Information Spread by Memory-less Agents
N. D’Archivio, R. Vacus
Improved Massively Parallel Triangle Counting in O(1) Rounds
Q. Liu, C. Seshadhri
Low-Distortion Clustering in Bounded Growth Graphs
Y. Chang, V. Dani, T. Hayes
Randomized Consensus: Common Coins Are not the Holy Grail!
A. Mostefaoui, M. Perrin, J. Weibel
Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks
A. Luchsinger, D. Doty, D. Soloveichik
Brief Announcement: Fair Ordering via Streaming Social Choice Theory
G. Ramseyer, A. Goel
Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model
G. Losa, E. Gafni
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth
F. Fomin, P. Fraigniaud, P. Montealegre, I. Rapaport, I. Todinca
Brief Announcement: Musketeer: Incentive-Compatible Rebalancing for Payment Channel Networks
Z. Avarikioti, S. Schmid, S. Tiwari
Brief Announcement. Massively Parallel Ruling Set Made Deterministic
J. Giliberti, Z. Parsaeian
Brief Announcement: No Broadcast Abstraction Captures k-Set-Agreement
S. Gay, A. Mostefaoui, M. Perrin