Skip to Main content

Keywords

Number of documents

23

Nicolas Ollinger


Book sections1 document

Directions of work or proceedings3 documents

  • Nicolas Ollinger, Heribert Vollmer. 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). STACS 2016, Feb 2016, Orléans, France. 47, 2016, LIPIcs, 978-3-95977-001-9. ⟨10.4230/LIPIcs.STACS.2016.0⟩. ⟨hal-01294131⟩
  • Nicolas Ollinger. Informatique Mathématique: Une photographie en 2015. École Jeunes Chercheurs en Informatique Mathématique, Mar 2015, Orléans, France. CNRS Éditions, 2015, CNRS Alpha, 978-2-271-08791-1. ⟨hal-01294133⟩
  • Ernst W. Mayr, Nicolas Ollinger. 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). STACS 2015, Mar 2015, Munich, Germany. 30, 2015, LIPIcs, 978-3-939897- 78-1. ⟨10.4230/LIPIcs.STACS.2015.i⟩. ⟨hal-01294132⟩

Journal articles5 documents

Conference papers12 documents

  • Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier. Universality in Freezing Cellular Automata. 14th Conference on Computability in Europe (CiE 2018), Jul 2018, Kiel, Germany. pp. 50-59, ⟨10.1007/978-3-319-94418-0_5⟩. ⟨hal-01772500⟩
  • Eric Goles, Diego Maldonado, Pedro Montealegre-Barba, Nicolas Ollinger. Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. 13th International Conference on Cellular Automata for Research and Industry (ACRI 2018), Sep 2018, Como, Italy. pp.406-415, ⟨10.1007/978-3-319-99813-8_37⟩. ⟨hal-01985010⟩
  • Nicolas Ollinger. On Aperiodic Reversible Turing Machines (invited talk). Reversible Computation 10th International Conference (RC 2018), Sep 2018, Leicester, United Kingdom. pp.61-64, ⟨10.1007/978-3-319-99498-7_4⟩. ⟨hal-01984995⟩
  • Martin Delacourt, Nicolas Ollinger. Permutive one-way cellular automata and the finiteness problem for automaton groups. Computability in Europe, Jun 2017, Turku, Finland. ⟨hal-01436460v2⟩
  • Eric Goles, Nicolas Ollinger, Guillaume Theyssier. Introducing Freezing Cellular Automata. Cellular Automata and Discrete Complex Systems, 21st International Workshop (AUTOMATA 2015), Jun 2015, Turku, Finland. pp.65--73. ⟨hal-01294144⟩
  • Bastien Le Gloannec, Nicolas Ollinger. Knight tiles: particles and collisions in the realm of 4-way deterministic tilings. Developments in Language Theory (DLT), Aug 2014, Ekaterinburg, Russia. pp 227-238, ⟨10.1007/978-3-319-09698-8_20⟩. ⟨hal-00960244⟩
  • Rodrigo Torres, Nicolas Ollinger, Anahi Gajardo. Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. RC 2012, Jul 2012, Copenhague, Denmark. pp.44-56, ⟨10.1007/978-3-642-36315-3_4⟩. ⟨hal-00980369⟩
  • Bastien Le Gloannec, Nicolas Ollinger. Substitutions and Strongly Deterministic Tilesets. Computability in Europe (CiE), Jun 2012, Cambridge, United Kingdom. pp 462-471, ⟨10.1007/978-3-642-30870-3_47⟩. ⟨hal-00661887⟩
  • Nicolas Ollinger. Tutorial on Cellular Automata. UC 2011, Jun 2011, Turku, Finland. pp.34-35, ⟨10.1007/978-3-642-21341-0_7⟩. ⟨hal-00980394⟩
  • Fabien Givors, Grégory Lafitte, Nicolas Ollinger. Infinite Time Cellular Automata: a Real Computation Model. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.111-120. ⟨hal-00542411⟩
  • Thomas Fernique, Nicolas Ollinger. Combinatorial Substitutions and Sofic Tilings. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.100-110. ⟨hal-00541992⟩
  • Nicolas Ollinger. Universalities in cellular automata; a (short) survey. JAC 2008, Apr 2008, Uzès, France. pp.102-118. ⟨hal-00274563⟩

Theses1 document

  • Nicolas Ollinger. Automates cellulaires : structures. Autre [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2002. Français. ⟨tel-00007765⟩

Habilitation à diriger des recherches1 document

  • Nicolas Ollinger. Programmation et indécidabilités dans les systèmes complexes. Informatique [cs]. Université de Nice-Sophia Antipolis, 2008. ⟨tel-01084729⟩