About me
Postdoctoral researcher
Distributed Algorithms research group
Aalto University
Computer Science building, room B311
Konemiehentie 2
02150 Espoo
Papers (in reverse chronological order of appearance)
- Distributed Quantum Advantage for Local Problems
(with
Alkida Balliu,
Sebastian Brandt,
Xavier Coiteux-Roy,
Francesco d’Amore,
Massimo Equi,
François Le Gall,
Henrik Lievonen,
Dennis Olivetti,
Marc-Olivier Renou,
Jukka Suomela,
Lucas Tendick, and
Isadora Veeren)
arXiv:2411.03240 [cs.DC] - Local problems in trees across a wide range of distributed models
(with
Anubhav Dhar,
Eli Kujawa,
Henrik Lievonen,
Mikail Muftuoglu,
Jan Studený, and
Jukka Suomela)
To appear at OPODIS 2024
arXiv:2409.13795 [cs.DC] - Shared Randomness Helps with Local Distributed Problems
(with
Alkida Balliu,
Mohsen Ghaffari,
Fabian Kuhn,
Dennis Olivetti,
Mikaël Rabie,
Jukka Suomela, and
Jara Uitto)
arXiv:2407.05445 [cs.DC] - Testing Spreading Behavior in Networks with Arbitrary Topologies
(with Yuichi Yoshida)
In: International Colloquium on Automata, Languages, and Programming (ICALP), 2024
arXiv:2309.05442 [cs.DC] - No distributed quantum advantage for approximate graph coloring
(with
Xavier Coiteux-Roy,
Francesco d’Amore,
Rishikesh Gajjala,
Fabian Kuhn,
François Le Gall,
Henrik Lievonen,
Marc-Olivier Renou,
Gustav Schmid, and
Jukka Suomela)
In: Symposium on Theory of Computing (STOC), 2024
arXiv:2307.09444 [cs.DC] - Embedding arbitrary Boolean circuits into fungal automata
(with Thomas Worsch)
In: Algorithmica, 2024
Previously appeared in: Latin American Theoretical Informatics Symposium (LATIN), 2022
arXiv:2208.08779 [cs.CC] - Online Locality Meets Distributed Quantum Computing
(with
Amirreza Akbari,
Xavier Coiteux-Roy,
Francesco d’Amore,
François Le Gall,
Henrik Lievonen,
Darya Melnyk,
Shreyas Pai,
Marc-Olivier Renou,
Václav Rozhoň, and
Jukka Suomela)
arXiv:2403.01903 [cs.DC] - Pseudorandom Generators for Sliding-Window Algorithms
arXiv:2301.07384 [cs.CC] - Sublinear-Time Probabilistic Cellular Automata
In: Symposium on Theoretical Aspects of Computer Science (STACS), 2023
arXiv:2203.14614 [cs.FL] - Lower Bounds and Hardness Magnification for Sublinear-Time Cellular
Automata
In: Computer Science Symposium in Russia (CSR), 2021
arXiv:2007.12048 [cs.CC] - Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular
Automata
In: International Journal of Foundations of Computer Science (IJFCS), 2021
Previously appeared in: Developments in Language Theory (DLT), 2020
arXiv:1909.05828 [cs.CC] - Complexity-Theoretic Aspects of Expanding Cellular Automata
In: Natural Computing, 2020
Previously appeared in: Cellular Automata and Discrete Complex Systems (AUTOMATA), 2019
arXiv:1902.05487 [cs.CC] - Shrinking and Expanding Cellular Automata
(with Thomas Worsch)
In: Cellular Automata and Discrete Complex Systems (AUTOMATA), 2016
PhD Thesis
- Sublinear-Time Cellular Automata and Connections to Complexity Theory
KITopen:1000153071