DISC 2026 Accepted Papers

Regular Papers

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