default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Theyssier
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson
, Guillaume Theyssier:
On the parameterized complexity of freezing dynamics. Adv. Appl. Math. 157: 102706 (2024)- [j22]Martín Ríos-Wilson, Guillaume Theyssier:
Intrinsic universality in automata networks I: Families and simulations. Theor. Comput. Sci. 997: 114511 (2024) - [j21]Martín Ríos-Wilson, Guillaume Theyssier:
Intrinsic universality in automata networks II: Glueing and gadgets. Theor. Comput. Sci. 1016: 114779 (2024) - [j20]Martín Ríos-Wilson, Guillaume Theyssier:
Intrinsic universality in automata networks III: On symmetry versus asynchrony. Theor. Comput. Sci. 1022: 114890 (2024) - [c25]Guillaume Theyssier:
FO Logic on Cellular Automata Orbits Equals MSO Logic. ICALP 2024: 154:1-154:20 - [c24]Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
Local Certification of Majority Dynamics. SOFSEM 2024: 369-382 - [i36]Guillaume Theyssier:
FO logic on cellular automata orbits equals MSO logic. CoRR abs/2404.16430 (2024) - [i35]Solène J. Esnay, Victor H. Lutfalla, Guillaume Theyssier:
Bootstrap percolation on rhombus tilings. CoRR abs/2409.02520 (2024) - 2023
- [j19]Enrico Formenti, Sylvain Sené, Guillaume Theyssier:
Preface. Nat. Comput. 22(3): 409-410 (2023) - [i34]Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Hardness of monadic second-order formulae over succinct graphs. CoRR abs/2302.04522 (2023) - [i33]Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
Local Certification of Majority Dynamics. CoRR abs/2309.01852 (2023) - 2022
- [j18]Nicolas Ollinger, Guillaume Theyssier:
Freezing, Bounded-Change and Convergent Cellular Automata. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j17]Guillaume Theyssier:
Cold dynamics in cellular automata: a tutorial. Nat. Comput. 21(3): 481-505 (2022) - [j16]Ville Salo, Guillaume Theyssier, Ilkka Törmä:
Cellular automata and bootstrap percolation. Theor. Comput. Sci. 924: 34-45 (2022) - [c23]Guillaume Theyssier:
The Mirage of Universality in Cellular Automata. Automata and Complexity 2022: 57-70 - [c22]Samuel Nalin, Guillaume Theyssier:
On Turedo Hierarchies and Intrinsic Universality. DNA 2022: 6:1-6:18 - [c21]Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Guillaume Theyssier:
Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM). STACS 2022: 51:1-51:23 - [i32]Samuel Nalin, Guillaume Theyssier:
On Turedo Hierarchies and Intrinsic Universality. CoRR abs/2205.04103 (2022) - [i31]Guillaume Theyssier:
Cold Dynamics in Cellular Automata: a Tutorial. CoRR abs/2206.08139 (2022) - [i30]Martín Ríos-Wilson, Guillaume Theyssier:
Intrinsic Simulations and Universality in Automata Networks. CoRR abs/2209.09527 (2022) - 2021
- [c20]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics. CiE 2021: 260-272 - [c19]Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Rice-Like Theorems for Automata Networks. STACS 2021: 32:1-32:17 - [i29]Martín Ríos-Wilson, Guillaume Theyssier:
On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks. CoRR abs/2105.08356 (2021) - [i28]Ville Salo, Guillaume Theyssier, Ilkka Törmä:
Bootstrap Percolation and Cellular Automata. CoRR abs/2110.00656 (2021) - [i27]Guillaume Theyssier:
The Mirage of Universality in Cellular Automata. CoRR abs/2112.01090 (2021) - 2020
- [j15]Anahí Gajardo, Vincent Nesme, Guillaume Theyssier:
Pre-expansivity in cellular automata. Theor. Comput. Sci. 816: 37-66 (2020) - [j14]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Expansive automata networks. Theor. Comput. Sci. 843: 25-44 (2020) - [c18]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Commutative Automata Networks. Automata 2020: 43-58 - [c17]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
On Simulation in Automata Networks. CiE 2020: 277-288 - [i26]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Simulation of automata networks. CoRR abs/2001.09198 (2020) - [i25]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Commutative automata networks. CoRR abs/2004.09806 (2020) - [i24]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
On the impact of treewidth in the computational complexity of freezing dynamics. CoRR abs/2005.11758 (2020)
2010 – 2019
- 2019
- [i23]Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier:
Expansive Automata Networks. CoRR abs/1902.08007 (2019) - [i22]Nicolas Ollinger, Guillaume Theyssier:
Freezing, Bounded-Change and Convergent Cellular Automata. CoRR abs/1908.06751 (2019) - 2018
- [j13]Eric Goles, Pedro Montealegre, Kévin Perrot, Guillaume Theyssier:
On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci. 91: 1-32 (2018) - [c16]Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier:
Universality in Freezing Cellular Automata. CiE 2018: 50-59 - [i21]Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier:
Universality in Freezing Cellular Automata. CoRR abs/1805.00059 (2018) - 2017
- [c15]Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier:
On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One. TAMC 2017: 112-128 - [i20]Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier:
On the cost of simulating a parallel Boolean automata network by a block-sequential one. CoRR abs/1702.03101 (2017) - [i19]Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier:
Characterizing Asymptotic Randomization in Abelian Cellular Automata. CoRR abs/1703.07289 (2017) - 2016
- [c14]Guillaume Theyssier:
Propagation, Diffusion and Randomization in Cellular Automata. Automata 2016: 3-9 - [i18]Anahí Gajardo, Vincent Nesme, Guillaume Theyssier:
Pre-Expansivity in Cellular Automata. CoRR abs/1603.07215 (2016) - 2015
- [j12]Laurent Boyer, Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
μ-Limit sets of cellular automata from a computational complexity perspective. J. Comput. Syst. Sci. 81(8): 1623-1647 (2015) - 2014
- [j11]Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier:
Strict Majority Bootstrap Percolation in the r-wheel. Inf. Process. Lett. 114(6): 277-281 (2014) - [c13]Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods:
Intrinsic universality in tile self-assembly requires cooperation. SODA 2014: 752-771 - 2013
- [j10]Pablo Arrighi, Nicolas Schabanel, Guillaume Theyssier:
Stochastic Cellular Automata: Correlations, Decidability and Simulations. Fundam. Informaticae 126(2-3): 121-156 (2013) - [j9]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts as models for MSO logic. Inf. Comput. 225: 1-15 (2013) - [i17]Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods:
Intrinsic universality in tile self-assembly requires cooperation. CoRR abs/1304.1679 (2013) - [i16]Pablo Arrighi, Nicolas Schabanel, Guillaume Theyssier:
Stochastic Cellular Automata: Correlations, Decidability and Simulations. CoRR abs/1304.7185 (2013) - [i15]Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier:
Strict majority bootstrap percolation in the r-wheel. CoRR abs/1308.3831 (2013) - [i14]Laurent Boyer, Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
μ-Limit Sets of Cellular Automata from a Computational Complexity Perspective. CoRR abs/1309.6730 (2013) - 2012
- [c12]Pablo Arrighi, Nicolas Schabanel, Guillaume Theyssier:
Intrinsic Simulations between Stochastic Cellular Automata. AUTOMATA & JAC 2012: 208-224 - 2011
- [j8]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of Cellular Automata: Dimension Matters. Theory Comput. Syst. 48(3): 693-714 (2011) - [j7]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communication complexity and intrinsic universality in cellular automata. Theor. Comput. Sci. 412(1-2): 2-21 (2011) - [j6]Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
Directional dynamics along arbitrary curves in cellular automata. Theor. Comput. Sci. 412(30): 3800-3821 (2011) - [j5]Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier:
Bulking I: An abstract theory of bulking. Theor. Comput. Sci. 412(30): 3866-3880 (2011) - [j4]Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier:
Bulking II: Classifications of cellular automata. Theor. Comput. Sci. 412(30): 3881-3905 (2011) - [j3]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]. Theor. Comput. Sci. 412(52): 7169-7170 (2011) - [c11]Vincent Nesme, Guillaume Theyssier:
Selfsimilarity, Simulation and Spacetime Symmetries. Automata 2011: 77-94 - [i13]Vincent Nesme, Guillaume Theyssier:
Selfsimilarity, Simulation and Spacetime Symmetries. CoRR abs/1112.1933 (2011) - 2010
- [c10]Pierre Guillon, Pierre-Etienne Meunier, Guillaume Theyssier:
Clandestine Simulations in Cellular Automata. JAC 2010: 133-144 - [c9]Laurent Boyer, Guillaume Theyssier:
On Factor Universality in Symbolic Spaces. MFCS 2010: 209-220 - [i12]Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
Directional Dynamics along Arbitrary Curves in Cellular Automata. CoRR abs/1001.5470 (2010) - [i11]Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier:
Bulking II: Classifications of Cellular Automata. CoRR abs/1001.5471 (2010) - [i10]Laurent Boyer, Guillaume Theyssier:
On Factor Universality in Symbolic Spaces. CoRR abs/1004.3458 (2010) - [i9]Pierre Guillon, Pierre-Etienne Meunier, Guillaume Theyssier:
Clandestine Simulations in Cellular Automata. CoRR abs/1009.5621 (2010)
2000 – 2009
- 2009
- [j2]René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc:
Some properties of random lambda terms. Log. Methods Comput. Sci. 9(1) (2009) - [c8]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts, Languages and Logic. Developments in Language Theory 2009: 288-299 - [c7]Laurent Boyer, Guillaume Theyssier:
On Local Symmetries and Universality in Cellular Automata. STACS 2009: 195-206 - [i8]Laurent Boyer, Guillaume Theyssier:
On Local Symmetries And Universality In Cellular Autmata. CoRR abs/0902.1253 (2009) - [i7]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts, Languages and Logic. CoRR abs/0904.2457 (2009) - [i6]Emmanuel Jeandel, Guillaume Theyssier:
Subshifts and Logic: Back and Forth. CoRR abs/0912.1272 (2009) - [i5]Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communication Complexity and Intrinsic Universality in Cellular Automata. CoRR abs/0912.1777 (2009) - 2008
- [c6]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of 2D Cellular Automata. CiE 2008: 523-532 - [c5]Guillaume Theyssier:
Amalgamation of cellular automata. JAC 2008: 182-194 - [c4]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communications in cellular automata. CSP 2008: 81-92 - [i4]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of Cellular Automata: Dimension Matters. CoRR abs/0811.2731 (2008) - 2007
- [i3]Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of 2D Cellular Automata. CoRR abs/0709.4565 (2007) - 2006
- [c3]Laurent Boyer, Victor Poupet, Guillaume Theyssier:
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures. MFCS 2006: 190-201 - [i2]Laurent Boyer, Victor Poupet, Guillaume Theyssier:
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures. CoRR abs/cs/0604007 (2006) - 2005
- [b1]Guillaume Theyssier:
Automates cellulaires : un modèle de complexités. (Cellular automata: a model of complexities). École normale supérieure de Lyon, France, 2005 - [c2]Guillaume Theyssier:
How Common Can Be Universality for Cellular Automata?. STACS 2005: 121-132 - 2004
- [j1]Christoph Dürr, Ivan Rapaport, Guillaume Theyssier:
Cellular automata and communication complexity. Theor. Comput. Sci. 322(2): 355-368 (2004) - [c1]Guillaume Theyssier:
Captive Cellular Automata. MFCS 2004: 427-438 - 2002
- [i1]Christoph Dürr, Ivan Rapaport, Guillaume Theyssier:
Cellular automata and communication complexity. CoRR cs.CC/0210008 (2002)
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 2025-01-21 00:23 CET 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:
