Given a finite set of local constraints, we seek a cellular automaton (ie, a local and uniform
algorithm) that self-stabilises on the configurations that satisfy these constraints. More …

Active quantum error correction on topological codes is one of the most promising routes to
long-term qubit storage. In view of future applications, the scalability of the used decoding …

The density classification problem is the computational problem of finding the majority in a
given array of votes, in a distributed fashion. It is known that no cellular automaton rule with …

In dynamical systems, some of the most important questions are related to phase transitions
and convergence time. We consider a one-dimensional probabilistic cellular automaton …

Ce mémoire d'habilitation présente différents travaux portant sur des structures discrètes
définies sur des réseaux réguliers. Ces travaux se situent à l'interface entre les probabilités …

Almost four decades ago, Gacs, Kurdyumov, and Levin introduced three different cellular
automata to investigate whether one-dimensional nonequilibrium interacting particle …

Je tiens tout d'abord à remercier très chaleureusement les membres de mon jury.
Frédérique Bassino, Nathanaël Enriquez et Nina Gantert ont tous les trois accepté …