Photo of Nicolas Bacquey

Current position

Postdoc at Inria Lille - Nord Europe, France.

Member of LINKS research team at the CRIStAL Lab and of the CoLiS ANR project.

A detailled Curriculum Vitae can be found here.

Research interests


Bacquey, N, Grandjean, E. and Olive, F (2017). Definability by Horn formulas and linear time on cellular automata. ICALP 2017 (working version with appendix)

Bacquey, N. (2015) Leader election on two-dimensional periodic cellular automata In Theoretical Computer Science, vol. 659, pages 36-52, 2017

Bacquey, N. (2015) Primitive roots of bi-periodic infinite pictures In Combinatorics on Words, 10th International Conference WORDS 2015, Local proceedings (pp. 1-16).

Bacquey, N. (2014) Complexity classes on spatially periodic cellular automata In 25th Symposium on Theoretical Aspects of Computer Science, volume 25 of LIPIcs (pp. 112-124).

Bacquey, N. (2012) The packing problem : A divide and conquer algorithm on cellular automata In Automata & JAC 2012, Local proceedings (pp. 1-10).


Bachelor's degree in Computer Science, from Université d'Aix Marseille II, France

Master's degree in Computer Science (Algorithms and Information Models), from Université de Caen Basse-Normandie, France

PhD in Computer Science, from Université de Caen Normandie, France
Thesis title : Automates cellulaires : Aspects algorithmiques des configurations périodiques en toute dimension
The full manuscript of my PhD thesis can be found (in french) here


nicolas.bacquey [at]

Office B213 - 03 59 35 87 08