Thesis and Habilitation
- N. Ollinger, Programmation et indécidabilités dans les systèmes complexes, Habilitation thesis, Université de Nice Sophia Antipolis, december 2008.
- N. Ollinger, Automates cellulaires : structures, PhD thesis, ENS Lyon, december 2002.
Peer-reviewed International Journals
- N. Ollinger et G. Theyssier, Freezing, Bounded-Change and Convergent Cellular Automata, Discrete Mathematics & Theoretical Computer Science, 24, no. 1 (2022) 1–37.
- E. Goles, D. Maldonado, P. Montealegre, et N. Ollinger, On the complexity of the stability problem of binary freezing totalistic cellular automata., Information and Computation, 274 (2020) 104535. (Elsevier)
- J. Cassaigne, N. Ollinger et R. Torres, A Small Minimal Aperiodic Reversible Turing Machine, Journal of Computer and System Sciences, 84 (2017), 288–301. (Elsevier)
- A. Gajardo, N. Ollinger et R. Torres-Avilés, Some undecidable problems about the trace-subshift associated to a Turing machine, Discrete Mathematics & Theoretical Computer Science, 17, no. 2 (2015) 267–284.
- M. Delorme, J. Mazoyer, N. Ollinger et G. Theyssier, Bulking I: an Abstract Theory of Bulking, Theoretical Computer Science, 412, no. 30 (2011) 3866–3880. (Elsevier)
- M. Delorme, J. Mazoyer, N. Ollinger et G. Theyssier, Bulking II: Classifications of Cellular Automata, Theoretical Computer Science, 412, no. 30 (2011) 3881–3905. (Elsevier)
- N. Ollinger et G. Richard, Four states are enough!, Theoretical Computer Science, 412, no. 1–2 (2011) 22–32. (Elsevier)
- N. Ollinger et G. Richard, Automata on the Plane vs Particles and Collisions, Theoretical Computer Science, 410, no. 27–29 (2009) 2767–2773. (Elsevier)
- E. Jeandel et N. Ollinger, Playing with Conway’s Problem, Theoretical Computer Science, 409, no. 3 (2008) 557–564. (Elsevier)
- C. Choffrut, J. Karhumäki et N. Ollinger, The commutation of finite sets: a challenging problem, Theoretical Computer Science, 273, no. 1–2 (2002) 69–79. (Elsevier)
Proceedings of Peer-reviewed International Conferences
- F. Becker, D. Maldonado, N. Ollinger et G. Theyssier, Universality in Freezing Cellular Automata, Computability in Europe (CiE'2018), édité par F. Manea, R. Miller et D. Nowotka, LNCS 10936 (Springer, Berlin, 2018), (pp. 50–59). (Springer)
- E. Goles, D. Maldonado, P. Montealegre-Barba et N. Ollinger, Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata, International Conference on Cellular Automata for Research and Industry (ACRI'2018), édité par G. Mauri, S. El Yacoubi, A. Dennunzio, K. Nishinari et L. Manzoni, LNCS 11115 (Springer, Berlin, 2018), (pp. 406–415). (Springer)
- N. Ollinger, On aperiodic reversible turing machines (invited talk), Reversible Computation (RC'2018), édité par J. Kari et I. Ulidowski, LNCS 11106 (Springer, Berlin, 2018), (pp. 61-64). (Springer)
- M. Delacourt et N. Ollinger, Permutive one-way cellular automata and the finiteness problem for automaton groups, Computability in Europe (CiE'2017), édité par J. Kari, LNCS 10307 (Springer, Berlin, 2017), (pp. 234–245). (Springer)
- E. Goles, D. Maldonado, P. Montealegre, et N. Ollinger, On the Computational Complexity of the Freezing Non-strict Majority Automata, Cellular Automata and Discrete Complex Systems (AUTOMATA'2017), édité par A. Dennunzio, E. Formenti, L. Manzoni, et A. E. Porreca, LNCS 10248 (Springer, Berlin, 2017), (pp. 109–119). (Springer)
- A. Gajardo, N. Ollinger et R. Torres, The transitivity problem of Turing Machines, Mathematical Foundations of Computer Science (MFCS'2015), édité par G. Italiano, G. Pighizzini et D. Sannella, LNCS 9234 (Springer, Berlin, 2015), (pp. 231–242). (Springer)
- B. Le Gloannec et N. Ollinger, Knight tiles: particles and collisions in the realm of 4-way deterministic tilings, Developments in Language Theory (DLT'2014), édité par A. M. Shur et M. V. Volkov, LNCS 8633 (Springer, Berlin, 2014), (pp. 227–238). (Springer)
- R. Torres, N. Ollinger et A. Gajardo, Undecidability of the surjectivity of the subshift associated to a Turing machine, Reversible Computation (RC'2012), édité par R. Glück et T. Yokoyama, LNCS 7581 (Springer, Berlin, 2013), (pp. 44–56). (Springer)
- B. Le Gloannec et N. Ollinger, Substitutions and Strongly Deterministic Tilesets, Computability in Europe (CIE'2012), édité par S.B. Cooper, A. Dawar et B. Löwe, LNCS 7318 (Springer, Berlin, 2012), (pp. 462–471). (Springer)
- Th. Fernique et N. Ollinger, Combinatorial Substitutions and Sofic Tilings, Symposium on Cellular Automata Journées Automates Cellulaires (JAC'2010), édité par J. Kari, (TUCS Lecture Notes, Turku), (pp. 100–110). (JAC@HAL)
- F. Givors, G. Lafitte et N. Ollinger, Infinite Time Cellular Automata: a Real Computation Model, Symposium on Cellular Automata Journées Automates Cellulaires (JAC'2010), édité par J. Kari, (TUCS Lecture Notes, Turku), (pp. 111–120). (JAC@HAL)
- N. Ollinger, Tiling the Plane with a Fixed Number of Polyominoes, Proceedings of the Third International Conference on Language and Automata Theory and Applications (LATA'2009), édité par A. H. Dediu, A. M. Ionescu et C. Martín-Vide, LNCS 5457 (Springer, Berlin, 2009), (pp. 638–647). (Springer)
- N. Ollinger et G. Richard, A Particular Universal Cellular Automaton, Proceedings of International Workshop on The Complexity of Simple Programs (CSP'08), édité par T. Neary, D. Woods, T. Seda et N. Murphy, EPTCS 1, (pp. 205–214).
- N. Ollinger, Intrinsically Universal Cellular Automata, Proceedings of International Workshop on The Complexity of Simple Programs (CSP'08), édité par T. Neary, D. Woods, T. Seda et N. Murphy, EPTCS 1, (pp. 199–204).
- N. Ollinger et G. Richard, Collisions and their Catenations: Ultimately Periodic Tilings of the Plane, Proceedings of the Fifth IFIP Int. Conf. on TCS (IFIP-TCS'2008), vol 273/2008 (Springer, Boston, 2008), (pp. 229–240). (Springer)
- J. Kari et N. Ollinger, Periodicity and Immortality in Reversible Computing, Mathematical Foundations of Computer Science (MFCS'2008), édité par E. Ochmański et J. Tyszkiewicz, LNCS 5162 (Springer, Berlin, 2008), (pp. 419–430). (Springer)
- N. Ollinger, Universalities in Cellular Automata: a (short) survey, Symposium on Cellular Automata Journées Automates Cellulaires (JAC'2008), édité par B. Durand, (MCCME Publishing House, Moscou), (pp. 102–118). (JAC@HAL)
- N. Ollinger, Two-by-two Substitution Systems and the Undecidability of the Domino Problem, Computability in Europe (CiE'2008), édité par A. Beckmann, C. Dimitracopoulos et B. Löwe, LNCS 5028 (Springer, Berlin, 2008), (pp. 476–485). (Springer)
- N. Ollinger, The intrinsic universality problem of one-dimensional cellular automata, Symposium on Theoretical Aspects of Computer Science (STACS'2003), edité par H. Alt et M. Habib, LNCS 2607 (Springer, Berlin, 2003), (pp. 632–641). (Springer)
- N. Ollinger, The quest for small universal cellular automata, International Colloquium on Automata, languages and programming (ICALP'2002), edité par P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz et R. Conejo, LNCS 2380 (Springer, Berlin, 2002), (pp. 318–329). (Springer)
- N. Ollinger, Two-states bilinear intrinsically universal cellular automata, Fundamentals of computation theory (FCT'2001), edité par R. Freivalds, LNCS 2138 (Springer, Berlin, 2001), (pp. 396–399). (Springer)
Chapters in Books
- N. Ollinger. Le calcul numérique in Informatique Mathématique, une photographie en 2022 (CNRS Éditions, ISBN: 978-2-271-14458-4, 2022), (pp. 157-190).
- N. Ollinger, Universalities in Cellular Automata in Handbook of Natural Computing (Springer, ISBN: 978-3-540-92911-6, 2012), (pp. 189–229).
Proceedings of Peer-reviewed International Workshops
- E. Goles, N. Ollinger et G. Theyssier, Introducing freezing cellular automata, Exploratory Papers of Cellular Automata and Discrete Complex Systems (AUTOMATA'2015), édité par J. Kari, I. Törmä et M. Szabados, TUCS Lecture Notes 24 (Turku Centre for Computer Science, 2015), (pp. 65–73).