Nicolas Ollinger

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 13

Top Venues

CoRR

Discret. Math. Theor. Comput. Sci.

CiE

J. Comput. Syst. Sci.

École normale supérieure de Lyon, France (PHD)

Education History

École normale supérieure de Lyon, France

PHD

Publications

Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger
Addition in Dumont-Thomas Numeration Systems in Theory and Practice. CoRR (2024)
Nicolas Ollinger, Jeffrey O. Shallit
The Repetition Threshold for Rote Sequences. CoRR (2024)
Nicolas Ollinger, Guillaume Theyssier
Freezing, Bounded-Change and Convergent Cellular Automata. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger
On the complexity of the stability problem of binary freezing totalistic cellular automata. Inf. Comput. 274 (2020)
Nicolas Ollinger, Guillaume Theyssier
Freezing, Bounded-Change and Convergent Cellular Automata. CoRR (2019)
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger
On the Complexity of the Stability Problem of Binary Freezing Totalistic Cellular Automata. CoRR (2019)
Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier
Universality in Freezing Cellular Automata. CiE (2018)
Eric Goles, Diego Maldonado, Pedro Montealegre-Barba, Nicolas Ollinger
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. ACRI (2018)
Nicolas Ollinger
On Aperiodic Reversible Turing Machines (Invited Talk). RC (2018)
Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier
Universality in Freezing Cellular Automata. CoRR (2018)
Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres-Avilés
A small minimal aperiodic reversible Turing machine. J. Comput. Syst. Sci. 84 (2017)
Martin Delacourt, Nicolas Ollinger
Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups. CiE (2017)
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger
On the Computational Complexity of the Freezing Non-strict Majority Automata. AUTOMATA (2017)
Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés
The Transitivity Problem of Turing Machines. MFCS (1) (2015)
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) (2015)
Ernst W. Mayr, Nicolas Ollinger
Front Matter, Table of Contents, Preface, Conference Organization. STACS (2015)
Bastien Le Gloannec, Nicolas Ollinger
Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings. Developments in Language Theory (2014)
Bastien Le Gloannec, Nicolas Ollinger
Substitutions and Strongly Deterministic Tilesets. CiE (2012)
Rodrigo Torres-Avilés, Nicolas Ollinger, Anahí Gajardo
Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. RC (2012)
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
Bulking II: Classifications of cellular automata. Theor. Comput. Sci. 412 (30) (2011)
Nicolas Ollinger
Tutorial on Cellular Automata. UC (2011)
Nicolas Ollinger, Gaétan Richard
Four states are enough! Theor. Comput. Sci. 412 (1-2) (2011)
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
Bulking I: An abstract theory of bulking. Theor. Comput. Sci. 412 (30) (2011)
Fabien Givors, Grégory Lafitte, Nicolas Ollinger
Infinite Time Cellular Automata: A Real Computation Model CoRR (2010)
Thomas Fernique, Nicolas Ollinger
Combinatorial substitutions and sofic tilings CoRR (2010)
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
Bulking II: Classifications of Cellular Automata CoRR (2010)
Thomas Fernique, Nicolas Ollinger
Combinatorial Substitutions and Sofic Tilings. JAC (2010)
Fabien Givors, Grégory Lafitte, Nicolas Ollinger
Infinite Time Cellular Automata: a Real Computation Model. JAC (2010)
Nicolas Ollinger
Tiling the Plane with a Fixed Number of Polyominoes. LATA (2009)
Nicolas Ollinger, Gaétan Richard
Automata on the plane vs particles and collisions. Theor. Comput. Sci. 410 (27-29) (2009)
Nicolas Ollinger, Gaétan Richard
A Particular Universal Cellular Automaton CSP (2008)
Nicolas Ollinger
Universalities in cellular automata a (short) survey. JAC (2008)
Jarkko Kari, Nicolas Ollinger
Periodicity and Immortality in Reversible Computing. MFCS (2008)
Nicolas Ollinger, Gaétan Richard
Collisions and their Catenations: Ultimately Periodic Tilings of the Plane. IFIP TCS (2008)
Nicolas Ollinger
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem. CiE (2008)
Nicolas Ollinger
Intrinsically Universal Cellular Automata CSP (2008)
Emmanuel Jeandel, Nicolas Ollinger
Playing with Conway's problem. Theor. Comput. Sci. 409 (3) (2008)
Nicolas Ollinger
The Intrinsic Universality Problem of One-Dimensional Cellular Automata. STACS (2003)
Nicolas Ollinger
The Quest for Small Universal Cellular Automata. ICALP (2002)
Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger
The commutation of finite sets: a challenging problem. Theor. Comput. Sci. 273 (1-2) (2002)
Nicolas Ollinger
Two-States Bilinear Intrinsically Universal Cellular Automata. FCT (2001)

Nicolas Ollinger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicolas Ollinger