Razya Ladelsky and Roy FriedmanFinWhale: An Optimally Resilient 2 Rounds Terminating DAG Protocol10.4230/LIPIcs.DISC.2026.2
Liam Brinker, Yuval Emek, and Oren LouidorSelf-Stabilizing Algorithms in the Uniform Port Model10.4230/LIPIcs.DISC.2026.3
Leonid Barenboim, Arnold Filtser, Omrit Filtser, and Orr FischerHow to Walk a Dog in Parallel: On Parallel Computation of the Discrete Fréchet Distance10.4230/LIPIcs.DISC.2026.4
Joakim Blikstad, Yannic Maus, and Tijn de VosDeterministic Edge Coloring with Few Colors in CONGEST10.4230/LIPIcs.DISC.2026.5
Neil Giridharan, Minh Tung Nguyen, Ittai Abraham, Allen Clement, Natacha Crooks, and Pierre SutraOptimality and Trade-Offs in Fast BFT SMR10.4230/LIPIcs.DISC.2026.6
Joel Rybicki and Yaroslav VerbitskySolvability of Approximate Agreement on Graphs and Simplicial Complexes10.4230/LIPIcs.DISC.2026.7
Marc Dufay, Muhammad Ayaz Dzulfikar, and Seth GilbertPredictions Can Only Help! Communication Efficient Byzantine Agreement with Predictions10.4230/LIPIcs.DISC.2026.8
Ittai Abraham, Renas Bacho, and Gilad SternQuadratic Asynchronous DKG from Plain Setup10.4230/LIPIcs.DISC.2026.9
Antonio Cruciani, Avinandan Das, Alesya Raevskaya, and Jukka SuomelaIt Does Not Matter How You Define Locally Checkable Labelings10.4230/LIPIcs.DISC.2026.10
Yuval Efron and Ling RenLifeline: Optimal Validated Byzantine Agreement Under Minimal Synchrony10.4230/LIPIcs.DISC.2026.11
Dante Bencivenga, Homa Habashi, and Philipp WoelfelEfficient Randomized LL/SC That Preserves History Independence10.4230/LIPIcs.DISC.2026.12
Fabien Dufoulon, Gopal Pandurangan, and Peter RobinsonTight Energy Lower Bounds for Distributed Graph Algorithms10.4230/LIPIcs.DISC.2026.13
Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, and Jukka SuomelaIs a LOCAL Algorithm Computable?10.4230/LIPIcs.DISC.2026.14
Malte Baumecker, Rustam Latypov, Yannic Maus, and Jara UittoNear-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity10.4230/LIPIcs.DISC.2026.15
Rithwik Kerur, Divyakant Agrawal, Dahlia Malkhi, Michael K. Reiter, and Amit WiedereAID: Elastic Asynchronous Information Dispersal with Post-Dissemination Pruning10.4230/LIPIcs.DISC.2026.16
Leszek Gąsieniec, Tytus Grodzicki, Tomasz Jurdziński, Jakub Kowalski, and Grzegorz StachowiakEfficient Stable Population Protocols for Parity and Beyond10.4230/LIPIcs.DISC.2026.17
Pierre Fraigniaud, Boaz Patt-Shamir, and Sergio RajsbaumConsensus with Stochastic Broadcast10.4230/LIPIcs.DISC.2026.18
Yaseen Abd-Elhaleem, Michal Dory, and Oren WeimannÕptimal Distributed Maximum Flow Approximation in Undirected Planar Graphs10.4230/LIPIcs.DISC.2026.19
Shalom Asbell and Eric RuppertA Lock-Free Move-To-Front List with a Working Set Bound10.4230/LIPIcs.DISC.2026.20
Yuval Emek, Shay Kutten, Ido Rafael, and Gadi TaubenfeldRandomized Tree-Intersection Leader Election10.4230/LIPIcs.DISC.2026.21
Nicolas Bousquet, Laurent Feuilloley, Jorge Valenzuela, and Sébastien ZeitounThe Local Complexity of Certifying Parity10.4230/LIPIcs.DISC.2026.22
Hao Chung, Elaine Shi, Sri AravindaKrishnan Thyagarajan, and Elisaweta MasserovaFairness in the Wild: Secure Atomic Swap with External Incentives10.4230/LIPIcs.DISC.2026.23
Petr Kuznetsov, Maxence Perion, and Sara Tucci-PiergiovanniWait-Free Replicated Data Types and Fair Reconciliation10.4230/LIPIcs.DISC.2026.32
Duncan Adamson, Will Rosenbaum, and Paul G. SpirakisDistributed Triangle and Simplex Enumeration in Hypergraphs10.4230/LIPIcs.DISC.2026.33
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Thorsten Götte, Lukas Hintze, and Dominik KaaserCounting in Population Protocols on Graphs10.4230/LIPIcs.DISC.2026.34
Marc Dufay, Diana Ghinea, and Anton ParamonovGeneral Convex Agreement with Near-Optimal Communication10.4230/LIPIcs.DISC.2026.35
Niccolò D'ArchivioConsensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density10.4230/LIPIcs.DISC.2026.36
Niccolò D'Archivio, Amos Korman, Emanuele Natale, and Robin VacusFast and Robust Information Spreading in the Noisy PULL Model10.4230/LIPIcs.DISC.2026.38
Mose Mizrahi and Roger WattenhoferSubcubic Coin Tossing in Asynchrony Without PKI10.4230/LIPIcs.DISC.2026.39
Joel Rybicki, Oleg Verbitsky, and Maksim ZhukovskiiWhat Can Be Computed in Average Anonymous Networks?10.4230/LIPIcs.DISC.2026.40
Clément Ducros, Julian Loss, and Matthieu RambaudStrong Efficiency Lower Bounds for Byzantine Agreement10.4230/LIPIcs.DISC.2026.41
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Hamed Hosseinpour, and Dominik KaaserToken Distribution Revisited10.4230/LIPIcs.DISC.2026.42
Mose Mizrahi and Roger WattenhoferMultivalued Consensus: General Adversaries Require More Communication10.4230/LIPIcs.DISC.2026.43
Javier Nieto, Yuval Efron, Joachim Neu, and Ling RenFully Fluctuating Sleepy Consensus from Minimal Assumptions10.4230/LIPIcs.DISC.2026.44
Ignacio Amores-Sesar, Christian Cachin, Simon Holmgaard Kamp, and Juan VillacisSymmetry All the Way Down10.4230/LIPIcs.DISC.2026.45
Slobodan Mitrović, Theodore Pan, and Wen-Horng SheuFixed-Threshold Peeling in Sublinear MPC: Round-Approximation Tradeoffs and Applications10.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 GilkalayeAccountable MonadBFT: Fast, Responsive, Fork-Resistant Consensus with Speculation Accountability10.4230/LIPIcs.DISC.2026.47
Ashish Saxena, Anisur Rahaman Molla, Kaushik Mondal, and Gokarna SharmaDynamic Graph Exploration: Semi-Synchrony and Dynamic Port Labeling10.4230/LIPIcs.DISC.2026.48
Yuanhao Wei and Yousof YavariUpper and Lower Bounds on the Space Complexity of Multi-Word Single-Writer Registers10.4230/LIPIcs.DISC.2026.49
Sebastian Brandt, Ananth Narayanan, and Alexandre NolinA Fast Deterministic Algorithm for (Δ + 1)-Edge Coloring in CONGEST10.4230/LIPIcs.DISC.2026.50
Diana Ghinea, Simon Holmgaard Kamp, and Chen-Da Liu-ZhangValidity in Responsive Byzantine Agreement10.4230/LIPIcs.DISC.2026.51
Rotem Oshman, Tal Roth, Ofer Shayevitz, and Anirudh SivaramanNear-Tight Bounds on the Rate of Collective Communication10.4230/LIPIcs.DISC.2026.52
Hongyan Ji, Shreyas Pai, and Sriram V. PemmarajuApproximating Minimum Dominating Set with Few Awake Rounds10.4230/LIPIcs.DISC.2026.53
Preston Vander Vos and Daniel CasonBrief Announcement: Fast Tendermint: Speeding up a Foundational Consensus Protocol10.4230/LIPIcs.DISC.2026.55
Antonio J. Fernández-Pinto, Manuel Bravo, Gregory Chockler, and Alexey GotsmanBrief Announcement: Fast TetraBFT – Optimizing Latency Where It Matters10.4230/LIPIcs.DISC.2026.56
Denis Korotchenko and Vitaly AksenovBrief Announcement: Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph10.4230/LIPIcs.DISC.2026.57
Arnab MallickBrief Announcement: Fair Binding for Hidden-State Authorization in Byzantine SMR10.4230/LIPIcs.DISC.2026.58
Francesco d'Amore and Henrik LievonenBrief Announcement: Superlogarithmic Gap Result for LCLs on Trees in Quantum-LOCAL10.4230/LIPIcs.DISC.2026.59
Cameron Calk and Emmanuel GodardBrief Announcement: Stone Duality Proofs for Colorless Distributed Computability Theorems10.4230/LIPIcs.DISC.2026.61
Vincenzo Bonifaci and Fabio GalvanBrief Announcement: Simple and Fast Self-Stabilizing Dynamics for k-Winner-Take-All Computation10.4230/LIPIcs.DISC.2026.62
Marc Dufay, Anton Paramonov, and Roger WattenhoferBrief Announcement: Optimal Adaptive Multi-Valued Byzantine Agreement10.4230/LIPIcs.DISC.2026.63
Seth Gilbert, Stefan Schmid, Santiago Schnell, Jakub Svoboda, and Michelle X. YeoBrief Announcement: Liquid Democracy Under Vote Correlation: On the Fallacies of Averaging and the Excluded Middle10.4230/LIPIcs.DISC.2026.64
Dominick Banasik, Varsha Dani, and Thomas P. HayesBrief Announcement: Initialization with Exponentially Fewer Bits10.4230/LIPIcs.DISC.2026.65
Philipp Schneider and Julian WerthmannBrief Announcement: Simulations Between Massively Parallel Computing and Distributed Computing10.4230/LIPIcs.DISC.2026.66