Sign in

iiinova is part of the Atmosphere — an open, public network where you own your identity.

Jukka Suomela

@JukkaSuomela.mastodon.social.ap.brid.gy
7 followers 1 following 26 posts

Professor, Department of Computer Science, Aalto University. Research interests: theory of distributed and parallel computing. jukkasuomela.fi Posts in […] 🌉 bridged from ⁂ mastodon.social/@JukkaSuomela, follow @ap.brid.gy to interact

PostsRepliesMedia
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 10/10/2026
Here are the slides of my keynote talk from SSS 2026 in Gothenburg: jukkasuomela.fi/doc/sss-keyn...
032 3
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 24/09/2026
Detailed prompts that led to the discovery here: jukkasuomela.fi/quantum-symm...
jukkasuomela.fi
How did you prompt Codex?
122 2
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 24/09/2026
Here is the "AI Methodology" section of our recent paper "Quantum Advantage for Distributed Symmetry Breaking" that appeared yesterday in arXiv: arxiv.org/abs/2609.26788
1112 11
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 15/08/2026
DISC 2026 accepted papers: www.disc-conference.org/wp/disc2026…
disc-conference.org
DISC 2026 Accepted Papers
## 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
003 3
Jukka Suomela @jukkasuomela.mastodon.social.ap.brid.gy · 29/06/2026
Our research group at Aalto University is hiring 3 postdocs + 3 doctoral students to work on distributed quantum algorithms in projects funded by an ERC Advanced Grant and a QuantERA grant. Application deadline: July 31, 2026. Start date: October 2026–October […] [Original post on mastodon.social]
201 2
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 26/06/2026
Advance information: I will be soon hiring postdocs and PhD students to work on distributed quantum algorithms, distributed quantum advantage, and quantum network algorithms! …
154 5
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 23/06/2026
PODC 2026 program: www.podc.org/podc2026/schedule
podc.org
Schedule
## **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
001 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 23/06/2026
I'm extremely happy to share that I received an ERC Advanced Grant 2025 (≈ 2.4 M€) for my project "Distributed Quantum Advantage"…
4202 20
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 21/06/2026
This has to receive the award of the cryptic error message of the year: my bibtex was saying just "3 is a bad bad" and nothing else. And this is apparently a feature; this is how it tries to communicate to the user "your max_print_line setting is too large". tex.stackexchange.com/questions/70...
tex.stackexchange.com
Why am I getting a `3 is a bad bad` error?
After upgrading from TeX Live 2022 to TeX Live 2023, when running bibtex, bibtex8, or bibtexu in TeX Live 2023, I get this error for any input file: 3 is a bad bad bibtex does not produce any outp...
091 9
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 22/05/2026
DISC 2026 call for papers: www.disc-conference.org/wp/disc2026… – Paper registration: May 27, 2026 – Submission deadline: June 1, 2026
disc-conference.org
Call for Papers
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.
001 1
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 22/05/2026
PODC 2026 takes place at Royal Holloway, together with ICALP + SPAA. PODC 2027 will be held in Reykjavik: www.podc.org/podc2026/next-podc
podc.org
Next PODC
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)
001 1
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 16/05/2026
PODC 2026 workshops and tutorials: www.podc.org/podc2026/workshops-and…
podc.org
Workshops and Tutorials
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
001 1
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 09/05/2026
PODC 2026 accepted papers: www.podc.org/podc2026/list-of-accep…
podc.org
List of Accepted Papers
## 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)
001 1
Reposted by Jukka Suomela
algorithms.fi @algorithms.fi · 06/05/2026
Helsinki Algorithms & Theory Days coming on August 27–28, 2026! algorithms.fi
algorithms.fi
HALT · Helsinki Algorithms & Theory
023 3
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 05/05/2026
PODC 2026 travel grants: www.podc.org/podc2026/travel-grants
podc.org
Travel Grants
**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**
001 1
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 04/05/2026
2026 Edsger W. Dijkstra Prize in Distributed Computing: Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer — "Distributed Verification and Hardness of Distributed Approximation" […]
mathstodon.xyz
Original post on mathstodon.xyz
001 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 19/04/2026
It is this time of the year again: the "Programming Parallel Computers" course at Aalto University is starting tomorrow, and we have 400+ students registered for the course. All course material & exercises freely available online: ppc.cs.aalto.fi
241 4
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 14/04/2026
The Baltic Olympiad in Informatics 2026 starting tomorrow! Organized at the Aalto University campus in Otaniemi, in collaboration with Aalto University, University of Helsinki, Helsinki Institute for Information Technology HIIT, and MAOL. boi2026.cses.fi
044 4
Jukka Suomela @jukkasuomela.mastodon.social.ap.brid.gy · 06/04/2026
The March 2026 issue of SIGACT News has appeared! With this issue, I am taking over as the editor of the SIGACT News Distributed Computing Column. In the first Distributed Computing Column, I will first say a few words on my own plans, but the interesting part after the introductory words is by […]
mastodon.social
Original post on mastodon.social
001 1
Reposted by Jukka Suomela
algorithms.fi @algorithms.fi · 25/03/2026
HIIT Foundations Friday: Friday, March 27, 2026, at 11.15–13.00. Maxwell Forst: An introduction to lattice reduction theory. University of Helsinki, Athena building (Siltavuorenpenger 3 A), room 169. research.cs.aalto.fi/hiit-foundatio…
research.cs.aalto.fi
HIIT Foundations Friday
102 2
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 22/03/2026
Revontulia näkyi täällä Helsingin keskustassakin, kaiken valosaasteen keskellä
093 9
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 21/03/2026
PODC–DISC Community is now also on LinkedIn: www.linkedin.com/company/podc-disc
linkedin.com
PODC–DISC Community | LinkedIn
PODC–DISC Community | ACM Symposium on Principles of Distributed Computing — International Symposium on Distributed Computing
011 1
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 21/03/2026
DISC 2026 call for papers: www.disc-conference.org/wp/disc2026… Paper registration: May 27, 2026 Submission deadline: June 1, 2026 Rebuttal phase: July 21–25, 2026 Notification: August 5, 2026 Conference: November 9–13, 2026
disc-conference.org
Call for Papers
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.
011 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 07/03/2026
Lean 4 code here: github.com/suomela/2-co...
github.com
GitHub - suomela/2-coloring-1-round: 2-Coloring Cycles in One Round: Formalization in Lean 4
2-Coloring Cycles in One Round: Formalization in Lean 4 - suomela/2-coloring-1-round
001 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 07/03/2026
Here is now a short writeup on our chatbot-assisted proof that we also vibe-formalized: arxiv.org/abs/2603.04235
arxiv.org
2-Coloring Cycles in One Round
We show that there is a one-round randomized distributed algorithm that can 2-color cycles such that the expected fraction of monochromatic edges is less than 0.24118. We also show that a one-round al...
252 5
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 01/03/2026
L'Aquila…
041 4
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 01/03/2026
L'Aquila…
192 9
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 25/02/2026
Another new paper on arXiv: arxiv.org/abs/2602.21022
arxiv.org
Is a LOCAL algorithm computable?
Common definitions of the "standard" LOCAL model tend to be sloppy and even self-contradictory on one point: do the nodes update their state using an arbitrary function or a computable function? So fa...
023 3
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 23/02/2026
Another new paper on arXiv: arxiv.org/abs/2602.18188
arxiv.org
It does not matter how you define locally checkable labelings
Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are...
011 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 23/02/2026
A new paper on arXiv: arxiv.org/abs/2602.13046
arxiv.org
Classification of Local Optimization Problems in Directed Cycles
We present a complete classification of the distributed computational complexity of local optimization problems in directed cycles for both the deterministic and the randomized LOCAL model. We show th...
011 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 20/02/2026
Here is a small research project that I did recently with chatbots: github.com/suomela/fin-... — everything is vibe-formalized in Lean 4 (approx. 24500 lines of Lean code).
github.com
GitHub - suomela/fin-dep: Finitely dependent distributions
Finitely dependent distributions. Contribute to suomela/fin-dep development by creating an account on GitHub.
022 2
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 17/02/2026
DISC 2026 call for papers: www.disc-conference.org/wp/disc2026…
disc-conference.org
Call for Papers
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.
012 2
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 25/01/2026
Aalto University is looking for an Assistant Professor in Computer Science, application deadline February 2, 2026! www.aalto.fi/en/open-posi...
0109 10
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 21/01/2026
Here are the slides of my talk in Helsinki CS Theory Seminar today: jukkasuomela.fi/doc/theory-s... This is about the project where chatbots did most of the work: they not only proved theorems but also formalized the results in Lean 4.
121 2
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 17/01/2026
SPAA 2026 call for papers: - Abstract registration: February 20, 2026 - Full paper submission: February 27, 2026 - Notification date: May 15, 2026 spaa.acm.org/cfp
spaa.acm.org
Call for Papers
The 38th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’26) will be held at Royal Holloway, University of London, in London, UK, from July 6 to 10, 2026, and will be co-located with PODC and ICALP. Submissions are invited 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, as well as quantum parallelism and parallelism in modern application domains such as machine learning. Papers that are purely theoretical, purely experimental, or that combine theory and experiments are welcome. ### **Important Dates** All dates are in 2026, and all deadlines are at 11:59 p.m. AoE. **Abstract registration**| February 20 (Friday) ---|--- **Full paper submission**| February 27 (Friday) **Rebuttal period**| April 27 – May 1 (Monday – Friday) **Author notification**| May 15 (Friday) **Camera-ready version due**| June 5 (Friday) Click here to add these dates to your Google Calendar. You can also use this link’s ICS file to import the dates into other calendar apps (e.g., Outlook, Yahoo, etc.). ### **Topics of Interest** Topics of interest include, but are not limited to: * Parallel and distributed algorithms * Parallel, concurrent, and distributed data structures * Parallel complexity theory * Scheduling algorithms for parallel machines * Computational models for parallel and distributed computing * Interplay between algorithmic parallelism, programming, and architecture * Parallel programming languages * Parallel programming frameworks and domain-specific languages * System software for parallel and concurrent programming, including (but not limited) to runtime systems, compilers, and tools * Parallel and distributed architectures * Supercomputer architecture and high-performance computing * Instruction-level parallelism and VLSI * Parallelism in emerging hardware platforms, including AI accelerators, processing-in-memory, and quantum computing * Energy-efficient (“green”) computing and power-aware architectures * Transactional memory: hardware and software * Management and processing of massive data sets * Memory or I/O-efficient algorithms * Parallelism in machine learning * Routing and information dissemination * Peer-to-peer systems * Mobile, ad hoc, and sensor networks ### **Submission Overview** Papers must be submitted via HotCRP on the submission site. Submissions may be either **regular papers** or **brief announcements**. Titles of brief announcements should begin with “Brief Announcement:”. Submissions not accepted as regular papers will automatically be considered for brief announcements, unless the title is explicitly suffixed with “(full paper only).” Submissions must be PDFs in single-spaced, double-column format on 8.5×11-inch paper, with at least a 9-pt font, reasonable margins/spacing, and page numbers. The PDFs should be readable when printed in black and white. Submissions must use the final ACM “sigconf” format: https://www.acm.org/publications/proceedings-template. To facilitate unbiased expert reviewing, SPAA 2026 may use the **Toronto Paper Matching System (TPMS)** for reviewer assignment, which means TPMS may be given access to the submissions. ### **Regular Papers:** A regular paper must present original, unpublished work not under concurrent submission. It may not exceed ten (10) single-spaced, double-column pages (excluding the bibliography). All details supporting the main claims should appear within those ten pages or in clearly marked supplementary material, though reviewers are not obligated to read the supplementary material. ### **Brief Announcements:** Examples of brief announcements include work in progress, tool/library announcements, challenge problems to the community, corrections to prior results, and smaller results of independent interest. They may not exceed three (3) single-spaced, double-column pages excluding the bibliography. SPAA proceedings publication of a Brief Announcement does not preclude longer conference submissions. ### **Theory vs. Experiments:** To assist with reviewer assignment, please select one of the following categories for your paper at submission: 1. Theory (primarily theoretical contributions) 2. Experiments (primarily experimental contributions) 3. Theory and Experiments (a mix of both) ### **Double-Blind Policy** SPAA 2026 will use a lightweight double-blind review process. Submissions must omit author names, affiliations, and contact information; self-citations should be written in the third person; and supplementary material must be anonymized. Authors may still disseminate their work as usual (e.g., on arXiv or through talks), and reviewers will be asked not to actively seek author identities by any means. ### **Conflict of Interest Policy** To ensure a fair review process, all authors must register conflicts with PC members at submission. A conflict of interest includes: * Academic advisor/advisee (no time limit) * Postdoctoral mentor/mentee (no time limit) * Collaborators within the past three years (e.g., joint paper, project, or funding) * Same institutional affiliation within the past 3 years * Family member or close friend * Anyone involved in an alleged harassment incident (even if not formally reported) * Anyone whose relationship with an author could reasonably impair objective judgment The program chair may request a ToC advocate to confidentially verify a claimed conflict. Falsely declared conflicts (i.e., those not covered by the above) risk rejection without review. Authors who believe they have a valid conflict not listed above, or are unsure, should contact the program chair. ### **Official Publication Date** The official publication date for SPAA papers is the date the proceedings appear in the ACM Digital Library, which may be up to two weeks before the conference. If they appear after the conference, the official publication date is the first day of the conference. This date governs the deadline for any related patent filings. ### **ACM Publications Policies** By submitting your article to an ACM publication, you acknowledge that you and your co-authors are subject to ACM Publications Policies (https://www.acm.org/publications/policies). Any alleged violation of these policies will be investigated by ACM and may result in full retraction of the paper and other penalties. All authors of accepted papers must have ORCID iDs to complete the publishing process; see https://authors.acm.org/author-resources/orcid-faqs. ORCID iDs are now required for all ACM journals and conference proceedings (even though the FAQ does not yet explicitly mention conference publications). ### **ACM’s New Open Access Publishing Model for 2026 Conferences** Starting January 1, 2026, ACM will fully transition to 100% Open Access for all publications, including ACM-sponsored conferences. Authors will publish Open Access articles either through the ACM Open institutional model or by paying an Article Processing Charge (APC). Because more than 2,600 institutions currently participate in ACM Open, most papers will not require APCs from authors or conferences. Authors whose institutions are not in ACM Open will need to pay an APC unless they qualify for a financial waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review https://www.acm.org/publications/policies/policy-on-discretionary-open-access-apc-waivers. Keep in mind that waivers are rare and are granted based on specific criteria set by ACM. To ease the transition, ACM has approved a temporary 2026 subsidy that applies to all 2026 conferences. APCs will be $250 for ACM/SIG members and $350 for non-members, reflecting a 65% ACM-funded discount. Authors are encouraged to advocate for their institutions to join ACM Open. ### **Additional Notes** If you have any questions about the above policies, please contact the PC chair Rezaul Chowdhury by email (rezaul AT cs DOT stonybrook DOT edu) and prefix the email subject with “[SPAA 26]”.
001 1
Reposted by Jukka Suomela
PODC-DISC @podc-disc.mathstodon.xyz.ap.brid.gy · 17/01/2026
PODC 2026 call for papers: - Abstract submission: February 11, 2026 - Full paper submission: February 16, 2026 - Notification date: April 29, 2026 www.podc.org/podc2026/call-for-pape…
podc.org
Call for papers
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.
101 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 07/01/2026
2: Summer employee positions at the Department of Computer Science: www.aalto.fi/en/departmen...
aalto.fi
Summer employee positions at the Department of Computer Science 2026 | Aalto University
We are looking for BSc or MSc degree students at Aalto or other universities to work with us during the summer 2026
032 3
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 07/01/2026
Aalto University is hiring summer interns! 1: Aalto Science Institute International Summer Research Program: www.aalto.fi/en/aalto-sci...
aalto.fi
Aalto Science Institute International Summer Research Programme | Aalto University
Calling all research-oriented students: Spend Summer 2026 in Finland with a transformative research assistantship at Aalto University. Open to bachelor's, master's, and—in exceptional cases—doctoral students worldwide.
143 4
Jukka Suomela @jukkasuomela.mastodon.social.ap.brid.gy · 02/01/2026
New year, new opportunities! Application deadline February 2, 2026: www.aalto.fi/en/open-positions/assi…
010 1
Jukka Suomela @jukkasuomela.mastodon.social.ap.brid.gy · 18/12/2025
We are hiring summer interns: www.aalto.fi/en/aalto-science-insti…
010 1
Jukka Suomela @jukkasuomela.mastodon.social.ap.brid.gy · 17/12/2025
We are hiring! Please spread the word! The Department of Computer Science at Aalto University invites applications for a tenure-track position at the Assistant Professor level in computer science. This is a broad call and all areas of computer science will be considered. We are in particular […]
mastodon.social
Original post on mastodon.social
001 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 16/12/2025
You can paste these instructions to ChatGPT 5.2 as part of your prompt so that it doesn't need to always re-invent how to get access to Z3, PySAT, PuLP, OR-Tools, and CVXPY if needed: gist.github.com/suomela/bca8...
gist.github.com
ChatGPT 5.2 solvers and optimization tools
ChatGPT 5.2 solvers and optimization tools. GitHub Gist: instantly share code, notes, and snippets.
111 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 15/12/2025
What are the forums that people are these days actively following for faculty positions in CS? Which mailing lists and forums are still alive, which are dead? There are active area-specific lists such as DMANET, but is there anything broader, covering all of CS?
101 1
Jukka Suomela @jukkasuomela.mastodon.social.ap.brid.gy · 07/12/2025
#AdventOfCode day 4: Printing Department
040 4
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 02/12/2025
We had the second exam of our Distributed Algorithms course yesterday, and I checked how various chatbots would have done in the exam.
191 9
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 22/11/2025
The connection between distributed algorithms and descriptive set theory featured in Quanta: www.quantamagazine.org/a-new-bridge...
quantamagazine.org
A New Bridge Links the Strange Math of Infinity to Computer Science | Quanta Magazine
Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms.
033 3
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 13/11/2025
The presentation slides from Helsinki Distributed Quantum Computing Workshop 2025 now available online: algorithms.fi/quantum-work...
algorithms.fi
Distributed Quantum Computing Workshop
002 2
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 11/11/2025
And this from SODA 2026: jukkasuomela.fi/quantum-lcl/
jukkasuomela.fi
A. Balliu, F. Casagrande, F. d'Amore, M. Equi, B. Keller, H. Lievonen, D. Olivetti, G. Schmid, J. Suomela: Distributed quantum advantage in locally checkable labeling problems
001 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 11/11/2025
It covers two papers, this one from STOC 2025: jukkasuomela.fi/quantum-adva...
jukkasuomela.fi
A. Balliu, S. Brandt, X. Coiteux-Roy, F. d'Amore, M. Equi, F.L. Gall, H. Lievonen, A. Modanese, D. Olivetti, M. Renou, J. Suomela, L. Tendick, I. Veeren: Distributed quantum advantage for local proble...
Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Ten...
101 1
Reposted by Jukka Suomela
Jukka Suomela @jukkasuomela.fi · 11/11/2025
We will have a talk with the title "Distributed Quantum Advantage for Local Problems" in QIP 2026! qip2026.lu.lv/programme/ac...
qip2026.lu.lv
Accepted papers
101 1