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