| Periodicity and immortality in reversible computing J Kari, N Ollinger International Symposium on Mathematical Foundations of Computer Science, 419-430, 2008 | 100 | 2008 |
| The quest for small universal cellular automata N Ollinger Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002 | 69 | 2002 |
| The intrinsic universality problem of one-dimensional cellular automata N Ollinger Annual Symposium on Theoretical Aspects of Computer Science, 632-641, 2003 | 65 | 2003 |
| Universalities in cellular automata; a (short) survey N Ollinger JAC 2008, 102-118, 2008 | 57 | 2008 |
| Bulking II: Classifications of cellular automata M Delorme, J Mazoyer, N Ollinger, G Theyssier Theoretical Computer Science 412 (30), 3881-3905, 2011 | 53 | 2011 |
| The commutation of finite sets: a challenging problem C Choffrut, J Karhumäki, N Ollinger Theoretical Computer Science 273 (1-2), 69-79, 2002 | 53 | 2002 |
| Automates cellulaires: structures N Ollinger Ecole normale supérieure de lyon-ENS LYON, 2002 | 49 | 2002 |
| Bulking I: an abstract theory of bulking M Delorme, J Mazoyer, N Ollinger, G Theyssier Theoretical Computer Science 412 (30), 3866-3880, 2011 | 46 | 2011 |
| Bulking I: an abstract theory of bulking M Delorme, J Mazoyer, N Ollinger, G Theyssier Theoretical Computer Science 412 (30), 3866-3880, 2011 | 46 | 2011 |
| Two-by-two substitution systems and the undecidability of the domino problem N Ollinger Conference on Computability in Europe, 476-485, 2008 | 39 | 2008 |
| Four states are enough! N Ollinger, G Richard Theoretical Computer Science 412 (1-2), 22-32, 2011 | 38 | 2011 |
| Introducing freezing cellular automata E Goles, N Ollinger, G Theyssier Cellular Automata and Discrete Complex Systems, 21st International Workshop …, 2015 | 31 | 2015 |
| Universalities in Cellular Automata* N Ollinger Handbook of Natural Computing, 189-229, 2012 | 26 | 2012 |
| Combinatorial substitutions and sofic tilings T Fernique, N Ollinger arXiv preprint arXiv:1009.5167, 2010 | 26 | 2010 |
| Tiling the plane with a fixed number of polyominoes N Ollinger Language and Automata Theory and Applications: Third International …, 2009 | 25 | 2009 |
| Intrinsically universal cellular automata N Ollinger arXiv preprint arXiv:0906.3213, 2009 | 24 | 2009 |
| A small minimal aperiodic reversible Turing machine J Cassaigne, N Ollinger, R Torres-Avilés Journal of Computer and System Sciences 84, 288-301, 2017 | 22 | 2017 |
| Freezing, bounded-change and convergent cellular automata N Ollinger, G Theyssier Discrete Mathematics & Theoretical Computer Science 24 (Automata, Logic and …, 2022 | 17 | 2022 |
| On the computational complexity of the freezing non-strict majority automata E Goles, D Maldonado, P Montealegre, N Ollinger International Workshop on Cellular Automata and Discrete Complex Systems …, 2017 | 15 | 2017 |
| On the Computational Complexity of the Freezing Non-strict Majority Automata E Goles, D Maldonado, P Montealegre, N Ollinger International Workshop on Cellular Automata and Discrete Complex Systems …, 2017 | 15 | 2017 |
Guillaume TheyssierCNRS, Université de Savoie在 univ-savoie.fr 的电子邮件经过验证
