Scholar
Augusto Modanese
Google Scholar ID: PnHQHPvzZXEC
Aalto University
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
104
H-index
5
i10-index
4
Publications
20
Co-authors
0
Contact
Email
augusto.modanese@aalto.fi
GitHub
Open ↗
Publications
7 items
Is a LOCAL algorithm computable?
2026
Cited
1
Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
2026
Cited
0
Classification of Local Optimization Problems in Directed Cycles
2026
Cited
0
Orientation does not help with 3-coloring a grid in online-LOCAL
2025
Cited
0
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
2025
Cited
0
Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
2025
Cited
0
Strong and Hiding Distributed Certification of $k$-Coloring
2025
Cited
0
Resume (English only)
Academic Achievements
Published multiple papers on distributed computing, quantum computing, and complexity theory, including but not limited to:
- 'Orientation does not help with 3-coloring a grid in online-LOCAL' (OPODIS 2025)
- 'New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs' (DISC 2025)
- 'Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement'
- 'Strong and Hiding Distributed Certification of Bipartiteness' (PODC 2025)
- 'Distributed Quantum Advantage for Local Problems' (STOC 2025)
- 'Local problems in trees across a wide range of distributed models' (OPODIS 2024)
- 'Shared Randomness Helps with Local Distributed Problems' (ICALP 2025)
- 'Online Locality Meets Distributed Quantum Computing' (STOC 2025)
- 'Testing Spreading Behavior in Networks with Arbitrary Topologies' (ICALP 2024)
- 'No distributed quantum advantage for approximate graph coloring' (STOC 2024)
- 'Pseudorandom Generators for Sliding-Window Algorithms'
- 'Embedding arbitrary Boolean circuits into fungal automata' (Algorithmica, 2024; LATIN 2022)
- 'Sublinear-Time Probabilistic Cellular Automata' (STACS 2023)
- 'Lower Bounds and Hardness Magnification for Sublinear-Time Cellular Automata' (CSR 2021)
- 'Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata' (IJFCS 2021; DLT 2020)
- 'Complexity-Theoretic Aspects of Expanding Cellular Automata' (Natural Computing, 2020)
Research Experience
Postdoc at Aalto University, Distributed Algorithms research group, Espoo, Finland
Background
Augusto Modanese is a postdoctoral researcher at the Distributed Algorithms research group, Aalto University.
Co-authors
0 total
Co-authors: 0 (list not available)
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up