{"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":"2025-09-16T20:52:16","modified_gmt":"2025-09-16T20:52:16","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/www.disc-conference.org\/wp\/disc2025\/accepted-papers\/","title":{"rendered":"DISC 2025 Accepted Papers"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Regular&nbsp;Papers<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>New Distributed Interactive Proofs for Planarity: A Matter of Left and Right<br>Yuval Gil and Merav Parter<br><\/li>\n\n\n\n<li>Robust predicate and function computation in continuous chemical reaction networks<br>Kim Calabrese, David Doty, and Mina Latifi<br><\/li>\n\n\n\n<li>Byzantine Consensus in the Random Asynchronous Model<br>George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, and Igor Zablotchi<br><\/li>\n\n\n\n<li>Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection<br>Krishnendu Chatterjee, Jan Maty\u00e1\u0161 K\u0159i\u0161\u0165an, Stefan Schmid, Jakub Svoboda, and Michelle Yeo<br><\/li>\n\n\n\n<li>pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer<br>Orestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, and Dionysis Zindros<br><\/li>\n\n\n\n<li>PIPQ: Strict Insert-Optimized Concurrent Priority Queue<br>Olivia Grimes, Ahmed Hassan, Panagiota Fatourou, and Roberto Palmieri<br><\/li>\n\n\n\n<li>Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders<br>Emilio Cruciani, Sebastian Forster, and Tijn de Vos<br><\/li>\n\n\n\n<li>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits<br>Matthias Artmann, Andreas Padalkin, and Christian Scheideler<br><\/li>\n\n\n\n<li>Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs<br>Ashish Saxena and Kaushik Mondal<br><\/li>\n\n\n\n<li>Compact routing schemes in undirected and directed graphs<br>Avi Kadria and Liam Roditty<br><\/li>\n\n\n\n<li>On the Efficiency of Dynamic Transaction Scheduling in Blockchain Sharding<br>Ramesh Adhikari, Costas Busch, and Miroslav Popovic<br><\/li>\n\n\n\n<li>The Complexity Landscape of Dynamic Distributed Subgraph Finding<br>Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, and Mingyang Yang<br><\/li>\n\n\n\n<li>Towards Fully Automatic Distributed Lower Bounds<br>Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Joonatan Saarhelo<br><\/li>\n\n\n\n<li>Towards Optimal Distributed Edge Coloring with Fewer Colors<br>Manuel Jakob, Yannic Maus, and Florian Schager<br><\/li>\n\n\n\n<li>Team Formation and Applications<br>Yuval Emek, Shay Kutten, Ido Rafael, and Gadi Taubenfeld<br><\/li>\n\n\n\n<li>DAG it off: Latency Prefers No Common Coins<br>Ignacio Amores-Sesar, Viktor Gr\u00f8ndal, Adam Holmg\u00e5rd, and Mads Ottendal<br><\/li>\n\n\n\n<li>Amnesiac Flooding: Easy to Break, Hard to Escape<br>Henry Austin, Maximillien Gadouleau, George B. Mertzios, and Amitabh Trehan<br><\/li>\n\n\n\n<li>TEE is not a Healer: Rollback-Resistant Reliable Storage<br>Sadegh Keshavarzi, Gregory Chockler and Alexey Gotsman<br><\/li>\n\n\n\n<li>Model-Agnostic Approximation of Constrained Forest Problems<br>Corinna Coupette, Alipasha Montaseri, and Christoph Lenzen<br><\/li>\n\n\n\n<li>Distributed Computation with Local Advice<br>Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, and Jukka Suomela<br><\/li>\n\n\n\n<li>Energy-Efficient Maximal Independent Sets in Radio Networks<br>Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, and Gopal Pandurangan<br><\/li>\n\n\n\n<li>Strong Linearizability without Compare&amp;Swap: The Case of Bags<br>Faith Ellen and Gal Sela<br><\/li>\n\n\n\n<li>On the h-Majority Dynamics with Many Opinions<br>Francesco d&#8217;Amore, Niccol\u00f2 D&#8217;Archivio, George Giakkoupis, and Emanuele Natale<br><\/li>\n\n\n\n<li>On the Randomized Locality of Matching Problems in Regular Graphs<br>Seri Khoury, Manish Purohit, Aaron Schild, and Joshua R. Wang<br><\/li>\n\n\n\n<li>An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention<br>Dan Alistarh, Faith Ellen, and Alexander Fedorov<br><\/li>\n\n\n\n<li>Complexity landscape for local certification<br>Nicolas Bousquet, Laurent Feuilloley, and S\u00e9bastien Zeitoun<br><\/li>\n\n\n\n<li>New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs<br>Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d&#8217;Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, and Jukka Suomela<br><\/li>\n\n\n\n<li>Approach of Agents with Restricted Fuel Tanks<br>Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, and Grzegorz Stachowiak<br><\/li>\n\n\n\n<li>Validity in Network-Agnostic Byzantine Agreement<br>Andrei Constantinescu, Marc Dufay, Diana Ghinea, and Roger Wattenhofer<br><\/li>\n\n\n\n<li>Auditable Shared Objects: From Registers to Synchronization Primitives<br>Hagit Attiya, Antonio Fern\u00e1ndez Anta, Alessia Milani, Alexandre Rapetti, and Corentin Travers<br><\/li>\n\n\n\n<li>Weight reduction in distributed protocols: new algorithms and analysis<br>Anatoliy Zinovyev<br><\/li>\n\n\n\n<li>Distributed Download from an External Data Source in Byzantine Majority Settings<br>John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg<br><\/li>\n\n\n\n<li>Hierarchical Consensus: Scalability through Optimism and Weak Liveness<br>Pedro Antonino, Antoine Durand, and A. W. Roscoe<br><\/li>\n\n\n\n<li>Asynchronous Latency and Fast Atomic Snapshot<br>Jo\u00e3o Paulo Bezerra, Luciano Freitas, and Petr Kuznetsov<br><\/li>\n\n\n\n<li>Perpetual exploration in anonymous synchronous networks with a Byzantine black hole<br>Adri Bhattacharya, Pritam Goswami, Evangelos Bampas, and Partha Sarathi Mandal<br><\/li>\n\n\n\n<li>Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique<br>Keren Censor-Hillel, Orr Fischer, Ran Gelles, and Pedro Soto<br><\/li>\n\n\n\n<li>Lower Bounds for k-Set Agreement in Fault-Prone Networks<br>Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz, Ulrich Schmid, and Hugo Rincon-Galeana<br><\/li>\n\n\n\n<li>Kudzu: Fast and Simple High-Throughput BFT<br>Victor Shoup, Jakub Sliwinski, and Yann Vonlanthen<br><\/li>\n\n\n\n<li>LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics<br>Martin Hilgendorf and Marina Papatriantafilou<br><\/li>\n\n\n\n<li>Coordination Through Stochastic Channels<br>Pierre Fraigniaud, Boaz Patt-Shamir, and Sergio Rajsbaum<br><\/li>\n\n\n\n<li>ABEL: Perfect Asynchronous Byzantine Extension from List-Decoding<br>Ittai Abraham and Gilad Asharov<br><\/li>\n\n\n\n<li>Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity<br>L\u00e9lia Blin, Franck Petit, and S\u00e9bastien Tixeuil<br><\/li>\n\n\n\n<li>Content-Oblivious Leader Election in 2-Edge-Connected Networks<br>J\u00e9r\u00e9mie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Brief Announcements<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Brief Announcement: Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks<br>Antonio Cruciani<br><\/li>\n\n\n\n<li>Brief Announcement: Weaker Assumptions for Asymmetric Trust<br>Christian Cachin and Juan Villacis<br><\/li>\n\n\n\n<li>Brief Announcement: Universal Dancing by Luminous Robots under Sequential Schedulers<br>Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, and Nicola Santoro<br><\/li>\n\n\n\n<li>Brief Announcement: The Virtue of Self-Consistency<br>Fabian Frei and Koichi Wada<br><\/li>\n\n\n\n<li>Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication<br>Andrei Constantinescu, Marc Dufay, Anton Paramonov, and Roger Wattenhofer<br><\/li>\n\n\n\n<li>Brief Announcement: Highly Dynamic and Fully Distributed Data Structures<br>John Augustine, Antonio Cruciani, and Iqra Altaf Gillani<br><\/li>\n\n\n\n<li>Brief Announcement: Distributed Sparsest Cut via Eigenvalue Estimation<br>Yannic Maus and Tijn de Vos<br><\/li>\n\n\n\n<li>Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs<br>Salwa Faour and Fabian Kuhn<br><\/li>\n\n\n\n<li>Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings<br>John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg<br><\/li>\n\n\n\n<li>Brief Announcement: Incrementally Verifiable Distributed Computation<br>Eden Aldema Tshuva and Rotem Oshman<br><\/li>\n\n\n\n<li>Brief Announcement: Carry the Tail in Consensus Protocols<br>Suyash Gupta, Dakai Kang, Dahlia Malkhi, and Mohammad Sadoghi<br><\/li>\n\n\n\n<li>Brief Announcement: Asynchronous Approximate Agreement with Quadratic Communication<br>Mose Mizrahi Erbes and Roger Wattenhofer<br><\/li>\n\n\n\n<li>Brief Announcement: Congested Clique Counting for Local Gibbs Distributions<br>Joshua Z. Sobel<br><\/li>\n\n\n\n<li>Brief Announcement: Proximal Byzantine Agreement: Improved accuracy for fault-tolerant replicated datastreams<br>Roy Shadmon and Owen Arden<br><\/li>\n\n\n\n<li>Brief Announcement: DAGs for the Masses<br>Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, and Petr Kuznetsov<br><\/li>\n\n\n\n<li>Brief Announcement: Concurrent Double-Ended Priority Queues<br>Panagiota Fatourou, Eric Ruppert, and Ioannis Xiradakis<br><\/li>\n\n\n\n<li>Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics<br>Rida Bazzi, Anya Chaturvedi, Andr\u00e9a W. Richa, and Peter Vargas<br><\/li>\n\n\n\n<li>Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks<br>Adam Ganczorz, Tomasz Jurdzinski, and Andrzej Pelc<br><\/li>\n\n\n\n<li>Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More<br>Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, and Kui Ren<br><\/li>\n\n\n\n<li>Brief Announcement: Optimal Dispersion Under Asynchrony<br>Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma<br><\/li>\n\n\n\n<li>Brief Announcement: Communication Patterns for Optimal Resilience<br>Hagit Attiya, Itay Flam, and Jennifer L. Welch<br><\/li>\n\n\n\n<li>Brief Announcement: Time, Fences and the Ordering of Events in TSO<br>Ra\u00efssa Nataf and Yoram Moses<br><\/li>\n\n\n\n<li>Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings<br>J\u00e9r\u00e9mie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Regular&nbsp;Papers Brief Announcements<\/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\/disc2025\/wp-json\/wp\/v2\/pages\/2355","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.disc-conference.org\/wp\/disc2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.disc-conference.org\/wp\/disc2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.disc-conference.org\/wp\/disc2025\/wp-json\/wp\/v2\/users\/30"}],"replies":[{"embeddable":true,"href":"https:\/\/www.disc-conference.org\/wp\/disc2025\/wp-json\/wp\/v2\/comments?post=2355"}],"version-history":[{"count":3,"href":"https:\/\/www.disc-conference.org\/wp\/disc2025\/wp-json\/wp\/v2\/pages\/2355\/revisions"}],"predecessor-version":[{"id":4101,"href":"https:\/\/www.disc-conference.org\/wp\/disc2025\/wp-json\/wp\/v2\/pages\/2355\/revisions\/4101"}],"wp:attachment":[{"href":"https:\/\/www.disc-conference.org\/wp\/disc2025\/wp-json\/wp\/v2\/media?parent=2355"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}