Augusto Modanese

Orcid: 0000-0003-0518-8754

Affiliations:
  • Aalto University, Finland
  • Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany (former)


According to our database1, Augusto Modanese authored at least 19 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs.
CoRR, June, 2025

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement.
CoRR, May, 2025

Strong and Hiding Distributed Certification of <i>k</i>-Coloring.
CoRR, February, 2025

Distributed Quantum Advantage for Local Problems.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Online Locality Meets Distributed Quantum Computing.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Brief Announcement: Strong and Hiding Distributed Certification of <i>k</i>-Coloring.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Shared Randomness Helps with Local Distributed Problems.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Embedding Arbitrary Boolean Circuits into Fungal Automata.
Algorithmica, July, 2024

No Distributed Quantum Advantage for Approximate Graph Coloring.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Local Problems in Trees Across a Wide Range of Distributed Models.
Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024

Testing Spreading Behavior in Networks with Arbitrary Topologies.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Pseudorandom Generators for Sliding-Window Algorithms.
CoRR, 2023

Sublinear-Time Probabilistic Cellular Automata.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022
Sublinear-Time Cellular Automata and Connections to Complexity Theory.
PhD thesis, 2022

Correction to: Complexity-theoretic aspects of expanding cellular automata.
Nat. Comput., 2022

Complexity-theoretic aspects of expanding cellular automata.
Nat. Comput., 2022

2021
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata.
Int. J. Found. Comput. Sci., 2021

Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata.
Proceedings of the Computer Science - Theory and Applications, 2021

2016
Shrinking and Expanding Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2016


  Loading...