Nicolas Ollinger
Présentation
Publications
Publications
Le calcul numériqueBruno MARTIN; Sara RIVA. Informatique Mathématique Une photographie en 2022, CNRS Éditions, 2022, 9782271144584 |
|
Universalities in Cellular AutomataGrzegorz Rozenberg and Thomas Bäck and Joost N. Kok. Handbook of Natural Computing, Springer, pp.189-229, 2012, 978-3-540-92909-3. ⟨10.1007/978-3-540-92910-9_6⟩ |
|
|
Linear Recurrence Sequence Automata and the Addition of Abstract Numeration SystemsWORDS 2025, Jun 2025, Nancy, France. pp.70-82, ⟨10.1007/978-3-031-97548-6_7⟩ |
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata13th 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⟩ |
|
|
|
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⟩ |
|
|
Universality in Freezing Cellular Automata14th Conference on Computability in Europe (CiE 2018), Jul 2018, Kiel, Germany. pp. 50-59, ⟨10.1007/978-3-319-94418-0_5⟩ |
|
|
On the Computational Complexity of the Freezing Non-strict Majority Automata23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.109-119, ⟨10.1007/978-3-319-58631-1_9⟩ |
|
|
Permutive one-way cellular automata and the finiteness problem for automaton groupsComputability in Europe, Jun 2017, Turku, Finland. ⟨10.1007/978-3-319-58741-7_23⟩ |
|
|
Introducing Freezing Cellular AutomataCellular Automata and Discrete Complex Systems, 21st International Workshop (AUTOMATA 2015), Jun 2015, Turku, Finland. pp.65--73 |
|
|
The transitivity problem of Turing machinesMathematical Foundations of Computer Science 2015 - 40th International Symposium (MFCS 2015), Aug 2015, Milan, Italy. pp. 231-242, ⟨10.1007/978-3-662-48057-1_18⟩ |
|
|
Knight tiles: particles and collisions in the realm of 4-way deterministic tilingsDevelopments in Language Theory (DLT), Aug 2014, Ekaterinburg, Russia. pp 227-238, ⟨10.1007/978-3-319-09698-8_20⟩ |
|
|
Undecidability of the Surjectivity of the Subshift Associated to a Turing MachineRC 2012, Jul 2012, Copenhague, Denmark. pp.44-56, ⟨10.1007/978-3-642-36315-3_4⟩ |
|
|
Substitutions and Strongly Deterministic TilesetsComputability in Europe (CiE), Jun 2012, Cambridge, United Kingdom. pp 462-471, ⟨10.1007/978-3-642-30870-3_47⟩ |
Tutorial on Cellular AutomataUC 2011, Jun 2011, Turku, Finland. pp.34-35, ⟨10.1007/978-3-642-21341-0_7⟩ |
|
|
|
Infinite Time Cellular Automata: a Real Computation ModelJournées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.111-120 |
|
|
Combinatorial Substitutions and Sofic TilingsJournées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.100-110 |
|
|
Universalities in cellular automata; a (short) surveyJAC 2008, Apr 2008, Uzès, France. pp.102-118 |
The Intrinsic Universality Problem of One-Dimensional Cellular AutomataSTACS 2003, Feb 2003, Berlin, Germany. pp.632-641, ⟨10.1007/3-540-36494-3_55⟩ |
|
The Quest for Small Universal Cellular AutomataICALP 2002, Jul 2002, Malaga, Spain. pp.318-329, ⟨10.1007/3-540-45465-9_28⟩ |
|
Two-States Bilinear Intrinsically Universal Cellular AutomataFCT 2001, Aug 2001, Riga, Latvia. pp.396-399, ⟨10.1007/3-540-44669-9_41⟩ |
|
|
Automates cellulaires : structuresAutre [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2002. Français. ⟨NNT : ⟩ |
|
|
Programmation et indécidabilités dans les systèmes complexesInformatique [cs]. Université de Nice-Sophia Antipolis, 2008 |