| 2012 | ||
|---|---|---|
| c15 | Bastien Le Gloannec, Nicolas Ollinger: Substitutions and Strongly Deterministic Tilesets. CiE 2012: 462-471 | |
| c14 | Rodrigo Torres, Nicolas Ollinger, Anahí Gajardo: Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. RC 2012: 44-56 | |
| 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 | ||
| 2010 | ||
| c12 | ||
| 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) | |
| 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 | ||
| 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 | ||
| c6 | Jarkko Kari, Nicolas Ollinger: Periodicity and Immortality in Reversible Computing. MFCS 2008: 419-430 | |
| c5 | ||
| c4 | ||
| 2003 | ||
| c3 | Nicolas Ollinger: The Intrinsic Universality Problem of One-Dimensional Cellular Automata. STACS 2003: 632-641 | |
| 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 | ||
| 2001 | ||
| c1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page