| 2009 |
|---|
| 12 | EE | Nicolas Ollinger:
Tiling the Plane with a Fixed Number of Polyominoes.
LATA 2009: 638-647 |
| 2008 |
|---|
| 11 | | Nicolas Ollinger:
Intrinsically Universal Cellular Automata.
CSP 2008: 259-266 |
| 10 | | Nicolas Ollinger,
Gaétan Richard:
A Particular Universal Cellular Automaton.
CSP 2008: 267-278 |
| 9 | EE | Nicolas Ollinger:
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem.
CiE 2008: 476-485 |
| 8 | EE | Nicolas Ollinger,
Gaétan Richard:
Collisions and their Catenations: Ultimately Periodic Tilings of the Plane.
IFIP TCS 2008: 229-240 |
| 7 | | Nicolas Ollinger:
Universalities in cellular automata a (short) survey.
JAC 2008: 102-118 |
| 6 | EE | Jarkko Kari,
Nicolas Ollinger:
Periodicity and Immortality in Reversible Computing.
MFCS 2008: 419-430 |
| 5 | EE | Emmanuel Jeandel,
Nicolas Ollinger:
Playing with Conway's problem.
Theor. Comput. Sci. 409(3): 557-564 (2008) |
| 2003 |
|---|
| 4 | EE | Nicolas Ollinger:
The Intrinsic Universality Problem of One-Dimensional Cellular Automata.
STACS 2003: 632-641 |
| 2002 |
|---|
| 3 | EE | Nicolas Ollinger:
The Quest for Small Universal Cellular Automata.
ICALP 2002: 318-329 |
| 2 | EE | Christian Choffrut,
Juhani Karhumäki,
Nicolas Ollinger:
The commutation of finite sets: a challenging problem.
Theor. Comput. Sci. 273(1-2): 69-79 (2002) |
| 2001 |
|---|
| 1 | EE | Nicolas Ollinger:
Two-States Bilinear Intrinsically Universal Cellular Automata.
FCT 2001: 396-399 |
