Two-States Bilinear Intrinsically Universal Cellular Automata. - Nicolas Ollinger (FCT, 2001)

The Quest for Small Universal Cellular Automata. - Nicolas Ollinger (ICALP, 2002)

The commutation of finite sets: a challenging problem. - Christian Choffrut; Juhani Karhumäki; Nicolas Ollinger (Theor. Comput. Sci., 2002)

Automates cellulaires : structures. (Cellular automata: structures). - Nicolas Ollinger (2002)

The Intrinsic Universality Problem of One-Dimensional Cellular Automata. - Nicolas Ollinger (STACS, 2003)

Programmation et indécidabilités dans les systèmes complexes. (Programming and undecidability in complex systems). - Nicolas Ollinger (2008)

Two-by-Two Substitution Systems and the Undecidability of the Domino Problem. - Nicolas Ollinger (CiE, 2008)

Collisions and their Catenations: Ultimately Periodic Tilings of the Plane. - Nicolas Ollinger; Gaétan Richard (IFIP TCS, 2008)

Universalities in cellular automata a (short) survey. - Nicolas Ollinger (JAC, 2008)

Periodicity and Immortality in Reversible Computing. - Jarkko Kari; Nicolas Ollinger (MFCS, 2008)

Intrinsically Universal Cellular Automata - Nicolas Ollinger (CSP, 2008)

A Particular Universal Cellular Automaton - Nicolas Ollinger; Gaétan Richard (CSP, 2008)

Playing with Conway's problem. - Emmanuel Jeandel; Nicolas Ollinger (Theor. Comput. Sci., 2008)

Tiling the Plane with a Fixed Number of Polyominoes. - Nicolas Ollinger (LATA, 2009)

Automata on the plane vs particles and collisions. - Nicolas Ollinger; Gaétan Richard (Theor. Comput. Sci., 2009)

Combinatorial Substitutions and Sofic Tilings. - Thomas Fernique; Nicolas Ollinger (JAC, 2010)

Infinite Time Cellular Automata: a Real Computation Model. - Fabien Givors; Grégory Lafitte; Nicolas Ollinger (JAC, 2010)

Tutorial on Cellular Automata. - Nicolas Ollinger (UC, 2011)

Bulking I: An abstract theory of bulking. - Marianne Delorme; Jacques Mazoyer; Nicolas Ollinger; Guillaume Theyssier (Theor. Comput. Sci., 2011)

Bulking II: Classifications of cellular automata. - Marianne Delorme; Jacques Mazoyer; Nicolas Ollinger; Guillaume Theyssier (Theor. Comput. Sci., 2011)

Four states are enough! - Nicolas Ollinger; Gaétan Richard (Theor. Comput. Sci., 2011)

Substitutions and Strongly Deterministic Tilesets. - Bastien Le Gloannec; Nicolas Ollinger (CiE, 2012)

Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. - Rodrigo Torres-Avilés; Nicolas Ollinger; Anahí Gajardo (RC, 2012)

Universalities in Cellular Automata. - Nicolas Ollinger (Handbook of Natural Computing, 2012)

Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings. - Bastien Le Gloannec; Nicolas Ollinger (Developments in Language Theory, 2014)

The Transitivity Problem of Turing Machines. - Anahí Gajardo; Nicolas Ollinger; Rodrigo Torres-Avilés (MFCS (1), 2015)

Front Matter, Table of Contents, Preface, Conference Organization. - Ernst W. Mayr; Nicolas Ollinger (STACS, 2015)

Some undecidable problems about the trace-subshift associated to a Turing machine. - Anahí Gajardo; Nicolas Ollinger; Rodrigo Torres-Avilés (Discret. Math. Theor. Comput. Sci., 2015)

On the Computational Complexity of the Freezing Non-strict Majority Automata. - Eric Goles 001; Diego Maldonado; Pedro Montealegre 001; Nicolas Ollinger (AUTOMATA, 2017)

Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups. - Martin Delacourt; Nicolas Ollinger (CiE, 2017)

A small minimal aperiodic reversible Turing machine. - Julien Cassaigne; Nicolas Ollinger; Rodrigo Torres-Avilés (J. Comput. Syst. Sci., 2017)

Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. - Eric Goles 001; Diego Maldonado; Pedro Montealegre-Barba; Nicolas Ollinger (ACRI, 2018)

Universality in Freezing Cellular Automata. - Florent Becker; Diego Maldonado; Nicolas Ollinger; Guillaume Theyssier (CiE, 2018)

On Aperiodic Reversible Turing Machines (Invited Talk). - Nicolas Ollinger (RC, 2018)

On the complexity of the stability problem of binary freezing totalistic cellular automata. - Eric Goles 001; Diego Maldonado; Pedro Montealegre 001; Nicolas Ollinger (Inf. Comput., 2020)

Freezing, Bounded-Change and Convergent Cellular Automata. - Nicolas Ollinger; Guillaume Theyssier (Discret. Math. Theor. Comput. Sci., 2022)

Addition in Dumont-Thomas Numeration Systems in Theory and Practice. - Olivier Carton; Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger (CoRR, 2024)

The Repetition Threshold for Rote Sequences. - Nicolas Ollinger; Jeffrey O. Shallit (CoRR, 2024)

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems. - Olivier Carton; Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger (WORDS, 2025)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences. - Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger; Pierre Popoli; Jeffrey O. Shallit; Manon Stipulanti (CoRR, 2025)