default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Ollinger
2020 – today
- 2025
[i9]Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger, Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti:
Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences. CoRR abs/2504.13584 (2025)- 2024
- [i8]Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger:
Addition in Dumont-Thomas Numeration Systems in Theory and Practice. CoRR abs/2406.09868 (2024) - [i7]Nicolas Ollinger, Jeffrey O. Shallit:
The Repetition Threshold for Rote Sequences. CoRR abs/2406.17867 (2024) - 2022
- [j10]Nicolas Ollinger, Guillaume Theyssier:
Freezing, Bounded-Change and Convergent Cellular Automata. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - 2020
- [j9]Eric Goles, Diego Maldonado
, Pedro Montealegre, Nicolas Ollinger:
On the complexity of the stability problem of binary freezing totalistic cellular automata. Inf. Comput. 274: 104535 (2020)
2010 – 2019
- 2019
- [i6]Nicolas Ollinger, Guillaume Theyssier:
Freezing, Bounded-Change and Convergent Cellular Automata. CoRR abs/1908.06751 (2019) - [i5]Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger:
On the Complexity of the Stability Problem of Binary Freezing Totalistic Cellular Automata. CoRR abs/1912.02953 (2019) - 2018
- [c23]Eric Goles, Diego Maldonado, Pedro Montealegre-Barba, Nicolas Ollinger:
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. ACRI 2018: 406-415 - [c22]Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier:
Universality in Freezing Cellular Automata. CiE 2018: 50-59 - [c21]Nicolas Ollinger:
On Aperiodic Reversible Turing Machines (Invited Talk). RC 2018: 61-64 - [i4]Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier:
Universality in Freezing Cellular Automata. CoRR abs/1805.00059 (2018) - 2017
- [j8]Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres-Avilés:
A small minimal aperiodic reversible Turing machine. J. Comput. Syst. Sci. 84: 288-301 (2017) - [c20]Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger:
On the Computational Complexity of the Freezing Non-strict Majority Automata. AUTOMATA 2017: 109-119 - [c19]Martin Delacourt, Nicolas Ollinger:
Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups. CiE 2017: 234-245 - 2016
- [e2]Nicolas Ollinger, Heribert Vollmer:
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. LIPIcs 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-001-9 [contents] - 2015
- [j7]Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés:
Some undecidable problems about the trace-subshift associated to a Turing machine. Discret. Math. Theor. Comput. Sci. 17(2): 267-284 (2015) - [c18]Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés:
The Transitivity Problem of Turing Machines. MFCS (1) 2015: 231-242 - [c17]Ernst W. Mayr, Nicolas Ollinger:
Front Matter, Table of Contents, Preface, Conference Organization. STACS 2015 - [e1]Ernst W. Mayr, Nicolas Ollinger:
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. LIPIcs 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-78-1 [contents] - 2014
- [c16]Bastien Le Gloannec, Nicolas Ollinger:
Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings. Developments in Language Theory 2014: 227-238 - 2012
- [c15]Bastien Le Gloannec, Nicolas Ollinger:
Substitutions and Strongly Deterministic Tilesets. CiE 2012: 462-471 - [c14]Rodrigo Torres-Avilés, Nicolas Ollinger, Anahí Gajardo:
Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. RC 2012: 44-56 - [p1]Nicolas Ollinger:
Universalities in Cellular Automata. Handbook of Natural Computing 2012: 189-229 - 2011
- [j6]Nicolas Ollinger, Gaétan Richard:
Four states are enough! Theor. Comput. Sci. 412(1-2): 22-32 (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) - [c13]Nicolas Ollinger:
Tutorial on Cellular Automata. UC 2011: 34-35 - 2010
- [c12]Thomas Fernique, Nicolas Ollinger:
Combinatorial Substitutions and Sofic Tilings. JAC 2010: 100-110 - [c11]Fabien Givors, Grégory Lafitte, Nicolas Ollinger:
Infinite Time Cellular Automata: a Real Computation Model. JAC 2010: 111-120 - [i3]Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier:
Bulking II: Classifications of Cellular Automata. CoRR abs/1001.5471 (2010) - [i2]Thomas Fernique, Nicolas Ollinger:
Combinatorial substitutions and sofic tilings. CoRR abs/1009.5167 (2010) - [i1]Fabien Givors, Grégory Lafitte, Nicolas Ollinger:
Infinite Time Cellular Automata: A Real Computation Model. CoRR abs/1012.1221 (2010)
2000 – 2009
- 2009
- [j3]Nicolas Ollinger, Gaétan Richard:
Automata on the plane vs particles and collisions. Theor. Comput. Sci. 410(27-29): 2767-2773 (2009) - [c10]Nicolas Ollinger:
Tiling the Plane with a Fixed Number of Polyominoes. LATA 2009: 638-647 - 2008
- [b2]Nicolas Ollinger:
Programmation et indécidabilités dans les systèmes complexes. (Programming and undecidability in complex systems). University of Nice Sophia Antipolis, France, 2008 - [j2]Emmanuel Jeandel, Nicolas Ollinger:
Playing with Conway's problem. Theor. Comput. Sci. 409(3): 557-564 (2008) - [c9]Nicolas Ollinger:
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem. CiE 2008: 476-485 - [c8]Nicolas Ollinger, Gaétan Richard:
Collisions and their Catenations: Ultimately Periodic Tilings of the Plane. IFIP TCS 2008: 229-240 - [c7]Nicolas Ollinger:
Universalities in cellular automata a (short) survey. JAC 2008: 102-118 - [c6]Jarkko Kari, Nicolas Ollinger:
Periodicity and Immortality in Reversible Computing. MFCS 2008: 419-430 - [c5]Nicolas Ollinger:
Intrinsically Universal Cellular Automata. CSP 2008: 199-204 - [c4]Nicolas Ollinger, Gaétan Richard:
A Particular Universal Cellular Automaton. CSP 2008: 205-214 - 2003
- [c3]Nicolas Ollinger:
The Intrinsic Universality Problem of One-Dimensional Cellular Automata. STACS 2003: 632-641 - 2002
- [b1]Nicolas Ollinger:
Automates cellulaires : structures. (Cellular automata: structures). École normale supérieure de Lyon, France, 2002 - [j1]Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger:
The commutation of finite sets: a challenging problem. Theor. Comput. Sci. 273(1-2): 69-79 (2002) - [c2]Nicolas Ollinger:
The Quest for Small Universal Cellular Automata. ICALP 2002: 318-329 - 2001
- [c1]Nicolas Ollinger:
Two-States Bilinear Intrinsically Universal Cellular Automata. FCT 2001: 396-399
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.
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.
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.
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-05-24 00:58 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:
