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

## **Tuesday** **Opening** * 08:40: Opening Remarks **Session 1** * 08:45-09:05: Deterministic Distributed Algorithms for Short Disjoint Paths (Mohsen Ghaffari, Hsin-Hao Su) * 09:05-09:25: Girth Approximations in the CONGEST Model (Shiri Chechik, Gur Lifshitz, Doron Mukhtar) * 09:25-09:45: Distributed Treewidth Computation and Courcelle’s Theorem in the CONGEST Model (Benjamín Jauregui, Jason Li, Pedro Montealegre, Ioan Todinca) * 09:45-09:50: Brief Announcement: On Energy Complexity and Multi-Instance Computation in the Congested Clique (Dominick Banasik, Varsha Dani) * 09:50-09:55: Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST (Tijn de Vos, Yannic Maus, Joakim Blikstad) * 09:55-10:00: Brief Announcement: 2-Coloring Cycles in One Round (Maxime Flin, Alesya Raevskaya, Ronja Stimpert, Jukka Suomela, Qingxin Yang) **Coffee** * 10:00-10:30: Coffee Break **Session 2** * 10:30-10:50: Simple and Efficient Randomized Wait-Free Locks (Kahbod Aeini, Dante Bencivenga, George Giakkoupis, Philipp Woelfel) * 10:50-11:10: Generalized and Reinitializable Concurrent Fast Arrays (N. Efe Çekirge, Owen Chen, Siddhartha Jayanti, Evan Lucca) * 11:10-11:15: Brief Announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table (Hagit Attiya, Rotem Oshman, Noa Schiller) * 11:15-11:20: Brief Announcement: Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems (Vijay K. Garg, Rohan Garg) **Session 3** * 11:20-11:40: Undecided State Dynamics with Many Opinions (Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga) * 11:40-12:00: Fast Gossip-Based Rumor Spreading Using Small Messages (Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan) * 12:00-12:20: Complementary Time–Space Tradeoff for Self-Stabilizing Leader Election (Yuichi Sudo) **Lunch** * 12:20-14:00: Lunch Break **Session 4** * 14:00-14:20: Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs (Lélia Blin, Sylvain Gay, Isabella Ziccardi) * 14:20-14:40: Early-Stabilizing Counting (Christoph Lenzen, Julian Loss) * 14:40-15:00: Gradient Clock Synchronization with Practically Constant Local Skew (Christoph Lenzen) **Session 5** * 15:05-15:25: Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes (Arnold Filtser, Orr Fischer) * 15:25-15:45: Distributed Algorithms for Potential Problems (Alkida Balliu, Thomas Boudier, Francesco d’Amore, Fabian Kuhn, Dennis Olivetti, Gustav Schmid, Jukka Suomela) * 15:45-15:50: Brief Announcement: Exponential Quantum Advantage for Message Complexity in Distributed Algorithms (Maël Luce, Mathieu Roget, Joseph Marchand, François Le Gall) * 15:50-15:55: Brief Announcement: Distributed Statistical Zero-Knowledge Proofs via Sumcheck (Benjamín Jauregui, Masayuki Miyamoto) * 15:55-16:00: Brief Announcement: Distributed Non-Interactive Zero-Knowledge Proofs (Alex Bredariol Grilo, Ami Paz, Mor Perry) **Coffee & Invited Talk** * 16:00-16:25: Coffee Break * 16:25-17:35: Keynote Talk: Parallel Algorithm Engineering Reconsidered * 17:45: Business Meeting ## **Wednesday** **Session 6** * 08:40-09:00: From Few to Many Faults: Optimal Adaptive Byzantine Agreement (Andrei Constantinescu, Marc Dufay, Anton Paramonov, Roger Wattenhofer) * 09:00-09:20: Reaching Univalency with Subquadratic Communication (Andrew Lewis-Pye) * 09:20-09:40: Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience (Hagit Attiya, Itay Flam, Jennifer Welch) * 09:40-09:45: Brief Announcement: Communication Efficient Byzantine Agreement with Predictions (Muhammad Ayaz Dzulfikar, Seth Gilbert) * 09:45-09:50: Brief Announcement: BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs (Fatima Elsheimy, Simon Kamp) * 09:50-09:55: Brief Announcement: What is Agreement About if not Common Knowledge? (Or David, Yoram Moses) * 09:55-10:00: Brief Announcement: Byzantine Machine Learning, MultiKrum and an Optimal Notion of Robustness (Gilles Bareilles, Wassim Bouaziz, Julien Fageot, El-Mahdi El-Mhamdi) **Coffee & Dijkstra Talk** * 10:00-10:30: Coffee Break * 10:30-11:30: Dijkstra Prize Keynote: The $\tilde{\Omega}(D+\sqrt{n})$ Lower Bound Story of Distributed Algorithms **Session 7** * 11:35-11:55: Efficient Counting and Simulation in Content-Oblivious Rings (Jérémie Chalopin, Yi-Jun Chang, Giuseppe Antonio Di Luna, Haoran Zhou) * 11:55-12:00: Brief Announcement: Toward Uniform Content-Oblivious Leader Election on General Graphs (Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin) * 12:00-12:20: Distinct Gathering and the Virtue of Self-Consistency (Fabian Frei, Koichi Wada) **Lunch** * 12:20-14:00: Lunch Break **Session 8** * 14:00-14:20: Nearly Quadratic Asynchronous Distributed Key Generation from Recursive Consensus (Ittai Abraham, Renas Bacho, Julian Loss, Gilad Stern) * 14:20-14:40: Information-Theoretic Optimistic Verifiable Secret Sharing (Chen-Da Liu-Zhang, Martin Hirt, Emanuele Marsicano) * 14:40-15:00: Balanced and Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Sub-Quadratic Communication (Hanwen Feng, Tiancheng Mai, Qiang Tang) * 15:00-15:20: Byzantine Consensus in the Partially Authenticated Setting (Christoph Lenzen, Julian Loss, Kecheng Shi, Benedikt Wagner) * 15:20-15:25: Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity (Ashish Choudhury, Madhav Natarajan H) * 15:25-15:30: Brief Announcement: Subcubic Coin Tossing in Asynchrony without PKI (Mose Mizrahi, Roger Wattenhofer) **Coffee** * 15:30-15:55: Coffee Break **Session 9** * 15:55-16:15: New Hardness Results for the LOCAL Model via a Simple Self-Reduction (Alkida Balliu, Filippo Casagrande, Francesco d’Amore, Dennis Olivetti) * 16:15-16:35: The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size (Gustav Schmid, Alkida Balliu, Fabian Kuhn, Dennis Olivetti, Sebastian Brandt, Timothe Picavet) * 16:35-16:40: Brief Announcement: Is a LOCAL Algorithm Computable? (Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela) * 16:40-16:45: Brief Announcement: It Does Not Matter How You Define Locally Checkable Labelings (Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela) * 16:45-16:50: Brief Announcement: Fast Deterministic Distributed Degree Splitting (Yannic Maus, Alexandre Nolin, Florian Schager) * 16:50-16:55: Brief Announcement: Sinkless Orientation Made Trivial (Alexandre Nolin) **Session 10** * 17:00-17:20: Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers (John Augustine, Henning Hillebrandt, Manish Kumar, Christian Scheideler, Julian Werthmann) * 17:20-17:40: The Task Completion Problem and its Application to Crash-Resilient Computation (Orr Fischer, Ran Gelles) * 17:40-18:00: A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput (Matthias Bentert, Chen Avin, Stefan Schmid) **Evening** * 19:30: Barbecue ## **Thursday** **Session 11** * 08:40-09:00: Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition (Peter Davies-Peck) * 09:00-09:20: Meta-Theorems for Cuttable Distributed Problems (Marthe Bonamy, Cyril Gavoille, Avinandan Das, Jukka Suomela, Timothé Picavet, Alexandra Wesolek) * 09:20-09:40: Distributed Stochastic Graph Algorithms (Keren Censor-Hillel, Aditi Dudeja, George Giakkoupis) * 09:40-10:00: Improved Bounds for Distributed Random Walks and Spanning Trees (Gopal Pandurangan, Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel) **Coffee** * 10:00-10:30: Coffee Break **Session 12** * 10:30-10:50: Ranking Opinions with Few States in Population Protocols (Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid) * 10:50-11:10: Order Statistics in Population Protocols via Simple Dynamics (Niccolò D’Archivio, Hind AlMahmoud, Emanuele Natale, Frederik Mallmann-Trenn) * 11:10-11:15: Brief Announcement: DéjàVu: A Minimalistic Mechanism for Distributed Plurality Consensus (Francesco d’Amore, Niccolò D’Archivio, George Giakkoupis, Frédéric Giroire, Emanuele Natale) * 11:15-11:20: Brief Announcement: Limit Laws for Consensus Protocols on the Complete Graph (Julian Becker, Konstantinos Panagiotou) **Session 13** * 11:20-11:40: Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing (Hagit Attiya, Armando Castañeda, Constantin Enea) * 11:40-12:00: Conflict-Freedom as a Progress Condition (Petr Kuznetsov, Pierre Sutra, Guillermo Toyos-Marfurt) * 12:00-12:20: Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model (Vassos Hadzilacos, Myles Thiessen, Sam Toueg) **Lunch** * 12:20-14:00: Lunch Break **Session 14** * 14:00-14:20: Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT (Ittai Abraham, Sourav Das, Yuval Efron, Jovan Komatovic) * 14:20-14:40: FEAT: Fair and Efficient Adversarial Transaction Ordering (Tien Tuan Anh Dinh, Dakai Kang, Mohammad Sadoghi) * 14:40-15:00: Fast Byzantine Total Order Broadcast (Matteo Monti, Martina Camaioni, Pierre-Louis Roman) * 15:00-15:05: Brief Announcement: Delay-Optimal Transaction Order Fairness (Zhuo Cai, Amir K. Goharshady) **Session 15** * 15:10-15:30: Distributed Renaming with Subquadratic Bits via Scalable Committee Election (Sirui Bai, Xinyu Fu, Yuyi Wang, Chaodong Zheng) * 15:30-15:50: Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience (Diana Ghinea, Darya Melnyk, Tijana Milentijević) * 15:50-16:10: Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs (Marc Fuchs, Diana Ghinea, Zahra Parsaeian, Joel Rybicki) * 16:10-16:15: Brief Announcement: Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience (Michael Yiqing Hu, Hong Yao Alvin Yan, Jialin Li) **Coffee & Invited Talk** * 16:15-16:45: Coffee Break * 16:45-17:55: Invited Talk: Highly Asynchronous Concurrency in Data Structures * 17:55: Closing Remarks

40th International Symposium on Distributed Computing November 9-13, 2026 Rome, Italy https://www.disc-conference.org/wp/disc2026/ ## **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 **41 years ago** , in 1985, as a biannual International Workshop on Distributed Algorithms on Graphs (WDAG). ## **Important Dates** **Paper registration:** May 27, 2026 **Submission deadline:** June 1, 2026 **Rebuttal phase:** July 21-25, 2026 **Notification:** August 5, 2026 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 – Distributed and concurrent data structures, replication and consistency – Distributed graph algorithms – Distributed machine learning and data science – Distributed operating systems, middleware, database systems – Experimental evaluation of distributed algorithms and systems – Fault tolerance, reliability, availability – Formal methods for distributed computing: verification, synthesis and testing – Game-theoretic and knowledge-based approaches to distributed computing – High-performance, cloud and grid computing – Internet and Web applications, social networks and recommendation systems – Mobile agents, autonomous distributed systems, swarm robotics – Multiprocessor and multi-core architectures and algorithms – Population protocols and chemical reaction networks – Quantum distributed algorithms – Security in distributed computing, cryptographic protocols – Self-stabilizing, self-organizing, and autonomous systems – 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. The title of a brief announcement must start with the phrase “Brief Announcement: “. 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 2026 submission that falls within their research expertise. Submission should be done via the following web page: https://disc26.hotcrp.com ## **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)** LLM usage policy for authors: * Only human individuals may be listed as authors. Generative AI tools or any other systems may not be credited as authors or co-authors. All listed authors must take full responsibility for the content of the submission. * The usage of generative AI tools to create new content is permitted, but its use must be explicitly and fully disclosed in the work. Authors may use the following format (if applicable): _AI Disclosure: We used [Tool Name] to assist with [Brief Description of Use]. The tool materially affected [Sections X and Y]. More details can be found in [Section Z]. The authors verified the correctness and originality of all content including references._ * Authors are accountable for the accuracy, originality, and integrity of all material in their paper, including any content produced with AI assistance. This includes responsibility for errors, plagiarism, misrepresentation, or fabricated content (e.g., “hallucinatory” references or fabricated data) generated by such tools. LLM usage policy for reviewers: * It has been shown that AI tools may be susceptible to hidden prompt injections embedded in submissions and designed to manipulate AI-based reviews or to gain information about the reviewer. * Reviewers must maintain confidentiality of submitted papers. It is forbidden to upload submissions or information related to submissions to any system that does not promise to maintain confidentiality, including LLMs or other generative AI tools. * Reviewers are accountable for all aspects of their review. [The above policies have been adopted from similar policies of the recent STOC/FOCS/SPAA/NeurIPS conferences.] Any questions about the LLM use policy should be directed to the PC chair, Keren Censor-Hillel (ckeren@cs.technion.ac.il). ## **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 2026. ## **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, Keren Censor-Hillel (ckeren@cs.technion.ac.il), or the SafeTOC representative for DISC, listed a 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 (tentative) information for PODC 2027: * **Tentative dates:** June 21 to 25, 2027 * **Local Organization:** Magnús M. Halldórsson (mmh@ru.is), Maxime Flin (maxime.flin@aalto.fi), Alexandre Nolin (alexandre.nolin@telecom-sudparis.eu) * **Venue:** Reykjavik University, Iceland (https://www.ru.is/en)

The schedule is tentative and will be updated later. ## Monday ### Workshop: **Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED)** **Time:** TBA **Website:** https://www.cse.chalmers.se/~elad/ApPLIED2026/ **Abstract:** TBA ### Tutorial: Grassroots Computing: Distributed Systems Without Global Resources **Organizers:** Idit Keidar (Technion), Andrew Lewis-Pye (London School of Economics), and Ehud Shapiro (London School of Economics and Weizmann Institute of Science) **Time:** After lunch (half-day) **Abstract:** TBA ## Friday ### Tutorial: Erasure Coding in Distributed Protocols **Organizers:** Vivian Bambert (University of Bern), Mariarosaria Barbaraci (University of Bern), Annalisa Cimatti (University of Bern), and Christian Cachin (University of Bern) **Time:** Morning **Abstract:** TBA

## Full papers FEAT: Fair and Efficient Adversarial Transaction Ordering Dakai Kang (University of California, Davis); Tien Tuan Anh Dinh (Deakin University); Mohammad Sadoghi (University of California, Davis) The Power of Strong Linearizability: the Difficulty of Consistent Refereeing Hagit Attiya (Technion); Armando Castañeda (Instituto de Matemáticas, Universidad Nacional Autónoma de México (UNAM)); Constantin Enea (Ecole Polytechnique, LIX) Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition Peter Davies-Peck (Durham University) Deterministic Distributed Algorithms for Short Disjoint Paths Mohsen Ghaffari (MIT); Hsin-Hao Su (Boston College) Ranking Opinions with Few States in Population Protocols Tom-Lukas Breitkopf, Julien Dallot (TU Berlin); Antoine El-Hayek (Institute of Science and Technology Austria); Stefan Schmid (TU Berlin) Distributed Renaming with Subquadratic Bits via Scalable Committee Election Sirui Bai, Xinyu Fu (Nanjing University); Yuyi Wang (CRRC Zhuzhou Institute & Tengen Intelligence Institute); Chaodong Zheng (Nanjing University) The Task Completion Problem and its Application to Crash-Resilient Computation Orr Fischer, Ran Gelles (Bar-Ilan University) Efficient Counting and Simulation in Content-Oblivious Rings Jérémie Chalopin (CNRS, Aix-Marseille université); Yi-Jun Chang (National University of Singapore); Giuseppe Antonio Di Luna (Sapienza University); Haoran Zhou (National University of Singapore) Reaching Univalency with Subquadratic Communication Andrew Lewis-Pye (London School of Economics) Undecided State Dynamics with Many Opinions Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik (King’s College London); Nobutaka Shimizu (Institute of Science Tokyo); Takeharu Shiraga (Chuo University) Order Statistics in Population Protocols via Simple Dynamics Niccolò D’Archivio (INRIA); Hind AlMahmoud (Kings College London); Emanuele Natale (CNRS, COATI, I3S, Université Côte d’Azur); Frederik Mallmann-Trenn (King’s College London) Distributed Treewidth Computation and Courcelle’s Theorem in the CONGEST Model Benjamín Jauregui (Universidad de Chile); Jason Li (CMU); Pedro Montealegre (Universidad Adolfo Ibáñez); Ioan Todinca (Université d’Orléans) Early-Stabilizing Counting Christoph Lenzen (Aalto University); Julian Loss (Ruhr University Bochum) Information-Theoretic Optimistic Verifiable Secret Sharing Chen-Da Liu-Zhang (Lucerne University of Applied Sciences and Arts); Martin Hirt, Emanuele Marsicano (ETH Zurich) Distributed Algorithms for Potential Problems Alkida Balliu, Thomas Boudier, Francesco d’Amore (Gran Sasso Science Institute); Fabian Kuhn (University of Freiburg); Dennis Olivetti (Gran Sasso Science Institute); Gustav Schmid (University of Freiburg); Jukka Suomela (Aalto University) Byzantine Consensus in the Partially Authenticated Setting Christoph Lenzen (Reykjavik University); Julian Loss (Ruhr University Bochum); Kecheng Shi (CISPA Helmholtz Center for Information Security); Benedikt Wagner (Ethereum Foundation) Two Fast Array Algorithms: Reinitializable and RMWable N. Efe Çekirge, Owen Chen, Siddhartha Jayanti, Evan Lucca (Dartmouth College) Distributed Stochastic Graph Algorithms Keren Censor-Hillel (Technion); Aditi Dudeja (The Chinese University of Hong Kong, Shenzhen); George Giakkoupis (Inria) Girth Approximations in the CONGEST Model Shiri Chechik (Tel Aviv University); Gur Lifshitz (Tel-Aviv University); Doron Mukhtar (Tel Aviv University) New Hardness Results for the LOCAL Model via a Simple Self-Reduction Alkida Balliu, Filippo Casagrande, Francesco d’Amore, Dennis Olivetti (Gran Sasso Science Institute) Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers John Augustine (Indian Institute of Technology Madras); Henning Hillebrandt (Paderborn University); Manish Kumar (Indian Institute of Technology Madras); Christian Scheideler, Julian Werthmann (Paderborn University) Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs Lélia Blin (IRIF, Université Paris Cité); Sylvain Gay (IRIF, Université Paris Cité, École Normale Supérieure); Isabella Ziccardi (IRIF, CNRS, Université Paris Cité) A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput Matthias Bentert (TU Berlin); Chen Avin (Ben Gurion University of the Negev); Stefan Schmid (TU Berlin) Nearly Quadratic Asynchronous Distributed Key Generation from Recursive Consensus Ittai Abraham (A16Z); Renas Bacho (CISPA Helmholtz Center for Information Security); Julian Loss (Ruhr University Bochum); Gilad Stern (Tel Aviv University, Israel) Fast Gossip-based Rumor Spreading Using Small Messages Fabien Dufoulon (Lancaster University); William K. Moses Jr. (Durham University); Gopal Pandurangan (University of Houston) Improved Bounds for Distributed Random Walks and Spanning Trees Gopal Pandurangan (University of Houston); Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel (University of Iowa) Fast Byzantine Total Order Broadcast Matteo Monti (HES-SO Valais-Wallis); Martina Camaioni (EPFL); Pierre-Louis Roman The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size Gustav Schmid (University of Freiburg); Alkida Balliu (Gran Sasso Science Institute); Fabian Kuhn (University of Freiburg); Dennis Olivetti (GSSI, L’Aquila, Italy); Sebastian Brandt (CISPA Helmholtz Center for Information Security); Timothe Picavet (LaBRI, Université de Bordeaux) Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience Hagit Attiya, Itay Flam (Technion); Jennifer Welch (TAMU) Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time Yuichi Sudo (Hosei University) Simple and Efficient Randomized Wait-Free Locks Kahbod Aeini, Dante Bencivenga (University of Calgary); George Giakkoupis (INRIA Rennes); Philipp Woelfel (University of Calgary, Canada) Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Near-optimal Resilience and Õ(sqrt(n))-bit per Party Hanwen Feng, Tiancheng Mai, Qiang Tang (The University of Sydney) Conflict-Freedom as a Progress Condition Petr Kuznetsov (Télécom Paris, Institut Polytechnique Paris); Pierre Sutra (Télécom SudParis, Institut Polytechnique de Paris); Guillermo Toyos-Marfurt (Télécom Paris, Institut Polytechnique de Paris) Gradient Clock Synchronization with Practically Constant Local Skew Christoph Lenzen (CISPA Helmholtz Center for Information Security) Meta-Theorems for Cuttable Distributed Problems Marthe Bonamy (LaBRI – CNRS, University of Bordeaux); Cyril Gavoille (LaBRI – University of Bordeaux); Avinandan Das, Jukka Suomela (Aalto University); Timothé Picavet (LaBRI – University of Bordeaux); Alexandra Wesolek (LaBRI – CNRS, University of Bordeaux) Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience Diana Ghinea (Lucerne University of Applied Sciences and Arts); Darya Melnyk, Tijana Milentijević (TU Berlin) Distinct Gathering and the Virtue of Self-Consistency Fabian Frei (MIT); Koichi Wada (Hosei U. Japan) From Few to Many Faults: Optimal Adaptive Byzantine Agreement Andrei Constantinescu, Marc Dufay, Anton Paramonov, Roger Wattenhofer (ETH Zurich) Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT Ittai Abraham (A16Z); Sourav Das (Category Labs); Yuval Efron (Ritual); Jovan Komatovic (Category Labs) Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes Arnold Filtser, Orr Fischer (Bar-Ilan University) Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs Marc Fuchs (University of Freiburg); Diana Ghinea (Lucerne University of Applied Sciences and Arts); Zahra Parsaeian (University of Freiburg); Joel Rybicki (Humboldt University of Berlin) Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model Vassos Hadzilacos, Myles Thiessen, Sam Toueg (University of Toronto) ## Brief Announcements Exponential Quantum Advantage for Message Complexity in Distributed Algorithms Maël Luce (Nagoya University); Mathieu Roget (Université Aix-Marseille); Joseph Marchand (Ecole normale supérieure Paris-Saclay); François Le Gall (Nagoya University) Is a LOCAL Algorithm Computable? Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen (Aalto University); Diep Luong-Le (Columbia University); Augusto Modanese (CISPA Helmholtz Center for Information Security); Jukka Suomela (Aalto University) Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience Michael Yiqing Hu, Hong Yao Alvin Yan, Jialin Li (National University of Singapore) Delay-Optimal Transaction Order Fairness Zhuo Cai (Hong Kong University of Science and Technology); Amir K. Goharshady (University of Oxford) Byzantine Machine Learning, MultiKrum and an Optimal Notion of Robustness Gilles Bareilles (École Polytechnique); Wassim Bouaziz (Mistral AI); Julien Fageot (EPFL); El-Mahdi El-Mhamdi (École Polytechnique) Communication Efficient Byzantine Agreement with Predictions Muhammad Ayaz Dzulfikar, Seth Gilbert (National University of Singapore) Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity Ashish Choudhury, Madhav Natarajan H (IIIT Bangalore) It Does Not Matter How You Define Locally Checkable Labelings Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela (Aalto University) DéjàVu: A Minimalistic Mechanism for Distributed Plurality Consensus Francesco d’Amore (Gran Sasso Science Institute); Niccolò D’Archivio (Inria); George Giakkoupis (Inria Rennes); Frédéric Giroire (CNRS/ Université Côte d’Azur); Emanuele Natale (CNRS, COATI, I3S, Université Côte d’Azur) Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems Vijay K. Garg (The University of Texas at Austin); Rohan Garg (Purdue University) What Is Agreement About if Not Common Knowledge? Or David, Yoram Moses (Technion) Distributed Statistical Zero-Knowledge Proofs via Sumcheck Benjamín Jauregui (Universidad de Chile & Université Paris Cité); Masayuki Miyamoto (University of Tsukuba) A Space-Efficient Lock-Free Linear-Probing Hash Table Hagit Attiya (Technion); Rotem Oshman (Tel Aviv University and NYU); Noa Schiller (Tel Aviv University) 2-Coloring Cycles in One Round Maxime Flin, Alesya Raevskaya, Ronja Stimpert, Jukka Suomela, Qingxin Yang (Aalto University) On Energy Complexity and Multi-Instance Computation in the Congested Clique Dominick Banasik, Varsha Dani (Rochester Institute of Technology) Toward Uniform Content-Oblivious Leader Election on General Graphs Fabian Frei (MIT); Ran Gelles (Bar-Ilan University); Ahmed Ghazy (CISPA Helmholtz Center for Information Security); Alexandre Nolin (Télécom SudParis) Deterministic Edge Coloring with few Colors in CONGEST Tijn de Vos, Yannic Maus (TU Graz); Joakim Blikstad (Centrum Wiskunde & Informatica (CWI)) Sinkless Orientation Made Trivial Alexandre Nolin (Télécom SudParis) Fast Deterministic Distributed Degree Splitting Yannic Maus (TU Graz); Alexandre Nolin (Télécom SudParis); Florian Schager (TU Graz) Subcubic Coin Tossing in Asynchrony without Setup Mose Mizrahi, Roger Wattenhofer (ETH Zurich) Limit Laws for Consensus Protocols on the Complete Graph Julian Becker, Konstantinos Panagiotou (LMU Munich) Distributed Non-Interactive Zero-Knowledge Proofs Alex Bredariol Grilo (CNRS, Sorbonne Université); Ami Paz (LISN, CNRS, Paris-Saclay University); Mor Perry (The Academic College of Tel-Aviv-Yaffo) BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs Fatima Elsheimy (Yale University); Simon Kamp (Ruhr University Bochum)

**PODC 2026** , with support from **ACM SIGACT** , **ACM SIGOPS** , and other PODC sponsors, encourages participation in the Symposium and is pleased to offer a limited number of travel grants to support attendance. Applicants will be asked to provide: * A short statement of purpose explaining the relevance of PODC 2026 to their research; * An estimated travel and accommodation budget; * Information on student status (if applicable); * Confirmation of paper authorship and presentation role; * A letter of support from advisor (if applicable). **Applicants may apply usingthis form.** The grants are primarily intended to reimburse **travel and accommodation expenses**. This year, limited support may also be available for **childcare expenses**. Participants requesting childcare support will need to make their own childcare arrangements, as the conference does not provide childcare services. Awards will be provided as reimbursements **after the conference**. Recipients will be required to submit receipts and any additional documentation required by ACM for processing. Eligible expenses must comply with ACM reimbursement policy. We especially encourage applications from undergraduate and graduate students, with priority given to those who are presenting or co-authoring a PODC 2026 paper. Additional consideration may be given to applicants demonstrating financial need or coming from under-resourced institutions/countries. Geographic equity will be taken into consideration. Depending on availability of funds, limited support may also be extended to postdoctoral researchers or faculty members with insufficient travel funding. These grants are only available to participants for whom **PODC is the primary conference** being attended (participants that choose PODC as their primary conference in the registration process). Recipients must register for **PODC 2026** in order to receive support. Participants whose primary conference is **SPAA** or **ICALP** should apply for support through those conferences. If you have any questions, please contact diana.ghinea at hlsu.ch. ## **Deadline** All deadlines are at **23:59 AoE**. Application deadline: **May 16, 2026** Notification: **May 21, 2026**

PODC–DISC Community | ACM Symposium on Principles of Distributed Computing — International Symposium on Distributed Computing

40th International Symposium on Distributed Computing November 9-13, 2026 Rome, Italy https://www.disc-conference.org/wp/disc2026/ ## **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 **41 years ago** , in 1985, as a biannual International Workshop on Distributed Algorithms on Graphs (WDAG). ## **Important Dates** **Paper registration:** May 27, 2026 **Submission deadline:** June 1, 2026 **Rebuttal phase:** July 21-25, 2026 **Notification:** August 5, 2026 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 – Distributed and concurrent data structures, replication and consistency – Distributed graph algorithms – Distributed machine learning and data science – Distributed operating systems, middleware, database systems – Experimental evaluation of distributed algorithms and systems – Fault tolerance, reliability, availability – Formal methods for distributed computing: verification, synthesis and testing – Game-theoretic and knowledge-based approaches to distributed computing – High-performance, cloud and grid computing – Internet and Web applications, social networks and recommendation systems – Mobile agents, autonomous distributed systems, swarm robotics – Multiprocessor and multi-core architectures and algorithms – Population protocols and chemical reaction networks – Quantum distributed algorithms – Security in distributed computing, cryptographic protocols – Self-stabilizing, self-organizing, and autonomous systems – 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. The title of a brief announcement must start with the phrase “Brief Announcement: “. 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 2026 submission that falls within their research expertise. Submission should be done via the following web page: https://disc26.hotcrp.com ## **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, Keren Censor-Hillel (ckeren@cs.technion.ac.il). ## **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 2026. ## **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, Keren Censor-Hillel (ckeren@cs.technion.ac.il), or the SafeTOC representative for DISC, listed a 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.

40th International Symposium on Distributed Computing November 9-13, 2026 Rome, Italy https://www.disc-conference.org/wp/disc2026/ ## **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 **41 years ago** , in 1985, as a biannual International Workshop on Distributed Algorithms on Graphs (WDAG). ## **Important Dates** **Paper registration:** May 27, 2026 **Submission deadline:** June 1, 2026 **Rebuttal phase:** July 21-25, 2026 **Notification:** August 5, 2026 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 – Distributed and concurrent data structures, replication and consistency – Distributed graph algorithms – Distributed machine learning and data science – Distributed operating systems, middleware, database systems – Experimental evaluation of distributed algorithms and systems – Fault tolerance, reliability, availability – Formal methods for distributed computing: verification, synthesis and testing – Game-theoretic and knowledge-based approaches to distributed computing – High-performance, cloud and grid computing – Internet and Web applications, social networks and recommendation systems – Mobile agents, autonomous distributed systems, swarm robotics – Multiprocessor and multi-core architectures and algorithms – Population protocols and chemical reaction networks – Quantum distributed algorithms – Security in distributed computing, cryptographic protocols – Self-stabilizing, self-organizing, and autonomous systems – 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. The title of a brief announcement must start with the phrase “Brief Announcement: “. 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 2026 submission that falls within their research expertise. Submission should be done via the following web page: https://disc26.hotcrp.com ## **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, Keren Censor-Hillel (ckeren@cs.technion.ac.il). ## **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 2026. ## **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, Keren Censor-Hillel (ckeren@cs.technion.ac.il), or the SafeTOC representative for DISC, listed a 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.

The 45th ACM Symposium on Principles of Distributed Computing July 6-10, 2026, Royal Holloway, University of London ## Dates All deadlines are at 23:59 AoE. * Abstract submission: February 11, 2026 * Full paper submission: February 16, 2026 * Notification: April 29, 2026 ## Submission page Coming soon… ## Scope The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to the following (in alphabetical order). * biological distributed algorithms and systems * coding and reliable communication * combinatorics and topology of distributed computing * communication networks * concurrency, synchronization, and persistence * design and analysis of concurrent and distributed algorithms and data structures * distributed and cloud storage, replication and consistency * distributed computing for machine learning, artificial intelligence and big data * distributed graph algorithms * distributed ledgers and decentralized finance protocols * distributed operating systems, middleware, and databases * distributed resource management and scheduling * fault-tolerance, reliability, self-organization, and self-stabilization * game-theoretic approaches to distributed computing * high-performance, cluster, cloud and grid computing * internet applications * lower bounds and impossibility results for distributed computing * mobile computing, population protocols and autonomous agents * models and languages for distributed computing * multiprocessor and multi-core architectures and algorithms * peer-to-peer systems, overlay networks, and social networks * quantum and optics based distributed computing * security and cryptography in distributed computing * specifications, semantics, verification, and formal methods for distributed systems * system-on-chip and network-on-chip architectures * transactional memory * wireless, sensor, mesh, and ad hoc networks ## Paper submission A submission should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the submitted work, explicitly and precisely state the submission’s main contributions, and discuss the key ideas and methods used to support the main claims. Authors should strive to ensure submissions are accessible to a broad audience, while also having sufficient details for experts in the area. **Regular Papers** : A regular paper must report on original research that has not been previously published. It is not permitted to submit the same material concurrently to journals or conferences with proceedings. Format and length requirements for submissions are stated below. **Brief Announcements** : A brief announcement may describe work in progress or work presented elsewhere. A brief announcement may also report on original research results that can be fully presented in the limited space available. The title of a brief announcement must begin with “Brief Announcement: ”. **Use of AI tools** : If any AI tools were used in preparing a submission (beyond copyediting or use of internet search tools), the nature of the usage should be disclosed in the submission for the sake of transparency. If AI tools are used, authors remain accountable for the content of the paper, including avoiding plagiarism and providing appropriate citations of sources. **Submission format** : All submissions should be typeset using 11-point or larger fonts, in a single-column, single-spaced format with ample spacing throughout and 1-inch margins all around, on letter-size (8 1/2 x 11 inch) paper. Alternatively, submissions can be prepared using the official ACM Master article LaTeX template acmart.cls, version 1.80 or greater, using the following documentclass instruction: \documentclass[acmsmall,nonacm,anonymous]{acmart} The template is available at https://www.acm.org/publications/proceedings-template. The following instructions equally apply in both cases. Regular submissions should start with a title page consisting of the title of the submission, no author information (see paragraph on double-blind reviewing below), and a brief abstract summarizing the submission’s contributions. **There is no page limit and authors are encouraged to use the “full version” of their paper as the submission.** Each submission should contain within the initial **10 pages** following the title page a clear presentation of the merits of the submission, including a discussion of the submission’s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. A submission should include all information necessary for an expert to fully evaluate the paper’s central claims, including full proofs and experimental results, where applicable. **Although there is no bound on the length of a submission, material other than the abstract and the first 10 pages will be read at the committee’s discretion.** Authors are encouraged to put the references at the very end of the submission. **Brief announcement submissions must have a length of at most 5 pages including title, abstract, and references.** Submissions not conforming to the rules stated in this call and submissions outside the scope of the conference may be rejected without consideration. Best practices for citations: Alphabetical orderings of authors can lead to biases. Therefore, authors are encouraged to avoid “et al.” in citations, and instead mention all author names. ## Awards All regular papers are eligible for the best paper award. A regular paper is eligible for the best student paper award if the author(s) principally responsible for the paper’s contributions are full-time students at the time of submission. The program committee may decline to make these awards or may split them. ## Double-blind reviewing The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors’ names, affiliations, and email addresses should not appear anywhere in the submission. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the submission more difficult. In particular, important references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their submission as they normally would. For example, authors may post drafts of their submissions on the web, submit them to arXiv, and give talks on their research ideas. Authors with further questions on double-blind reviewing are encouraged to contact the PC chair by email. ## Conflict of interest Indications of conflicts of interest will be required in the submission form. 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. (It is not required that the incident be reported.) * 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 not listed above, contact the PC chair or one of the Theory of Computing Advocates affiliated with this conference (Faith Ellen and Idit Keidar). The PC chair may request that a ToC advocate confidentially verify the reason for a conflict of interest. ## Publication Accepted regular papers of up to 10 pages and brief announcements of up to 3 pages in two-column ACM proceedings format will be included in the conference proceedings. They must be formatted with the ACM Master templates using \documentclass[sigconf]{acmart}. If more space is needed for an accepted paper than is available in the proceedings, a full version must be made available publicly, e.g. on arXiv, by the due date for the proceedings version, and the proceedings version must refer to the full version. The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. It is expected that papers that are published at PODC 2026 will be presented by one of the authors in person at the conference. In exceptional circumstances (e.g., because of visa issues), a limited number of exceptions can be approved by the PC chair. A paid conference registration by one of the authors of each accepted paper will be required in any case. Extended and revised versions of selected papers will be considered for a special issue of the journal Distributed Computing. Up to two selected papers will be considered for publication in the Journal of the ACM. ## **Open Access and Article Processing Charge** Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including the PODC 2026 conference proceedings, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). If a corresponding author’s institution is on the list of institutions participating in ACM Open, then there will be no APC. Otherwise, each paper will require an APC of •$250 for ACM/SIG members, or •$350 for non-members, unless the authors qualify for a financial waiver. For information on waivers and discounts, see https://www.acm.org/publications/policies/policy-on-discretionary-open-access-apc-waivers. Geographic waivers and discounts apply to authors from certain countries. Discretionary waivers are rare and are granted based on specific criteria set by ACM.

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.

## **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).

<p class="has-text-align-center">The 44th ACM Symposium on Principles of Distributed Computing<br/>June 16-20, 2025, Huatulco, Mexico</p> <p></p> <p>All deadlines are at 23:59 AoE.</p> <ul class="wp-block-list"> <li>Abstract submission: February 4, 2025</li> <li>Full paper submission: February 8, 2025</li> <li>Notification: April 17, 2025</li> </ul> <h2 class="wp-block-heading">Scope</h2> <p>The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to the following:</p> <ul class="wp-block-list"> <li>biological distributed algorithms and systems</li> <li>blockchain and decentralized finance protocols</li> <li>coding and reliable communication</li> <li>communication networks</li> <li>combinatorics and topology of distributed computing</li> <li>concurrency, synchronization, and persistence</li> <li>design and analysis of distributed algorithms</li> <li>distributed and cloud storage</li> <li>distributed and concurrent data structures</li> <li>distributed computation for large-scale data</li> <li>distributed graph algorithms</li> <li>distributed machine learning and artificial intelligence</li> <li>distributed operating systems, middleware, databases</li> <li>distributed resource management and scheduling</li> <li>fault-tolerance, reliability, self-organization, and self-stabilization</li> <li>game-theoretic approaches to distributed computing</li> <li>high-performance, cluster, cloud and grid computing</li> <li>internet applications</li> <li>languages, verification, and formal methods for distributed systems</li> <li>lower bounds and impossibility results for distributed computing</li> <li>mobile computing and autonomous agents</li> <li>multiprocessor and multi-core architectures and algorithms</li> <li>peer-to-peer systems, overlay networks, and social networks</li> <li>population protocols</li> <li>quantum and optics based distributed algorithms</li> <li>replication and consistency</li> <li>security and cryptography in distributed computing</li> <li>specifications and semantics</li> <li>system-on-chip and network-on-chip architectures</li> <li>transactional memory</li> <li>wireless, sensor, mesh, and ad hoc networks</li> </ul> <h2 class="wp-block-heading">Paper submission</h2> <p>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.</p> <p><strong>Regular Papers:</strong> A regular paper must report on original research that has not been previously published. It is not permitted to submit the same material concurrently to journals or conferences with proceedings. Format and length requirements for submissions are stated below. All ideas necessary for an expert to fully verify the central claims in a paper, including full proofs and experimental results, where applicable, should be included in the submission.</p> <p><strong>Brief Announcements:</strong> A brief announcement may describe work in progress or work presented elsewhere. A brief announcement may also report on original research results that can be fully presented in the limited space available. The title of a brief announcement must begin with “Brief Announcement: ”.</p> <p><strong>Submission format:</strong> All submission should be typeset using 11-point or larger fonts, in a single-column, single-space (between lines) format with ample spacing throughout and 1-inch margins all around, on letter-size (8 1/2 x 11 inch) paper.</p> <p>Alternatively, papers can also be submitted by using the official ACM Master article LaTeX template acmart.cls, version 1.80 or greater, using the following documentclass instruction:<br/><br/>\documentclass[acmsmall,nonacm.anonymous]{acmart}</p> <p>The template is available at <a href="https://www.acm.org/publications/proceedings-template">https://www.acm.org/publications/proceedings-template</a>.</p> <p>The following instructions equally apply in both cases.<br/><br/>Regular submissions should start with a title page consisting of the title of the paper, no author information (see paragraph on double-blind reviewing below), and an abstract of a few paragraphs summarizing the paper’s contributions. <strong>There is no page limit and authors are encouraged to use the “full version” of their paper as the submission.</strong> Each submission should contain within the initial <strong>10 pages</strong> following the title page 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. Each submission must contain full proofs of all claims in the paper. <strong>Although there is no bound on the length of a submission, material other than the abstract, table of contents, and the first 10 pages will be read at the committee’s discretion.</strong> Authors are encouraged to put the references at the very end of the submission.<br/><br/><strong>Brief announcement submissions must have a length of at most 5 pages including title, abstract, and the references.</strong></p> <p>Submissions not conforming to the rules stated in this call, as well as papers outside the scope of the conference, may be rejected without consideration.<br/><br/>Best practices for citations: Alphabetical orderings of authors can lead to biases. Therefore, authors are encouraged to avoid “et al.” in citations, and instead mention all author names.</p> <h2 class="wp-block-heading">Double-blind reviewing</h2> <p>The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors’ names, affiliations, and email addresses should not appear anywhere in the submission. 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. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. Authors with further questions on double-blind reviewing are encouraged to contact the PC chair by email.</p> <h2 class="wp-block-heading">Conflict of interest</h2> <p>Indications of conflicts of interest will be required in the submission form.<br/>A conflict of interest is limited to the following:</p> <ul class="wp-block-list"> <li>A family member or close friend.</li> <li>A Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years.</li> <li>A person with the same affiliation.</li> <li>A person involved in an alleged incident of harassment. (It is not required that the incident be reported.)</li> <li>Frequent collaborators, or collaborators who have jointly published papers within the last two years.</li> </ul> <p>If you feel that you have a valid reason for a conflict of interest not listed above, contact the PC chair or one of the Theory of Computing Advocates affiliated with this conference (Faith Ellen and Idit Keidar). The PC chair may request that a ToC advocate confidentially verify the reason for a conflict of interest.</p> <h2 class="wp-block-heading">Publication</h2> <p>Accepted regular papers of up to 10 pages and brief announcements of up to 3 pages in two-column ACM proceedings format will be included in the conference proceedings. They must be formatted with the ACM Master templates using</p> <p>\documentclass[sigconf]{acmart}.<br/><br/>If more space than available in the proceedings for an accepted paper is needed, a full version must be available publicly, e.g. on arXiv, by the due date for the proceedings version, and the proceedings version must refer to this.</p> <p>The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.</p> <p>It is expected that papers that are published at PODC 2025 are presented by one of the authors in person at the conference. In exceptional circumstances (e.g., because of visa issues), a limited number of exceptions can be approved by the PC chair. A paid conference registration by one of the authors of each accepted paper will be required in any case.</p> <p>Extended and revised versions of selected papers will be considered for a special issue of the journal Distributed Computing. Up to two selected papers will be considered for publication in the Journal of the ACM.<br/><br/><br/></p>

<p>The <a href="https://spaa.acm.org/">37th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’25)</a> will run on July 28—August 1, 2025 in Portland, Oregon.</p> <p>Submissions are sought in all areas of parallel and distributed computing, including algorithms, data structures, computational models, complexity theory, architectures, performance engineering, languages, runtime systems, compilers, programming systems, and networking systems. Papers that are purely theoretical, purely experimental, or contain both theory and experiments are welcome.  Topics of interest include, but are not limited to:</p> <ul> <li><em>Parallel and Distributed Algorithms</em></li> <li><em>Parallel, Concurrent, and Distributed Data Structures</em></li> <li><em>Models for Parallel and Distributed Computing</em></li> <li><em>Parallel and Distributed Architectures</em></li> <li><em>Parallel Programming Languages</em></li> <li><em>System Software for Parallel and Concurrent Programming (including but not limited to Runtime, Compilers, and Tools)</em></li> <li><em>Parallel Programming Frameworks and Domain-Specific Languages</em></li> <li><em>Management of Massive Data Sets</em></li> <li><em>Transactional Memory Hardware and Software</em></li> <li><em>Supercomputer Architecture and Computing</em></li> <li><em>Routing and Information Dissemination</em></li> <li><em>Peer-to-Peer Systems</em></li> <li><em>Mobile, Ad-Hoc, and Sensor Networks</em></li> <li><em>Synergy of Parallelism in Algorithms, Programming and Architecture</em></li> <li><em>Memory or I/O-efficient algorithms</em></li> <li><em>Parallel Complexity Theory</em></li> <li><em>Green Computing &amp; Power-Efficient Architectures</em></li> <li><em>Instruction Level Parallelism and VLSI</em></li> <li><em>Scheduling Algorithms for Parallel Machines</em></li> <li><em>Parallelism in Quantum Computing</em></li> </ul> <h3 class="wp-block-heading" id="important-deadlines">Important Deadlines:</h3> <figure class="wp-block-table"><table><tbody><tr><td>Abstract registration: </td><td>February 21, 2025 11:59pm AoE</td></tr><tr><td>Full papers submission: </td><td>February 28, 2025 11:59pm AoE</td></tr><tr><td>Rebuttal Period:</td><td>April 22–29, 2025 11:59pm AoE</td></tr><tr><td>Notification: </td><td>May 20, 2025</td></tr><tr><td>Camera-ready: </td><td>June 20, 2025</td></tr></tbody></table></figure> <h3 class="wp-block-heading" id="spaa-treasurer">Program Committee</h3> <p>Umut Acar<br/>Jatin Arora<br/>Ariful Azad<br/>Jonathan Baker<br/>George Biros<br/>Guy Blelloch<br/>Aydin Buluc <strong>(Area Chair)</strong><br/>Arthur Chargueraud<br/>Rezaul Chowdhury<br/>Albert Cohen<br/>Laxman Dhulipala<br/>Peter Dinda <strong>(Area Chair)</strong><br/>Yongshan Ding <strong>(Area Chair)</strong><br/>Panagiota Fatourou<br/>Wu Feng<br/>Jeremy Fineman <strong>(Area Chair)</strong><br/>Matthew Fluet<br/>Ian Foster<br/>Pierre Fraigniaud<br/>Phil Gibbons<br/>Seth Gilbert<br/>Mike Goodrich<br/>Giulia Guidi<br/>MohammadTaghi Hajiaghayi<br/>Mert Hidayetoglu<br/>Changwan Hong<br/>Sungjin Im<br/>Zhihao Jia <strong>(Area Chair)</strong><br/>Rob Johnson<br/>Temesghen Kahsai<br/>William Kuszmaul<br/>Doug Lea<br/>Jaejin Lee<br/>Angelina Lee <strong>(Area Chair)</strong><br/>Jiajia Li<br/>Quanquan Liu<br/>Pengyu Liu<br/>Yuan Liu<br/>Magdalen Manohar<br/>John Martyn<br/>Ben Moseley<br/>William Moses<br/>Eda Oktay<br/>P. Sadayappan<br/>Ivy Peng<br/>Ali Pinar<br/>Vijaya Ramachandran<br/>Bin Ren<br/>Nodari Sitchinava<br/>Yihan Sun<br/>Sean Treichler<br/>Jeffrey Vetter<br/>Michael Vollmer<br/>Yuanhao Wei<br/>Sam Westrick <strong>(Area Chair)</strong><br/>Helen Xu<br/>Rohan Yadav<br/>Gu Yan<br/>Jidong Zhai<br/>Hengyun Zhou</p> <h3 class="wp-block-heading">Junior Program Committee</h3> <p>Mingkuan Xu</p> <h3 class="wp-block-heading">Submission Overview:</h3> <p>Please indicate in the title of your submission whether this is a regular paper or a brief announcement. All regular rejected papers will automatically be considered for brief announcements. Titles of regular papers that should not be considered for this option should mention “full paper only” after the title. Submissions must use the final ACM “sigconf” format from <a href="https://www.acm.org/publications/proceedings-template">https://www.acm.org/publications/proceedings-template</a>. More details are at <a href="https://spaa.acm.org/submission-guidelines/">https://spaa.acm.org/submission-guidelines/</a>.</p> <h4 class="wp-block-heading">Regular Papers:</h4> <p>A regular paper submission must report on original research that has not been previously or concurrently published.  Submitted manuscripts may not exceed ten (10) single-spaced double-column pages excluding bibliography. All necessary details to substantiate the main claims of the paper should be included either in the body of the paper or in a supplementary material. However, the reviewers are not obligated to read the supplementary material.  </p> <h4 class="wp-block-heading">Brief Announcements:</h4> <p>Examples of good brief announcements include: work in progress, announcement of tools/libraries, challenge problems posted to the community, and corrections to earlier results. Brief announcements may also include smaller results of interest. Submitted manuscripts may not exceed three (3) single-spaced double-column pages for brief announcements including bibliography.</p> <h4 class="wp-block-heading">Theory vs. Experiments </h4> <p>A submission naturally falls into one of the following three categories. </p> <p><strong>A.</strong> Theory (main contributions are theoretical)<br/><strong>B.</strong> Experiments (main contributions are experimental)<br/><strong>C.</strong> Theory and Experiments (main contributions are a mix of theory and experiments)</p> <p>To help assign suitable reviewers, please indicate which category the submission belongs to during the submission process.</p> <p></p> <h3 class="wp-block-heading">Double-Blind Policy:</h3> <p>SPAA 2025 will employ a lightweight double-blind review process. That means, the submission should omit authors’ names, affiliations, and contact information. In addition, if the submission refers to prior work done by the authors, the reference should be made in the third person. Any supplemental materials, if applicable, should also be anonymized. However, authors are free to disseminate their ideas or draft versions of the paper as they normally would, such as submitting them to arXiv or giving talks on their research ideas. The reviewers will be asked to refrain from actively looking for the identity of the authors via web search.</p> <h3 class="wp-block-heading">Conflict of Interest Policy:</h3> <p>To ensure a fair and high-quality reviewing process we ask ALL authors of a submitted paper to register their conflicts with the PC members at the submission site.  The following categories are considered as a conflict of interest:</p> <ul> <li>Academic advisor or advisee (with no time limit)</li> <li>Postdoctoral mentor or mentee (with no time limit) </li> <li>Collaborators within the past three years, including a joint research or development project, a joint paper, or a funding relationship</li> <li>Members of the same institution within the past 3 years</li> <li>Family members or close friends</li> <li>Someone involved in an alleged incident of harassment (not required that the incident be reported)</li> <li>Anyone whose relationship with an author would prevent the reviewer from being objective in his/her assessment</li> </ul> <p>Note that if the program chair has reason to doubt the validity of the claim of conflict of interest, then they may request that a ToC advocate confidentially verify the reason for the conflict.  Falsely declared conflicts (i.e., do not satisfy one of the listed reasons) risk rejection without consideration of merit.  If an author believes that he or she has a valid reason for a conflict of interest not listed above or if he or she is uncertain, the author is encouraged to contact the program chair.</p>

<p class="has-text-align-center">The 44th ACM Symposium on Principles of Distributed Computing<br/>June 16-20, 2025, Huatulco, Mexico</p> <p></p> <p>All deadlines are at 23:59 AoE.</p> <ul class="wp-block-list"> <li>Abstract submission: February 4, 2025</li> <li>Full paper submission: February 8, 2025</li> <li>Notification: April 17, 2025</li> </ul> <h2 class="wp-block-heading">Scope</h2> <p>The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to the following:</p> <ul class="wp-block-list"> <li>biological distributed algorithms and systems</li> <li>blockchain and decentralized finance protocols</li> <li>coding and reliable communication</li> <li>communication networks</li> <li>combinatorics and topology of distributed computing</li> <li>concurrency, synchronization, and persistence</li> <li>design and analysis of distributed algorithms</li> <li>distributed and cloud storage</li> <li>distributed and concurrent data structures</li> <li>distributed computation for large-scale data</li> <li>distributed graph algorithms</li> <li>distributed machine learning and artificial intelligence</li> <li>distributed operating systems, middleware, databases</li> <li>distributed resource management and scheduling</li> <li>fault-tolerance, reliability, self-organization, and self-stabilization</li> <li>game-theoretic approaches to distributed computing</li> <li>high-performance, cluster, cloud and grid computing</li> <li>internet applications</li> <li>languages, verification, and formal methods for distributed systems</li> <li>lower bounds and impossibility results for distributed computing</li> <li>mobile computing and autonomous agents</li> <li>multiprocessor and multi-core architectures and algorithms</li> <li>peer-to-peer systems, overlay networks, and social networks</li> <li>population protocols</li> <li>quantum and optics based distributed algorithms</li> <li>replication and consistency</li> <li>security and cryptography in distributed computing</li> <li>specifications and semantics</li> <li>system-on-chip and network-on-chip architectures</li> <li>transactional memory</li> <li>wireless, sensor, mesh, and ad hoc networks</li> </ul> <h2 class="wp-block-heading">Paper submission</h2> <p>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.</p> <p><strong>Regular Papers:</strong> A regular paper must report on original research that has not been previously published. It is not permitted to submit the same material concurrently to journals or conferences with proceedings. Format and length requirements for submissions are stated below. All ideas necessary for an expert to fully verify the central claims in a paper, including full proofs and experimental results, where applicable, should be included in the submission.</p> <p><strong>Brief Announcements:</strong> A brief announcement may describe work in progress or work presented elsewhere. A brief announcement may also report on original research results that can be fully presented in the limited space available. The title of a brief announcement must begin with “Brief Announcement: ”.</p> <p><strong>Submission format:</strong> All submission should be typeset using 11-point or larger fonts, in a single-column, single-space (between lines) format with ample spacing throughout and 1-inch margins all around, on letter-size (8 1/2 x 11 inch) paper.</p> <p>Alternatively, papers can also be submitted by using the official ACM Master article LaTeX template acmart.cls, version 1.80 or greater, using the following documentclass instruction:<br/><br/>\documentclass[acmsmall,nonacm.anonymous]{acmart}</p> <p>The template is available at <a href="https://www.acm.org/publications/proceedings-template">https://www.acm.org/publications/proceedings-template</a>.</p> <p>The following instructions equally apply in both cases.<br/><br/>Regular submissions should start with a title page consisting of the title of the paper, no author information (see paragraph on double-blind reviewing below), and an abstract of a few paragraphs summarizing the paper’s contributions. <strong>There is no page limit and authors are encouraged to use the “full version” of their paper as the submission.</strong> Each submission should contain within the initial <strong>10 pages</strong> following the title page 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. Each submission must contain full proofs of all claims in the paper. <strong>Although there is no bound on the length of a submission, material other than the abstract, table of contents, and the first 10 pages will be read at the committee’s discretion.</strong> Authors are encouraged to put the references at the very end of the submission.<br/><br/><strong>Brief announcement submissions must have a length of at most 5 pages including title, abstract, and the references.</strong></p> <p>Submissions not conforming to the rules stated in this call, as well as papers outside the scope of the conference, may be rejected without consideration.<br/><br/>Best practices for citations: Alphabetical orderings of authors can lead to biases. Therefore, authors are encouraged to avoid “et al.” in citations, and instead mention all author names.</p> <h2 class="wp-block-heading">Double-blind reviewing</h2> <p>The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors’ names, affiliations, and email addresses should not appear anywhere in the submission. 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. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. Authors with further questions on double-blind reviewing are encouraged to contact the PC chair by email.</p> <h2 class="wp-block-heading">Conflict of interest</h2> <p>Indications of conflicts of interest will be required in the submission form.<br/>A conflict of interest is limited to the following:</p> <ul class="wp-block-list"> <li>A family member or close friend.</li> <li>A Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years.</li> <li>A person with the same affiliation.</li> <li>A person involved in an alleged incident of harassment. (It is not required that the incident be reported.)</li> <li>Frequent collaborators, or collaborators who have jointly published papers within the last two years.</li> </ul> <p>If you feel that you have a valid reason for a conflict of interest not listed above, contact the PC chair or one of the Theory of Computing Advocates affiliated with this conference (Faith Ellen and Idit Keidar). The PC chair may request that a ToC advocate confidentially verify the reason for a conflict of interest.</p> <h2 class="wp-block-heading">Publication</h2> <p>Accepted regular papers of up to 10 pages and brief announcements of up to 3 pages in two-column ACM proceedings format will be included in the conference proceedings. They must be formatted with the ACM Master templates using</p> <p>\documentclass[sigconf]{acmart}.<br/><br/>If more space than available in the proceedings for an accepted paper is needed, a full version must be available publicly, e.g. on arXiv, by the due date for the proceedings version, and the proceedings version must refer to this.</p> <p>The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.</p> <p>It is expected that papers that are published at PODC 2025 are presented by one of the authors in person at the conference. In exceptional circumstances (e.g., because of visa issues), a limited number of exceptions can be approved by the PC chair. A paid conference registration by one of the authors of each accepted paper will be required in any case.</p> <p>Extended and revised versions of selected papers will be considered for a special issue of the journal Distributed Computing. Up to two selected papers will be considered for publication in the Journal of the ACM.<br/><br/><br/></p>