Augusto Modanese

Generating author description...

All published works

Action	Title	Year	Authors
+	Online Locality Meets Distributed Quantum Computing	2024	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 Rozhoň
+	Distributed Quantum Advantage for Local Problems	2024	Alkida Balliu Sebastian Brandt Xavier Coiteux-Roy Francesco d’Amore Massimo Equi François Le Gall Henrik Lievonen Augusto Modanese Dennis Olivetti Marc-Olivier Renou
+ PDF Chat	Local problems in trees across a wide range of distributed models	2024	Abhishek Dhar Eli Kujawa Henrik Lievonen Augusto Modanese Mikail Muftuoglu Jan Studený Jukka Suomela
+ PDF Chat	Shared Randomness Helps with Local Distributed Problems	2024	Alkida Balliu Mohsen Ghaffari Fabian Kühn Augusto Modanese Dennis Olivetti Mikaël Rabie Jukka Suomela Jara Uitto
+	No Distributed Quantum Advantage for Approximate Graph Coloring	2024	Xavier Coiteux-Roy Francesco d’Amore Rishikesh Gajjala Fabian Kühn François Le Gall Henrik Lievonen Augusto Modanese Marc-Olivier Renou G. H. SCHMID Jukka Suomela
+	Pseudorandom Generators for Sliding-Window Algorithms	2023	Augusto Modanese
+	No distributed quantum advantage for approximate graph coloring	2023	Xavier Coiteux-Roy Francesco d’Amore Rishikesh Gajjala Fabian Kühn François Le Gall Henrik Lievonen Augusto Modanese Marc-Olivier Renou G. H. SCHMID Jukka Suomela
+	Testing Spreading Behavior in Networks with Arbitrary Topologies	2023	Augusto Modanese Yuichi Yoshida
+ PDF Chat	Sublinear-Time Probabilistic Cellular Automata	2022	Augusto Modanese
+	Sublinear-Time Probabilistic Cellular Automata	2022	Augusto Modanese
+	Embedding arbitrary Boolean circuits into fungal automata	2022	Augusto Modanese Thomas Worsch
+ PDF Chat	Embedding Arbitrary Boolean Circuits into Fungal Automata	2022	Augusto Modanese Thomas Worsch
+ PDF Chat	Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata	2021	Augusto Modanese
+ PDF Chat	Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata	2021	Augusto Modanese
+ PDF Chat	Complexity-theoretic aspects of expanding cellular automata	2020	Augusto Modanese
+	Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata	2020	Augusto Modanese
+	Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata	2020	Augusto Modanese
+	Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata	2020	Augusto Modanese
+	Complexity-Theoretic Aspects of Expanding Cellular Automata	2019	Augusto Modanese

Common Coauthors

Coauthor	Papers Together
Jukka Suomela	6
Henrik Lievonen	5
François Le Gall	4
Xavier Coiteux-Roy	4
Francesco d’Amore	4
Marc-Olivier Renou	4
Fabian Kühn	3
Dennis Olivetti	2
Alkida Balliu	2
Rishikesh Gajjala	2
G. H. SCHMID	2
Thomas Worsch	2
Amirreza Akbari	1
Isadora Veeren	1
Mohsen Ghaffari	1
Eli Kujawa	1
Mikail Muftuoglu	1
Jan Studený	1
Lucas Tendick	1
Abhishek Dhar	1
Yuichi Yoshida	1
Mikaël Rabie	1
Sebastian Brandt	1
Shreyas Pai	1
Massimo Equi	1
Václav Rozhoň	1
Jara Uitto	1
Darya Melnyk	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata	2020	Augusto Modanese	4
+	Complexity-Theoretic Aspects of Expanding Cellular Automata	2019	Augusto Modanese	4
+ PDF Chat	Cellular automata and communication complexity	2004	Christoph Dürr Iván Rapaport Guillaume Theyssier	2
+	On two modified problems of synchronization in cellular automata.	1977	Roland Vollmar	2
+	Constructible functions in cellular automata and their applications to hierarchy results	2002	Chihiro Iwamoto Tomonobu Hatsuyama Kenichi Morita Katsunobu Imai	2
+ PDF Chat	Parallel graph decompositions using random shifts	2013	Gary L. Miller Richard Peng Shen Xu	1
+ PDF Chat	General properties of nonsignaling theories	2006	Lluís Masanes Antonio Acín Nicolas Gisin	1
+	Coloring Locally Bipartite Graphs on Surfaces	2002	Bojan Mohar Paul Seymour	1
+ PDF Chat	Can quantum communication speed up distributed computation?	2014	Michael Elkin Hartmut Klauck Danupon Nanongkai Gopal Pandurangan	1
+ PDF Chat	On the Locality of Some NP-Complete Problems	2012	Leonid Barenboim	1
+ PDF Chat	A lower bound for the distributed Lovász local lemma	2016	Sebastian Brandt Orr Fischer Juho Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto	1
+ PDF Chat	Distributed Coloring in Sparse Graphs with Fewer Colors	2019	Pierre Aboulker Marthe Bonamy Nicolás Bousquet Louis Esperet	1
+ PDF Chat	A Time Hierarchy Theorem for the LOCAL Model	2019	Yi‐Jun Chang Seth Pettie	1
+	Distributed Degree Splitting, Edge Coloring, and Orientations	2017	Mohsen Ghaffari Hsin-Hao Su	1
+ PDF Chat	Lower Bounds for Maximal Matchings and Maximal Independent Sets	2019	Alkida Balliu Sebastian Brandt Juho Hirvonen Dennis Olivetti Mikaël Rabie Jukka Suomela	1
+ PDF Chat	FINITELY DEPENDENT COLORING	2016	Alexander E. Holroyd Thomas M. Liggett	1
+ PDF Chat	Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model	2019	Taisuke Izumi François Le Gall	1
+ PDF Chat	New classes of distributed time complexity	2018	Alkida Balliu Juho Hirvonen Janne H. Korhonen Tuomo Lempiäinen Dennis Olivetti Jukka Suomela	1
+ PDF Chat	Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks	2018	François Le Gall Frédéric Magniez	1
+ PDF Chat	An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model	2016	Yi‐Jun Chang Tsvi Kopelowitz Seth Pettie	1
+ PDF Chat	On Derandomizing Local Distributed Algorithms	2018	Mohsen Ghaffari David G. Harris Fabian Kühn	1
+ PDF Chat	An Automatic Speedup Theorem for Distributed Problems	2019	Sebastian Brandt	1
+	Finitely dependent cycle coloring	2018	Alexander E. Holroyd Tom Hutchcroft Avi Levy	1
+ PDF Chat	How Hard is it to Predict Sandpiles on Lattices? A Survey	2019	Enrico Formenti Kévin Perrot	1
+ PDF Chat	Quantum Distributed Complexity of Set Disjointness on a Line	2022	Frédéric Magniez Ashwin Nayak	1
+ PDF Chat	Computational universality of fungal sandpile automata	2020	Eric Goles Michail‐Antisthenis Tsompanas Andrew Adamatzky Martin Tegelaar Han A. B. Wösten Genaro J. Martínez	1
+ PDF Chat	Polylogarithmic-time deterministic network decomposition and distributed derandomization	2020	Václav Rozhoň Mohsen Ghaffari	1
+ PDF Chat	How much does randomness help with locally checkable problems?	2020	Alkida Balliu Sebastian Brandt Dennis Olivetti Jukka Suomela	1
+	A Framework for Distributed Quantum Queries in the CONGEST Model	2022	Joran van Apeldoorn Tijn de Vos	1
+	Ramanujan graphs	1988	Alexander Lubotzky Ralph S. Phillips Peter Sarnak	1
+ PDF Chat	Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks	2022	Xudong Wu Penghui Yao	1
+	Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul through Sharing instead of Copying Clauses	2022	Mathias Fleury Armin Biere	1
+ PDF Chat	Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization	2023	Mohsen Ghaffari Christoph Grunau Bernhard Haeupler Saeed Ilchi Václav Rozhoň	1
+	The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs	2023	Yi‐Jun Chang Zeyong Li	1
+ PDF Chat	The Computational Complexity of Sandpiles	1999	Cristopher Moore Martin Nilsson	1
+	No distributed quantum advantage for approximate graph coloring	2023	Xavier Coiteux-Roy Francesco d’Amore Rishikesh Gajjala Fabian Kühn François Le Gall Henrik Lievonen Augusto Modanese Marc-Olivier Renou G. H. SCHMID Jukka Suomela	1
+	Examples of topologically highly chromatic graphs with locally small chromatic number	2013	Ilya I. Bogdanov	1
+	Structurally Dynamic Cellular Automata	2011	Andrew Ilachinski Paul Halpern	1
+ PDF Chat	Local chromatic number of quadrangulations of surfaces	2013	Bojan Mohar Gábor Simonyi Gábor Tardos	1
+	Crossing information in two-dimensional Sandpiles	2006	Anahí Gajardo Eric Goles	1