Mots-clés

Nombre de documents

31

Nicolas Ollinger


Chapitre d'ouvrage1 document

Direction d'ouvrage, Proceedings, Dossier3 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 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〉

Article dans une revue4 documents

  • Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés. Some undecidable problems about the trace-subshift associated to a Turing machine. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, Vol. 17 no.2 (2), pp.267-284. 〈hal-01349052〉
  • Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier. Bulking I: an Abstract Theory of Bulking. Theoretical Computer Science, Elsevier, 2011, 412 (30), pp.3866-3880. 〈10.1016/j.tcs.2011.02.023〉. 〈hal-00980376〉
  • Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier. Bulking II: Classifications of cellular automata. Theoretical Computer Science, Elsevier, 2011, 412 (30), pp.3881-3905. 〈10.1016/j.tcs.2011.02.024〉. 〈hal-00980377〉
  • Nicolas Ollinger, Gaétan Richard. Four states are enough!. Journal of Theoretical Computer Science (TCS), Elsevier, 2011, 412 (1-2), pp.22-32. 〈10.1016/j.tcs.2010.08.018〉. 〈hal-00469841v2〉

Communication dans un congrès9 documents

  • Martin Delacourt, Nicolas Ollinger. Permutive one-way cellular automata and the finiteness problem for automaton groups. Computability in Europe, Jun 2017, Turku, Finland. Proceedings CiE 2017 in Turku, 2017, 〈http://math.utu.fi/cie2017/〉. 〈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. 24, pp.65--73, TUCS Lecture Notes. 〈http://math.utu.fi/automata2015/〉. 〈hal-01294144〉
  • Bastien Le Gloannec, Nicolas Ollinger. Knight tiles: particles and collisions in the realm of 4-way deterministic tilings. Arseny M. Shur and Mikhail V. Volkov. Developments in Language Theory (DLT), Aug 2014, Ekaterinburg, Russia. Springer, 8633, pp 227-238, 2014, LNCS. 〈10.1007/978-3-319-09698-8_20〉. 〈hal-00960244〉
  • Bastien Le Gloannec, Nicolas Ollinger. Substitutions and Strongly Deterministic Tilesets. S.B. Cooper, A. Dawar and B. Löwe. Computability in Europe (CiE), Jun 2012, Cambridge, United Kingdom. Springer, 7318, pp 462-471, 2012, LNCS. 〈10.1007/978-3-642-30870-3_47〉. 〈hal-00661887〉
  • Rodrigo Torres, Nicolas Ollinger, Anahi Gajardo. Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. Robert Glück and Tetsuo Yokoyama. RC 2012, Jul 2012, Copenhague, Denmark. Springer, 7581, pp.44-56, 2013, 〈10.1007/978-3-642-36315-3_4〉. 〈hal-00980369〉
  • Nicolas Ollinger. Tutorial on Cellular Automata. Cristian S. Calude and Jarkko Kari and Ion Petre and Grzegorz Rozenberg. UC 2011, Jun 2011, Turku, Finland. Springer, 6714, pp.34-35, 2011, 〈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. TUCS. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.111-120, 2010. 〈hal-00542411〉
  • Thomas Fernique, Nicolas Ollinger. Combinatorial Substitutions and Sofic Tilings. TUCS. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.100-110, 2010. 〈hal-00541992〉
  • Nicolas Ollinger. Universalities in cellular automata; a (short) survey. Bruno Durand. JAC 2008, Apr 2008, Uzès, France. Издательство МЦНМО, pp.102-118, 2008, Regular paper track. 〈hal-00274563〉

Thèse1 document

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

HDR1 document

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

Pré-publication, Document de travail12 documents

  • Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres. A Small Minimal Aperiodic Reversible Turing Machine. 2014. 〈hal-00975244〉
  • Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier. Bulking I: an Abstract Theory of Bulking. 2010. 〈hal-00451732v2〉
  • Thomas Fernique, Nicolas Ollinger. Combinatorial substitutions and sofic tilings. 2010. 〈hal-00521215〉
  • Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier. Bulking II: Classifications of Cellular Automata. 2010. 〈hal-00451727v2〉
  • Emmanuel Jeandel, Nicolas Ollinger. Playing with Conway's Problem. 14pages. 2008. 〈hal-00013788v2〉
  • Nicolas Ollinger, Gaétan Richard. Automata on the Plane vs Particles and Collisions. 2008. 〈hal-00310960v2〉
  • Nicolas Ollinger. Universalities in cellular automata; a (short) survey. 2008. 〈hal-00271840〉
  • Nicolas Ollinger. Tiling the Plane with a Fixed Number of Polyominoes. 2008. 〈hal-00335781〉
  • Nicolas Ollinger. Two-by-two Substitution Systems and the Undecidability of the Domino Problem. 10+6 pages. 2008. 〈hal-00204625v2〉
  • Nicolas Ollinger, Gaétan Richard. Collisions and their Catenations: Ultimately Periodic Tilings of the Plane. 2008. 〈hal-00175397v3〉
  • Jarkko Kari, Nicolas Ollinger. Periodicity and Immortality in Reversible Computing. Additional material available on the web at http://www.lif.univ-mrs.fr/~nollinge/rec/gnirut/. 2008. 〈hal-00270815〉
  • Nicolas Ollinger, Gaétan Richard. A particular universal cellular automaton. 2008. 〈hal-00095821v2〉