Jukka Suomela

Jukka Suomela

@jukkasuomela.fi

Professor – Department of Computer Science, Aalto University – theory of distributed & parallel computing – https://jukkasuomela.fi

1.7K followers2.3K following2.9K posts

Jukka Suomela reposted

Ryan Williams
@rrwilliams.bsky.social

An internal model at OpenAI has produced a claimed refutation of ETH! Russell Impagliazzo, Mohan Paturi, and I have been asked to help organize an open and independent examination of this claim. 1/4

Jukka Suomela reposted

Transactions on Machine Learning Research
@tmlrorg.bsky.social

What is TMLR doing under a 300% increase in submissions? - Suspensions of >150 authors - Publicly naming major violations - Submission quotas distinguishing slop patterns - Desk rejections 6% → 53%; focus on clarity - AI reviews evaluating soundness blog.tmlr.org/2026/adaptin...

blog.tmlr.orgAdapting Our Processes to the Changing World of Scientific PublicationTMLR is adapting its submission and review processes to handle rapid growth while protecting review quality, reviewer time, and scientific integrity.

Jukka Suomela reposted

Clément Canonne
@ccanonne.github.io

Detailed video submission instructions are now linked from the CfP: acm-stoc.org/stoc2027/sto... #STOC2027 Direct link [PDF]: acm-stoc.org/stoc2027/sto...

Clément Canonne@ccanonne.github.io

The #STOC2027 CfP has been updated (in light of the recent #arXiv policy change): acm-stoc.org/stoc2027/sto... (see "Public submissions") In addition, a document by the PC Chair explaining the rationale behind the policies is available: acm-stoc.org/stoc2027/sto... [PDF]

Jukka Suomela reposted

PODC-DISC
@podc-disc.mathstodon.xyz.ap.brid.gy

DISC 2026 accepted papers: https://www.disc-conference.org/wp/disc2026/accepted-papers/

disc-conference.orgDISC 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
Jukka Suomela
@jukkasuomela.fi

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 2027 (negotiable). Apply now!

Jukka Suomela
@jukkasuomela.fi

Advance information: I will be soon hiring postdocs and PhD students to work on distributed quantum algorithms, distributed quantum advantage, and quantum network algorithms! …

Jukka Suomela
@jukkasuomela.fi

… The full job application will be published hopefully already next week, and the call deadline will be July 31, 2026. Check the open positions page at the Aalto University web site soon for more details!

Jukka Suomela reposted

Veeti Nurminen
@veetinurminen.bsky.social

We should really be concerned about academic freedom in Finland. Recently, Health Minister Wille Rydman intervened in social work research funding by personally reviewing research proposals and rejecting those he deemed ”insufficiently justified given the current fiscal situation”.

Jukka Suomela reposted

Tanja Säily
@tanjasaily.fi

Recent handbook articles relevant to #historicalsociolinguistics and #corpuslinguistics – if you need access to any of these, just let me know! (1/4)

Jukka Suomela reposted

Computer Science
@csaalto.bsky.social

Wonderful news: Our Professor @jukkasuomela.fi has received an ERC Advanced Grant for his project “Distributed Quantum Advantage (DistQuant)”. Congratulations, Jukka! 👏💐 More: www.aalto.fi/en/news/high... @aalto.fi #ERCAdG

aalto.fiHighly sought-after EU funding for three Aalto University researchers | Aalto UniversityThe projects focus on atomically precise materials-engineering, LED-based thermal management and quantum methods in distributed networks.
European Research Council (ERC)@erc.europa.eu

The results of the Advanced Grants 2025 are here! Out of 3,329 applicants, 319 leading researchers have been awarded an ERC Advanced Grant. Congratulations to all! 🎉 Curious to know more ? 👉 buff.ly/uiU9x5K #ERCAdG #FrontierResearch

View full thread
Jukka Suomela
@jukkasuomela.fi

… So far we have only artificial problems that separate these two models (and very few such problems); what I aim to answer is whether there are any natural problems that would admit a quantum advantage in this setting. For example, do any local symmetry-breaking problems admit quantum advantage? …

Jukka Suomela
@jukkasuomela.fi

… And yes, I will be very soon hiring postdocs and PhD students to work on this project, as well as in our QuantERA project "Quantum Network Algorithms", stay tuned for the job ads!

View full thread
Jukka Suomela
@jukkasuomela.fi

… That is, if we could replace classical computers with quantum computers, and classical computer networks with quantum communication channels, what are the tasks that we could now solve faster, in a smaller number of communication steps? …

Jukka Suomela
@jukkasuomela.fi

… Formally, the key question is understanding which problems can be solved asymptotically faster in the quantum-LOCAL model, in comparison with the classical LOCAL model. …

Jukka Suomela
@jukkasuomela.fi

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.comWhy 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...

Jukka Suomela reposted

Iris van Rooij 💭
@irisvanrooij.bsky.social

Good decision and statement! 👏👏 "(...) preserving the integrity and reliability of the ACL proceedings is our responsibility and these measures are necessary to uphold the standards of our community and to ensure that the work published remains a credible resource for future scientific inquiry."

2026.aclweb.orgACL Statement on Desk Rejecting Papers with Hallucinated ReferencesOfficial website for the 64th Annual Meeting of the Association for Computational Linguistics

Jukka Suomela reposted

Thomas Dietterich
@tdietterich.bsky.social

We are implementing a similar policy at @arxiv.bsky.social. If there is incontrovertible evidence of LLM slop in a paper, this means the authors did not take the time to read the LLM output and we can't trust anything else in the paper. Penalty is 1 year ban from arXiv followed by...

Jukka Suomela
@jukkasuomela.fi

If you try to compile this code with GCC 15 using "g++-15 -Wall -fopenmp" and run the program, what happens? (a) Error: not enough for loops to collapse (b) Code compiles & runs & prints out 100 (c) … prints out 10000 (d) … prints out something that depends on the number of threads (e) Other, what?