Regular Papers

• Adaptive Snapshots Require Visible Reads
  Niv Sulimany, Tomer Cory, Erez Petrank
• FinWhale: an Optimally Resilient 2 Rounds Terminating DAG Protocol
  Razya Ladelsky, Roy Friedman
• Self-Stabilizing Algorithms in the Uniform Port Model
  Yuval Emek, Liam Brinker, Oren Louidor
• How to Walk a Dog in Parallel: on Parallel Computation of the Discrete Frechet Distance
  Leonid Barenboim, Arnold Filtser, Omrit Filtser, Orr Fischer
• Deterministic Edge Coloring with few Colors in CONGEST
  Tijn de Vos, Yannic Maus, Joakim Blikstad
• Optimality and Trade-offs in Fast Leaderless BFT SMR
  Neil Giridharan, Ittai Abraham, Natacha Crooks, Allen Clement, Pierre Sutra, Minh Tung Nguyen
• Solvability of Approximate Agreement on Graphs and Simplicial Complexes
  Joel Rybicki, Yaroslav Verbitsky
• Predictions Can Only Help! Communication Efficient Byzantine Agreement with Predictions
  Marc Dufay, Muhammad Ayaz Dzulfikar, Seth Gilbert
• Quadratic Asynchronous DKG from Plain Setup
  Ittai Abraham, Renas Bacho, Gilad Stern
• It Does Not Matter How You Define Locally Checkable Labelings
  Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela
• Lifeline: Optimal Validated Byzantine Agreement under Minimal Synchrony
  Yuval Efron, Ling Ren
• Efficient Randomized LL/SC that Preserves History Independence
  Dante Bencivenga, Homa Habashi, Philipp Woelfel
• Tight Energy Lower Bounds for Distributed Graph Algorithms
  Fabien Dufoulon, Gopal Pandurangan, Peter Robinson
• Is a LOCAL algorithm computable?
  Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela
• Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
  Malte Baumecker, Rustam Latypov, Yannic Maus, Jara Uitto
• eAID: Elastic Asynchronous Information Dispersal with Post-Dissemination Pruning
  Rithwik Kerur, Divyakant Agrawal, Dahlia Malkhi, Michael K. Reiter, Amit Wieder
• Efficient Stable Population Protocols for Parity and Beyond
  Leszek Gasieniec, Tytus Grodzicki, Tomasz Jurdzinski, Jakub Kowalski, Grzegorz Stachowiak
• Consensus with Stochastic Broadcast
  Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum
• Õptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs
  Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
• A Lock-Free Move-to-Front List with a Working Set Bound
  Shalom Asbell, Eric Ruppert
• Randomized Tree-Intersection Leader Election
  Yuval Emek, Shay Kutten, Ido Rafael, Gadi Taubenfeld
• The local complexity of certifying parity
  Nicolas Bousquet, Laurent Feuilloley, Jorge Valenzuela, Sébastien Zeitoun
• Fairness in the Wild: Secure Atomic Swap with External Incentives
  Hao Chung, Elisaweta Masserova, Elaine Shi, Sri AravindaKrishnan Thyagarajan
• Designing Local Distributed Mechanisms
  Juho Hirvonen, Sara Ranjbaran
• Fast Deterministic Distributed Degree Splitting
  Yannic Maus, Alexandre Nolin, Florian Schager
• Space-Efficient Lock-Free Linear-Probing Hash Table
  Hagit Attiya, Rotem Oshman, Noa Schiller
• Adaptive Self-Organization in Anonymous Dynamic Networks
  Garrett Parzych, Joshua Daymude
• Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties
  Chiara Piombi
• Triangle-Free Coloring in LOCAL via Resilient Lovász Local Lemma
  Peter Davies-Peck, Xusheng Zhang
• Near-optimal population protocols on bounded-degree trees
  Joel Rybicki, Jakob Solnerzik, Robin Vacus
• Non-Leaking Concurrent Objects
  Hagit Attiya, Rotem Oshman, Noa Schiller, Corentin Travers
• Wait-free Replicated Data Types and Fair Reconciliation
  Petr Kuznetsov, Maxence Perion, Sara Tucci-Piergiovanni
• Distributed Triangle and Simplex Enumeration in Hypergraphs
  Duncan Adamson, Will Rosenbaum, Paul Spirakis
• Counting in Population Protocols on Graphs
  Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Thorsten Götte, Lukas Hintze, Dominik Kaaser
• General Convex Agreement with Near-Optimal Communication
  Marc Dufay, Diana Ghinea, Anton Paramonov
• Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density
  Niccolò D’Archivio
• LCLs Beyond Bounded Degrees
  Gustav Schmid
• Fast and Robust Information Spreading in the Noisy PULL Model
  Niccolò D’Archivio, Amos Korman, Robin Vacus, Emanuele Natale
• Subcubic Coin Tossing in Asynchrony without PKI
  Mose Mizrahi, Roger Wattenhofer
• What can be computed in average anonymous networks?
  Joel Rybicki, Oleg Verbitsky, Maksim Zhukovskii
• Strong Efficiency Lower Bounds for Byzantine Agreement
  Matthieu Rambaud, Clément Ducros, Julian Loss
• Token Distribution Revisited
  Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Hamed Hosseinpour, Dominik Kaaser
• Multivalued Consensus: General Adversaries Require More Communication
  Mose Mizrahi, Roger Wattenhofer
• Fully Fluctuating Sleepy Consensus from Minimal Assumptions
  Javier Nieto, Yuval Efron, Joachim Neu, Ling Ren
• Symmetry all the way down
  Ignacio Amores-Sesar, Christian Cachin, Simon Holmgaard Kamp, Juan Villacis
• Fixed-Threshold Peeling in Sublinear MPC: Round-Approximation Tradeoffs and Applications
  Slobodan Mitrović, Theodore Pan, Wen-Horng Sheu
• AegisBFT: Fast, Responsive, Fork-Resistant Consensus with Speculation Accountability
  Mohammad Mussadiq Jalalzai, Kushal Babel, Jovan Jovan, Tobias Klenze, Sourav Das, Fatima Elsheimy, Mike Setrin, John Bergschneider, Babak Poorebrahim Gilkalaye
• Dynamic Graph Exploration: Semi-synchrony and Dynamic Port Labeling
  Ashish Saxena, Anisur Rahaman Molla, Kaushik Mondal, Gokarna Sharma
• Upper and Lower Bounds on the Space Complexity of Multi-word Single-Writer Registers
  Yuanhao Wei, Yousof Yavari
• A Fast Deterministic Algorithm for (Δ + 1)-Edge Coloring in CONGEST
  Sebastian Brandt, Ananth Narayanan, Alexandre Nolin
• Validity in Responsive Byzantine Agreement
  Diana Ghinea, Simon Holmgaard Kamp, Chen-Da Liu-Zhang
• Near-Tight Bounds on the Rate of Collective Communication
  Rotem Oshman, Tal Roth, Ofer Shayevitz, Anirudh Sivaraman
• Approximating Minimum Dominating Set with Few Awake Rounds
  Hongyan Ji, Shreyas Pai, Sriram Pemmaraju
• Weighted Beeping Networks
  Dariusz Kowalski, Miguel A. Mosteiro
• Brief Announcement: Fast Tendermint: Speeding Up a Foundational Consensus Protocol
  Preston Vander Vos, Daniel Cason
• Brief Announcement: Fast TetraBFT – Optimizing Latency Where It Matters
  Antonio J. Fernández-Pinto, Manuel Bravo, Gregory Chockler, Alexey Gotsman
• Brief Announcement: Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph
  Denis Korotchenko, Vitaly Aksenov
• Brief Announcement: Fair Binding for Hidden-State Authorization in Byzantine SMR
  Arnab Mallick
• Brief Announcement: Superlogarithmic Gap Result for LCLs on Trees in Quantum-LOCAL
  Francesco d’Amore, Henrik Lievonen
• Brief Announcement: The Minimal Commit Rule for DAG-based Atomic Broadcast
  Petr Kuznetsov, Maxence Perion, Sara Tucci-Piergiovanni
• Brief Announcement: How Complex Can Sequential Consistency Be?
  Dimitar Dimitrov
• Brief Announcement: Stone Duality Proofs for Colorless Distributed Computability Theorems
  Cameron Calk, Emmanuel Godard
• Brief Announcement: Simple and Fast Self-Stabilizing Dynamics for k-Winner-Take-All Computation
  Vincenzo Bonifaci, Fabio Galvan
• Brief Announcement: Optimal Adaptive Multi-Valued Byzantine Agreement
  Marc Dufay, Anton Paramonov, Roger Wattenhofer
• Brief Announcement: Liquid democracy under vote correlation: on the fallacies of averaging and the excluded middle
  Seth Gilbert, Stefan Schmid, Santiago Schnell, Jakub Svoboda, Michelle X. Yeo
• Brief Announcement: Initialization with Exponentially Fewer Bits
  Dominick Banasik, Varsha Dani, Thomas P. Hayes
• Brief Announcement: Simulations between Massively Parallel Computing and Distributed Computing
  Philipp Schneider, Julian Werthmann