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