ADGA 2025: Monday, 27 October 2025 in Berlin, co-located with DISC 2025

SIROCCO 2026 Call for Papers 33rd International Colloquium On Structural Information and Communication Complexity Durham, UK, June 9–11, 2026 https://sirocco2026.webspace.durham.ac.uk SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative methodological and solution approaches leading to a […]

## **About** The _International Symposium on Distributed Computing_ (DISC) is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. DISC 2025 will be held in **Berlin, Germany** on **October 27 – October 31, 2025**. The conference will be held at **the Harnack House** , a conference venue of the Max Planck Society. DISC is organized in cooperation with the European Association for Theoretical Computer Science (EATCS).

SIROCCO 2026 Call for Papers 33rd International Colloquium On Structural Information and Communication Complexity Durham, UK, June 9–11, 2026 https://sirocco2026.webspace.durham.ac.uk SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative methodological and solution approaches leading to a […]

# Registration Deadline The early registration deadline is **27 September 2025.** The normal registration deadline is **October 19, 2025**. # What is included in the registration The DISC fee includes daily coffee breaks and lunch, get together on Monday evening, and the conference dinner on Wednesday evening. The per-day workshop registration fee includes the workshop program, lunch, and coffee breaks, for one workshop day. ## DISC and EATCS DISC is organized in cooperation with EATCS, the European Association for Theoretical Computer Science. **All participants of DISC have to be members of the EATCS.** * If you are not yet a member, please see this page for instructions on how to join. * If you are already a member, please check their member pages to see that you have paid the EATCS member fees for this year. ## Registration fees **Note:** For each accepted regular paper or brief announcement, **at least one of the authors (e.g., the presenter) has to have paid a regular/author registration fee.** | **By 27 September**| **By 19 October**| **From 20 October** ---|---|---|--- **DISC regular/author fee **| 700 €| 750 €| 850 € **DISC student fee**| 500 €| 600 €| 700 € **Workshop day** **regular fee**| 110 €| 125 €| 150 € **Workshop day** **student fee**| 75 €| 90 €| 100 € The registration deadlines are midnight (anywhere on earth). ## Accompanying persons An additional ticket for the conference dinner on Wednesday costs 75 euros. # Registration form **Important notes on registration:** * DISC participants have to be EATCS members. You can join EATCS and/or check your EATCS membership status on the EATCS website. * If you do not yet know your **EATCS member ID** (see “DISC and EATCS” above), please use 0000 as a placeholder. * Please**enter your academic title correctly** (i.e., if you have a doctorate or not). This information is needed for administrative reasons. Please register via the online registration form.

## Monday, October 27 **09:00 – 12:30**| **ADGA** **FRIDA** ---|--- **12:30 – 14:00**| Lunch **14:00 – 18:00**| **ADGA** **FRIDA** **18:00 – 20:00**| Welcome Reception ## Tuesday, October 28 **08:45 – 10:00** | **Session 1: Concurrent data structures** ---|--- | PIPQ: Strict Insert-Optimized Concurrent Priority Queue Olivia Grimes, Ahmed Hassan, Panagiota Fatourou, and Roberto Palmieri | TEE is not a Healer: Rollback-Resistant Reliable Storage Sadegh Keshavarzi, Gregory Chockler, and Alexey Gotsman | LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics Martin Hilgendorf and Marina Papatriantafilou | Brief Announcement: Highly Dynamic and Fully Distributed Data Structures John Augustine, Antonio Cruciani, and Iqra Altaf Gillani | Brief Announcement: Concurrent Double-Ended Priority Queues Panagiota Fatourou, Eric Ruppert, and Ioannis Xiradakis **10:00 – 11:00**| **Keynote 1: François Le Gall** Recent developments in quantum distributed computing **11:00 – 11:25**| **Coffee break** **11:25 – 12:30**| **Session 2:** Highlighted presentations in mobility and communication | Team Formation and Applications Yuval Emek, Shay Kutten, Ido Rafael, and Gadi Taubenfeld | Approach of Agents with Restricted Fuel Tanks Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, and Grzegorz Stachowiak | Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique Keren Censor-Hillel, Orr Fischer, Ran Gelles, and Pedro Soto **12:30 – 13:45**| **Lunch break** **13:45 – 15:40**| **Session 3: Distributed graph algorithms** | Towards Fully Automatic Distributed Lower Bounds Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Joonatan Saarhelo | New Distributed Interactive Proofs for Planarity: A Matter of Left and Right Yuval Gil and Merav Parter | The Complexity Landscape of Dynamic Distributed Subgraph Finding Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, and Mingyang Yang **14:40 – 14:45**| **Short break** **during the session** | Model-Agnostic Approximation of Constrained Forest Problems Corinna Coupette, Alipasha Montaseri, and Christoph Lenzen | New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d’Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, and Jukka Suomela | Brief Announcement: Distributed Sparsest Cut via Eigenvalue Estimation Yannic Maus and Tijn de Vos | Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs Salwa Faour and Fabian Kuhn **15:40 – 16:00**| **Coffee break** **16:00 – 17:45**| **Session 4: Blockchain foundations** | Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection Krishnendu Chatterjee, Jan Matyáš Křišťan, Stefan Schmid, Jakub Svoboda, and Michelle Yeo | On the Efficiency of Dynamic Transaction Scheduling in Blockchain Sharding Ramesh Adhikari, Costas Busch, and Miroslav Popovic | Hierarchical Consensus: Scalability through Optimism and Weak Liveness Pedro Antonino, Antoine Durand, and A. W. Roscoe **16:50 – 16:55**| **Short break during the session** | DAG it off: Latency Prefers No Common Coins Ignacio Amores-Sesar, Viktor Grøndal, Adam Holmgård, and Mads Ottendal | Brief Announcement: DAGs for the Masses Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, and Petr Kuznetsov | Brief Announcement: Carry the Tail in Consensus Protocols Suyash Gupta, Dakai Kang, Dahlia Malkhi, and Mohammad Sadoghi | Brief Announcement: Weaker Assumptions for Asymmetric Trust Christian Cachin and Juan Villacis **18:00 – 19:30**| **Business meeting** ## Wednesday, October 29 **08:45 – 10:00** | **Session 5: Shared-memory and parallelism** ---|--- | Auditable Shared Objects: From Registers to Synchronization Primitives Hagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, and Corentin Travers | Asynchronous Latency and Fast Atomic Snapshot João Paulo Bezerra, Luciano Freitas, and Petr Kuznetsov | An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention Dan Alistarh, Faith Ellen, and Alexander Fedorov | Brief Announcement: Time, Fences and the Ordering of Events in TSO Raïssa Nataf and Yoram Moses | Brief Announcement: Incrementally Verifiable Distributed Computation Eden Aldema Tshuva and Rotem Oshman **10:00 – 11:00**| **Keynote 2 (presented by 2025 Dijkstra Prize winner): Moni Naor** What Can Be Computed and Verified Locally: A Three Decade Perspective **11:00 – 11:25**| **Coffee break** (with posters) **11:25 – 12:30**| **Session 6: Best (student) paper awards** | Complexity landscape for local certification (Best Paper Award) Nicolas Bousquet, Laurent Feuilloley, and Sébastien Zeitoun | Content-Oblivious Leader Election in 2-Edge-Connected Networks (Best Student Paper co-Award) Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou | pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer (Best Student Paper co-Award) Orestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, and Dionysis Zindros **12:30 – 13:45**| **Lunch break** (with posters) **13:45 – 14:50**| **Session 7: Highlighted presentations in fault-tolerance and shared-memory** | Validity in Network-Agnostic Byzantine Agreement Andrei Constantinescu, Marc Dufay, Diana Ghinea, and Roger Wattenhofer | Distributed Download from an External Data Source in Byzantine Majority Settings John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg | Strong Linearizability without Compare&Swap: The Case of Bags Faith Ellen and Gal Sela **14:50 – 15:30**| **Coffee break (with posters)** **15:30 – 16:55**| **Session 8: Mobile agents** | Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs Ashish Saxena and Kaushik Mondal | On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits Matthias Artmann, Andreas Padalkin, and Christian Scheideler | Perpetual exploration in anonymous synchronous networks with a Byzantine black hole Adri Bhattacharya, Pritam Goswami, Evangelos Bampas, and Partha Sarathi Mandal | Brief Announcement: Universal Dancing by Luminous Robots under Sequential Schedulers Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, and Nicola Santoro | Brief Announcement: The Virtue of Self-Consistency Fabian Frei and Koichi Wada | Brief Announcement: Optimal Dispersion Under Asynchrony Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma **16:55 – 17:05**| **Short break** **16:05 – 17:50**| **Session 9: Fault-tolerance and synchronization** | Lower Bounds for k-Set Agreement in Fault-Prone Networks Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz, Ulrich Schmid, and Hugo Rincon-Galeana | Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg | Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics Rida Bazzi, Anya Chaturvedi, Andréa W. Richa, and Peter Vargas | Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou **19:00 – 22:00**| **Conference banquet** ## Thursday, October 30 **08:45 – 10:00** | **Session 10: Nature-inspired computation and dynamic networks** ---|--- | Robust predicate and function computation in continuous chemical reaction networks Kim Calabrese, David Doty, and Mina Latifi | On the h-Majority Dynamics with Many Opinions Francesco d’Amore, Niccolò D’Archivio, George Giakkoupis, and Emanuele Natale | Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders Emilio Cruciani, Sebastian Forster, and Tijn de Vos | Brief Announcement: Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks Antonio Cruciani | Brief Announcement: Congested Clique Counting for Local Gibbs Distributions Joshua Z. Sobel **10:00 – 11:00**| **Keynote 3** : **Ittai Abraham** **11:00 – 11:25**| **Coffee break** **11:25 – 12:30**| Towards Optimal Distributed Edge Coloring with Fewer Colors Manuel Jakob, Yannic Maus, and Florian Schager | On the Randomized Locality of Matching Problems in Regular Graphs Seri Khoury, Manish Purohit, Aaron Schild, and Joshua R. Wang | Distributed Computation with Local Advice Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, and Jukka Suomela **12:30 – 13:45**| **Lunch break** (with posters) **13:45 – 15:00**| **Session 11: Fault-tolerance and consensus** | Byzantine Consensus in the Random Asynchronous Model George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, and Igor Zablotchi | ABEL: Perfect Asynchronous Byzantine Extension from List-Decoding Ittai Abraham and Gilad Asharov | Kudzu: Fast and Simple High-Throughput BFT Victor Shoup, Jakub Sliwinski, and Yann Vonlanthen | Weight reduction in distributed protocols: new algorithms and analysis Anatoliy Zinovyev **15:00 – 15:20**| **Coffee break** **15:20 – 17:00**| **Session 12: Communication** | Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity Lélia Blin, Franck Petit, and Sébastien Tixeuil | Amnesiac Flooding: Easy to Break, Hard to Escape Henry Austin, Maximillien Gadouleau, George B. Mertzios, and Amitabh Trehan | Coordination Through Stochastic Channels Pierre Fraigniaud, Boaz Patt-Shamir, and Sergio Rajsbaum | Compact routing schemes in undirected and directed graphs Avi Kadria and Liam Roditty | Energy-Efficient Maximal Independent Sets in Radio Networks Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, and Gopal Pandurangan | Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks Adam Ganczorz, Tomasz Jurdzinski, and Andrzej Pelc **17:00 – 17:05**| **Short break** **17:05- 17:45**| **Session 13: Fault-tolerance and consensus continued** | Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication Andrei Constantinescu, Marc Dufay, Anton Paramonov, and Roger Wattenhofer | Brief Announcement: Asynchronous Approximate Agreement with Quadratic Communication Mose Mizrahi Erbes and Roger Wattenhofer | Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, and Kui Ren | Brief Announcement: Communication Patterns for Optimal Resilience Hagit Attiya, Itay Flam, and Jennifer L. Welch | Brief Announcement: Proximal Byzantine Agreement: Improved accuracy for fault-tolerant replicated datastreams Roy Shadmon and Owen Arden | ## Friday, October 31 **Workshops** : **HACDA** , **WAND** , **AMG** **Lunch: 12:30.**

Prize for Innovation in Distributed Computing 2026 Awarded by the Colloquium on Structural Information and Communication Complexity (SIROCCO) Nominations are due by September 9, 2025. Call for Prize Nominations Nominations are requested for the Prize for Innovation in Distributed Computing, awarded by the Colloquium on Structural Information and Communication Complexity (SIROCCO). This prize was […]

SIROCCO 2026 Call for Papers 33rd International Colloquium On Structural Information and Communication Complexity Durham, UK, June 9–11, 2026 https://sirocco2026.webspace.durham.ac.uk SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative methodological and solution approaches leading to a […]

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

ADGA 2025: Monday, 27 October 2025 in Berlin, co-located with DISC 2025

Prize for Innovation in Distributed Computing 2026 Awarded by the Colloquium on Structural Information and Communication Complexity (SIROCCO) Nominations are due by September 9, 2025. Call for Prize Nominations Nominations are requested for the Prize for Innovation in Distributed Computing, awarded by the Colloquium on Structural Information and Communication Complexity (SIROCCO). This prize was […]

SIROCCO 2026 Call for Papers 33rd International Colloquium On Structural Information and Communication Complexity Durham, UK, June 9–11, 2026 https://sirocco2026.webspace.durham.ac.uk SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative methodological and solution approaches leading to a […]

## **About** The _International Symposium on Distributed Computing_ (DISC) is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. DISC 2025 will be held in **Berlin, Germany** on **October 27 – October 31, 2025**. The conference will be held at **the Harnack House** , a conference venue of the Max Planck Society. DISC is organized in cooperation with the European Association for Theoretical Computer Science (EATCS).

39th International Symposium on Distributed Computing October 27th – October 31st, 2025 Berlin, Germany https://www.disc-conference.org/wp/disc2025/ ## **DISC Conference Overview** The International Symposium on Distributed Computing (DISC) is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. It is organized in cooperation with the European Association for Theoretical Computer Science (EATCS). The symposium was established **40 years ago** , in 1985, as a biannual International Workshop on Distributed Algorithms on Graphs (WDAG). DISC 2025 will host the presentation of the 2025 Edsger W. Dijkstra Prize in Distributed Computing. ## **Important Dates** **Paper registration:** May 20, 2025 **Submission deadline:** May 23, 2025 **Rebuttal phase:** July 7-14, 2025 **Notification:** August 7, 2025 All deadlines are at 23:59 AoE. ## **Scope** Submissions are sought in all areas of distributed algorithms and distributed systems, including theory, design, implementation, modelling, analysis, and application of distributed systems and networks. Topics of interest include, but are not limited to: – Biological and nature-inspired distributed algorithms – Blockchain protocols – Coding and reliable communication – Communication networks: algorithms, protocols, and applications – Complexity, lower bounds, and impossibility results – Design and analysis of distributed algorithms – Distributed and concurrent data structures – Distributed algorithms for clouds and IoT – Distributed graph algorithms – Distributed machine learning and data science – Distributed operating systems, middleware, database systems – Distributed resource management – Fault tolerance, reliability, self-organization, self-stabilization – Formal methods for distributed computing: verification, synthesis and testing – Game-theoretic and knowledge-based approaches to distributed computing – Internet and web applications, social networks and recommendation systems – Massively-parallel, high-performance, cloud and grid computing – Mobile agents, autonomous distributed systems, swarm robotics – Multiprocessor and multi-core architectures and algorithms – Overlay networks and peer-to-peer networks – Population protocols and chemical reaction networks – Quantum distributed algorithms – Replication, consensus, and consistency – Security in distributed computing, cryptographic protocols – Synchronization, persistence and transactional memory – Wireless, mobile, sensor and ad-hoc networks ## **Submissions** Submission should be done via the following web page: https://disc25.hotcrp.com A submitted paper should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the paper, explicitly and precisely state the paper’s key contributions, and outline the key technical ideas and methods used to achieve the main claims. A submission should strive to be accessible to a broad audience, as well as having sufficient details for experts in the area. There are two types of submissions: regular papers and brief announcements. Regular papers must report on original research that has not previously been published (and may not be concurrently submitted to other journals or conferences with proceedings). All ideas necessary for an expert to fully verify the central claims in a paper, including experimental results, should be included in the submission. A brief announcement may describe work in progress or work presented elsewhere. A brief announcement may also present a result that is short and elegant, but does not require a longer paper. It may also be used to announce a software distribution or an experimental result of interest that can be concisely described. A paper that is not accepted as a regular paper may be invited as a brief announcement. When requested by the program committee, each author of the submitted paper(s) is expected to prepare a professional review of a non-conflicted DISC 2025 submission that falls within their research expertise. ## **Submission format** Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs (https://submission.dagstuhl.de/series/details/5#author) with `\documentclass[a4paper,anonymous,USenglish]{lipics-v2021}.` Submissions must be anonymous, without any author names, affiliations, or email addresses. The contact information of the authors will be entered separately in the submission metadata. For regular papers, there is no page limit, and authors are encouraged to use the “full version” of their paper as the submission. The initial 15 pages, excluding the title page and a table of contents, should contain a clear presentation of the merits of the paper, including a discussion of the paper’s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. (Illustrative figures are encouraged.) The submission must contain all necessary details, including full proofs of all claims in the paper. Although there is no bound on the length of a submission, material other than the first 15 pages, excluding the title page and a table of contents, will be read at the committee’s discretion. Papers submitted as brief announcements should comply with the above rules, replacing 15 pages with 5 pages. Submissions not conforming to the submission guidelines and papers outside of the scope of the conference will be rejected without consideration. All accept/reject decisions made by the program committee are final. ## **Use of Large Language Models (LLMs)** The use of LLMs for submission preparation is permitted, although it is highly recommended that they only be used for cosmetic changes, e.g. proofreading of the text. The use of LLMs in technical parts should be treated in the same way as any other software or system, and thus carefully described and documented in the submission. Ultimately, the authors are responsible for the content of their submission, and mis-use of LLM may result in rejection. Any questions about the LLM use policy should be directed to the PC chair, Dariusz Kowalski (dkowalski@augusta.edu). ## **Anonymous Submissions** We will use a relaxed implementation of double-blind peer review. Submissions must not reveal the identity of the authors in any way. In particular, authors’ names and affiliation should not appear in the document itself. Authors should ensure that any references to their own related work are in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). The purpose of this process is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. You are free to disseminate your work through arXiv and other online repositories and give presentations on your work as usual. Moreover, nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. Brief announcements should also be submitted without author names and affiliations so that a reviewer can form an initial judgment without bias, but they can contain a reference to the full version of the work in the bibliography. Please feel free to ask the PC chair if you have any questions about the double-blind policy of DISC 2025. ## **Conflict of Interest** The submission form provides an opportunity to specify conflicts of interest with any of the PC members and other member of research community. A conflict of interest is limited to the following: – A family member or close friend; – A Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years; – A person with the same affiliation; – A person involved in an alleged incident of harassment; – Frequent collaborators, or collaborators who have jointly published papers within the last two years. If you feel that you have a valid reason for a conflict of interest beyond listed above, or any other issues related to the fair treatment of your submission, contact the PC chair, Dariusz Kowalski (dkowalski@augusta.edu), or the SafeTOC representative for DISC, listed at https://safetoc.org/index.php/toc-advisors/. ## **Participation at DISC** It is expected that accepted papers and brief announcements be presented in-person at the conference. ## **Publication** The proceedings will be published by LIPIcs. The final version of the paper has to be formatted following the LIPIcs guidelines. Regular papers will have 15 pages in the final proceedings (excluding references), and brief announcements will have 5 pages in the proceedings (including everything). If more space is needed, the authors are encouraged to post the full version e.g. on arXiv and refer to it in their paper. Accepted papers and brief announcements must be presented by one of the authors, with a full registration and according to the final schedule. Extended and revised versions of selected papers will be considered for a special issue of the journal Distributed Computing. The best paper at DISC will be considered for publication in the Journal of the ACM. ## **Awards** Awards will be given to the best paper and the best student paper. To be eligible for the best student paper award, at least one of the paper authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper.

Some travel grants are available for partial support to attend PODC 2025. Please use this form to apply. ### **Deadlines** All deadlines are at 23:59 AoE. * Early application deadline: **11th May**(*) * Early notification: **13th May**(*) * Extended application deadline: **30th May** * Extended notification: **1st June** (*) The early application deadline is set to allow participants to take advantage of the discounted hotel rate which is guaranteed until 15th of May. All applications received by the extended application deadline will be considered. However, due to a limited budget, we will prioritise the applicants whose entry is received by the early application deadline and the applicants who are presenting at PODC 2025. The exact number of awards and the amount awarded will be determined based on the available budget and the applications received. Any awarded amount will be paid after the conference. If you have any questions, please contact podc2025-travel-grants@dimitrioslos.com.

The registration site will be available soon. The following table contains the prices of different packages in $USD. **Package** | **Early** | **Late** ---|---|--- **ACM/SIG Members** | **Non-ACM/SIG Members** | **Student** | **ACM/SIG Members** | **Non-ACM/SIG Members** | **Student** **PODC only** | 260$ | 360$ | 205$ | 340$ | 440$ | 265$ **PODC + Workshops** | 380$ | 480$ | 325$ | 460$ | 560$ | 385$ **Workshops, 1 day.** | 70$ | 100$ **Workshops, 2 days.** | 140$ | 200$

DISC 2025 will be held this year in Berlin, Germany from the **27th to the 31st of October** (http://www.disc-conference.org/wp/disc2025/). We invite proposals for full-day and half-day workshops and tutorials. They will take place on Monday the 27th of October and Friday the 31st of October. **We expect that most talks of workshops are****held in person at****the conference site.** We intend to follow the “workshops template” from DISC 2019 (see the workshop program at a glance at http://www.disc-conference.org/wp/disc2019/workshops/), that is, there will be up to 3-4 workshops each day (depending on the predicted number of participants) where we synchronize the parallel talks as much as possible so that “cross-workshops” participants will not miss any of the talks. This also guarantees shared coffee and lunch breaks. The organizers of DISC will encourage students to participate in the workshops, e.g., allotting a quota of free-of-charge local students, and waiving workshop registration for students that participate in the main conference. DISC will also waive the registration fees of a limited number of speakers per workshop/tutorial. We are interested in topics which are related to distributed computing and systems on one hand, but also in topics that have the potential of extending the scope of what the community sees as “distributed computing” on the other hand. ## Important dates **Workshop/Tutorial proposal deadline:** May 31, 2025, at 23:59 AoE. The notification will be provided shortly after the proposal has been sent. ## Instructions Please email the Workshops & Tutorials Chair, Yannic Maus (yannic.maus@tugraz.at), a short proposal with the following details: 1. Workshop/tutorial name and an optional acronym (please state whether it is a workshop, a tutorial, or any other format). 2. Names, affiliations, and email addresses of the organizers. Please specify who is the point of contact. 3. Short description of the workshop’s topic and its relevance to the DISC community. 4. Length: Half-day or full day. 5. Date preference: please state if you are OK with being scheduled to the 9th or the 13th, or that you are OK with both options. 6. Tentative list of (possible) speakers. 7. A skeleton schedule of the workshop (see an example in here: https://parsys.lri.fr/CELLS/#page_program, but of course you can have shorter talks/posters, etc.). 8. A link to a website of a past meeting of your workshop (if applicable). 9. Estimated number of speakers and attendees.

39th International Symposium on Distributed Computing October 27th – October 31st, 2025 Berlin, Germany https://www.disc-conference.org/wp/disc2025/ ## **DISC Conference Overview** The International Symposium on Distributed Computing (DISC) is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. It is organized in cooperation with the European Association for Theoretical Computer Science (EATCS). The symposium was established **40 years ago** , in 1985, as a biannual International Workshop on Distributed Algorithms on Graphs (WDAG). ## **Important Dates** **Paper registration:** May 20, 2025 **Submission deadline:** May 23, 2025 **Rebuttal phase:** July 7-14, 2025 **Notification:** August 7, 2025 All deadlines are at 23:59 AoE. ## **Scope** Submissions are sought in all areas of distributed algorithms and distributed systems, including theory, design, implementation, modelling, analysis, and application of distributed systems and networks. Topics of interest include, but are not limited to: – Biological and nature-inspired distributed algorithms – Blockchain protocols – Coding and reliable communication – Communication networks: algorithms, protocols, and applications – Complexity, lower bounds, and impossibility results – Design and analysis of distributed algorithms – Distributed and concurrent data structures – Distributed algorithms for clouds and IoT – Distributed graph algorithms – Distributed machine learning and data science – Distributed operating systems, middleware, database systems – Distributed resource management – Fault tolerance, reliability, self-organization, self-stabilization – Formal methods for distributed computing: verification, synthesis and testing – Game-theoretic and knowledge-based approaches to distributed computing – Internet and web applications, social networks and recommendation systems – Massively-parallel, high-performance, cloud and grid computing – Mobile agents, autonomous distributed systems, swarm robotics – Multiprocessor and multi-core architectures and algorithms – Overlay networks and peer-to-peer networks – Population protocols and chemical reaction networks – Quantum distributed algorithms – Replication, consensus, and consistency – Security in distributed computing, cryptographic protocols – Synchronization, persistence and transactional memory – Wireless, mobile, sensor and ad-hoc networks ## **Submissions** A submitted paper should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the paper, explicitly and precisely state the paper’s key contributions, and outline the key technical ideas and methods used to achieve the main claims. A submission should strive to be accessible to a broad audience, as well as having sufficient details for experts in the area. There are two types of submissions: regular papers and brief announcements. Regular papers must report on original research that has not previously been published (and may not be concurrently submitted to other journals or conferences with proceedings). All ideas necessary for an expert to fully verify the central claims in a paper, including experimental results, should be included in the submission. A brief announcement may describe work in progress or work presented elsewhere. A brief announcement may also present a result that is short and elegant, but does not require a longer paper. It may also be used to announce a software distribution or an experimental result of interest that can be concisely described. A paper that is not accepted as a regular paper may be invited as a brief announcement. ## **Submission format** Submissions must be in English in pdf format and they must be prepared using the LaTeX style template for LIPIcs (https://submission.dagstuhl.de/series/details/5#author) with `\documentclass[a4paper,anonymous,USenglish]{lipics-v2021}.` Submissions must be anonymous, without any author names, affiliations, or email addresses. The contact information of the authors will be entered separately in the submission metadata. For regular papers, there is no page limit, and authors are encouraged to use the “full version” of their paper as the submission. The initial 15 pages, excluding the title page and a table of contents, should contain a clear presentation of the merits of the paper, including a discussion of the paper’s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. (Illustrative figures are encouraged.) The submission must contain all necessary details, including full proofs of all claims in the paper. Although there is no bound on the length of a submission, material other than the first 15 pages, excluding the title page and a table of contents, will be read at the committee’s discretion. Papers submitted as brief announcements should comply with the above rules, replacing 15 pages with 5 pages. Submissions not conforming to the submission guidelines and papers outside of the scope of the conference will be rejected without consideration. ## **Use of Large Language Models (LLMs)** The use of LLMs for submission preparation is permitted, although it is highly recommended that they only be used for cosmetic changes, e.g. proofreading of the text. The use of LLMs in technical parts should be treated in the same way as any other software or system, and thus carefully described and documented in the submission. Ultimately, the authors are responsible for the content of their submission, and mis-use of LLM may result in rejection. Any questions about the LLM use policy should be directed to the PC chair, Dariusz Kowalski (dkowalski@augusta.edu). ## **Anonymous Submissions** We will use a relaxed implementation of double-blind peer review. Submissions must not reveal the identity of the authors in any way. In particular, authors’ names and affiliation should not appear in the document itself. Authors should ensure that any references to their own related work are in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). The purpose of this process is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. You are free to disseminate your work through arXiv and other online repositories and give presentations on your work as usual. Moreover, nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. Brief announcements should also be submitted without author names and affiliations so that a reviewer can form an initial judgment without bias, but they can contain a reference to the full version of the work in the bibliography. Please feel free to ask the PC chair if you have any questions about the double-blind policy of DISC 2025. ## **Conflict of Interest** The submission form provides an opportunity to specify conflicts of interest with any of the PC members and other member of research community. A conflict of interest is limited to the following: – A family member or close friend; – A Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years; – A person with the same affiliation; – A person involved in an alleged incident of harassment; – Frequent collaborators, or collaborators who have jointly published papers within the last two years. If you feel that you have a valid reason for a conflict of interest beyond listed above, or any other issues related to the fair treatment of your submission, contact the PC chair, Dariusz Kowalski (dkowalski@augusta.edu), or the SafeTOC representative for DISC, listed at https://safetoc.org/index.php/toc-advisors/. ## **Participation at DISC** It is expected that accepted papers and brief announcements be presented in-person at the conference. ## **Publication** The proceedings will be published by LIPIcs. The final version of the paper has to be formatted following the LIPIcs guidelines. Regular papers will have 15 pages in the final proceedings (excluding references), and brief announcements will have 5 pages in the proceedings (including everything). If more space is needed, the authors are encouraged to post the full version e.g. on arXiv and refer to it in their paper. Accepted papers and brief announcements must be presented by one of the authors, with a full registration and according to the final schedule. Extended and revised versions of selected papers will be considered for a special issue of the journal Distributed Computing. The best paper at DISC will be considered for publication in the Journal of the ACM. ## **Awards** Awards will be given to the best paper and the best student paper. To be eligible for the best student paper award, at least one of the paper authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper.