| 2018 | CiE | Universality in Freezing Cellular Automata. | Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier |
| 2018 | RC | On Aperiodic Reversible Turing Machines (Invited Talk). | Nicolas Ollinger |
| 2017 | CiE | Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups. | Martin Delacourt, Nicolas Ollinger |
| 2015 | MFCS | The Transitivity Problem of Turing Machines. | Anah Gajardo, Nicolas Ollinger, Rodrigo Torres-Avils |
| 2015 | STACS | Front Matter, Table of Contents, Preface, Conference Organization. | Ernst W. Mayr, Nicolas Ollinger |
| 2014 | DLT | Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings. | Bastien Le Gloannec, Nicolas Ollinger |
| 2012 | CiE | Substitutions and Strongly Deterministic Tilesets. | Bastien Le Gloannec, Nicolas Ollinger |
| 2012 | RC | Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. | Rodrigo Torres-Avils, Nicolas Ollinger, Anah Gajardo |
| 2011 | UC | Tutorial on Cellular Automata. | Nicolas Ollinger |
| 2009 | LATA | Tiling the Plane with a Fixed Number of Polyominoes. | Nicolas Ollinger |
| 2008 | CiE | Two-by-Two Substitution Systems and the Undecidability of the Domino Problem. | Nicolas Ollinger |
| 2008 | MFCS | Periodicity and Immortality in Reversible Computing. | Jarkko Kari, Nicolas Ollinger |
| 2003 | STACS | The Intrinsic Universality Problem of One-Dimensional Cellular Automata. | Nicolas Ollinger |
| 2002 | ICALP | The Quest for Small Universal Cellular Automata. | Nicolas Ollinger |
| 2001 | FCT | Two-States Bilinear Intrinsically Universal Cellular Automata. | Nicolas Ollinger |