Nicolas Ollinger

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:o/NicolasOllinger · DBLP profile ↗

← Back

22ranked-venue papers

9as first author

0since 2021 · last 2020

0000-0002-6826-1034ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 22 · 9 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

2 papers

Automata and formal languages · 78% Computational complexity · 22%

Topics — the 1 heaviest of 2, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Automata and formal languages cellular automata	0.5	2	2020	On the complexity of the stability problem of binary freezing totalistic cellular automata · Inf. Comput. 2020 The Quest for Small Universal Cellular Automata · ICALP 2002

Methods — techniques the papers use, named apart from their topics

simulation · 0.0

Year	Publication	Venue	Position
2020	On the complexity of the stability problem of binary freezing totalistic cellular automata Eric Goles Ch., Diego Maldonado, Pedro Montealegre-Barba, Nicolas Ollinger	Inf. Comput.	4
2018	Universality in Freezing Cellular Automata Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier	CiE	3
2018	On Aperiodic Reversible Turing Machines (Invited Talk) Nicolas Ollinger	RC	1
2017	Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups Martin Delacourt, Nicolas Ollinger	CiE	2
2017	A small minimal aperiodic reversible Turing machine Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres-Avilés	J. Comput. Syst. Sci.	2
2015	The Transitivity Problem of Turing Machines Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés	MFCS (1)	2
2015	Front Matter, Table of Contents, Preface, Conference Organization abstract Front Matter, Table of Contents, Preface, Conference Organization Ernst W. Mayr, Nicolas Ollinger	STACS	2
2014	Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings Bastien Le Gloannec, Nicolas Ollinger	Developments in Language Theory	2
2012	Substitutions and Strongly Deterministic Tilesets Bastien Le Gloannec, Nicolas Ollinger	CiE	2
2011	Tutorial on Cellular Automata Nicolas Ollinger	UC	1
2011	Bulking I: An abstract theory of bulking Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier	Theor. Comput. Sci.	3
2011	Bulking II: Classifications of cellular automata Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier	Theor. Comput. Sci.	3
2011	Four states are enough! Nicolas Ollinger, Gaétan Richard	Theor. Comput. Sci.	1
2009	Tiling the Plane with a Fixed Number of Polyominoes Nicolas Ollinger	LATA	1
2009	Automata on the plane vs particles and collisions Nicolas Ollinger, Gaétan Richard	Theor. Comput. Sci.	1
2008	Two-by-Two Substitution Systems and the Undecidability of the Domino Problem Nicolas Ollinger	CiE	1
2008	Periodicity and Immortality in Reversible Computing Jarkko Kari 0001, Nicolas Ollinger	MFCS	2
2008	Playing with Conway's problem Emmanuel Jeandel, Nicolas Ollinger	Theor. Comput. Sci.	2
2003	The Intrinsic Universality Problem of One-Dimensional Cellular Automata Nicolas Ollinger	STACS	1
2002	The Quest for Small Universal Cellular Automata Nicolas Ollinger	ICALP	1
2002	The commutation of finite sets: a challenging problem Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger	Theor. Comput. Sci.	3
2001	Two-States Bilinear Intrinsically Universal Cellular Automata Nicolas Ollinger	FCT	1