Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAugusto Modanese
Person information
- affiliation: Aalto University, Finland
- affiliation (former): Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Amirreza Akbari, Xavier Coiteux-Roy, Francesco D'Amore, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhon, Jukka Suomela:
Online Locality Meets Distributed Quantum Computing. CoRR abs/2403.01903 (2024)- 2023
- [c6]Augusto Modanese
:
Sublinear-Time Probabilistic Cellular Automata. STACS 2023: 47:1-47:22 - [i8]Augusto Modanese:
Pseudorandom Generators for Sliding-Window Algorithms. CoRR abs/2301.07384 (2023) - [i7]Xavier Coiteux-Roy, Francesco D'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela:
No distributed quantum advantage for approximate graph coloring. CoRR abs/2307.09444 (2023) - [i6]Augusto Modanese, Yuichi Yoshida:
Testing Spreading Behavior in Networks with Arbitrary Topologies. CoRR abs/2309.05442 (2023) - 2022
- [b1]Augusto Modanese:
Sublinear-Time Cellular Automata and Connections to Complexity Theory. Karlsruhe Institute of Technology, Germany, 2022 - [j3]Augusto Modanese:
Complexity-theoretic aspects of expanding cellular automata. Nat. Comput. 21(1): 53-65 (2022) - [j2]Augusto Modanese:
Correction to: Complexity-theoretic aspects of expanding cellular automata. Nat. Comput. 21(1): 67 (2022) - [c5]Augusto Modanese, Thomas Worsch:
Embedding Arbitrary Boolean Circuits into Fungal Automata. LATIN 2022: 393-408 - [i5]Augusto Modanese:
Sublinear-Time Probabilistic Cellular Automata. CoRR abs/2203.14614 (2022) - [i4]Augusto Modanese, Thomas Worsch:
Embedding arbitrary Boolean circuits into fungal automata. CoRR abs/2208.08779 (2022) - 2021
- [j1]Augusto Modanese:
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata. Int. J. Found. Comput. Sci. 32(6): 713-731 (2021) - [c4]Augusto Modanese:
Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata. CSR 2021: 296-320 - 2020
- [c3]Augusto Modanese:
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata. DLT 2020: 251-265 - [i3]Augusto Modanese:
Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata. CoRR abs/2007.12048 (2020)
2010 – 2019
- 2019
- [c2]Augusto Modanese:
Complexity-Theoretic Aspects of Expanding Cellular Automata. Automata 2019: 20-34 - [i2]Augusto Modanese:
Complexity-Theoretic Aspects of Expanding Cellular Automata. CoRR abs/1902.05487 (2019) - [i1]Augusto Modanese:
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata. CoRR abs/1909.05828 (2019) - 2016
- [c1]Augusto Modanese, Thomas Worsch:
Shrinking and Expanding Cellular Automata. Automata 2016: 159-169
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
