Publications
Preprints

Aperiodicity in Quantum Wang Tilings  [pdf] [arXiv]
Titouan Carette, E.M., 2023 
Pattern Complexity of Aperiodic Substitutive Subshifts  [pdf] [arXiv]
E.M., Coline PetitJean, 2021
International journals

Weakly and Strongly Aperiodic Subshifts of Finite Type on BaumslagSolitar Groups  [pdf] [arXiv] [Editor]
Solène Esnay, E.M., in Theoretical Computer Science, 2022 
Decidability and Periodicity of Low Complexity Tilings (long version)  [pdf] [arXiv] [Editor]
Jarkko Kari, E.M., in Theory of Computing Systems, 2021 
Computational limitations of affine automata and generalized affine automata (long version)  [pdf] [Editor]
Mika Hirvensalo, E.M., Abuzer Yakaryılmaz, in Natural Computing, 2021 
Slopes of multidimensional subshifts  [pdf] [Editor]
Emmanuel Jeandel, E.M., Pascal Vanier, in Theory of Computing Systems, 2020 
Nivat's Conjecture and Pattern Complexity in Algebraic Subshifts  [pdf] [arXiv] [Editor]
Jarkko Kari, E.M., in Theoretical Computer Science, 2019
International conferences

Compositionality of planar perfect matchings  [pdf] [arXiv] [Editor]
Titouan Carette, E.M., Thomas Perez, Renaud Vilmart, International Colloquium on Automata, Languages, and Programming (ICALP) 2023. Paderborn, 2023 
Decidability and Periodicity of Low Complexity Tilings (short version)  [pdf] [Editor]  [slides]
Jarkko Kari, E.M., Symposium on Theoretical Aspects of Computer Science (STACS) 2020. Montpellier, 2020 
The domino problem is undecidable on surface groups  Long version: [pdf] [arXiv]  Conference version: [Editor]  [slides]
Nathalie Aubrun, Sebastián Barbieri, E.M., in Mathematical Foundations of Computer Science (MFCS) 2019. Aachen, 2019. 
Computational Limitations of Affine Automata  [pdf] [arXiv] [Editor]  [slides]
Mika Hirvensalo, E.M., Abuzer Yakaryılmaz, in Unconventional Computation and Natural Computation (UCNC) 2019. Tokyo, 2019. 
Slopes of 3dimensional Subshifts of Finite Type  [pdf] [arXiv] [Editor]  [slides]
E.M., Pascal Vanier, in Computer Science Symposium in Russia (CSR) 2018. Moscow, 2018. 
On the computational power of affine automata  [pdf] [arXiv] [Editor]  [slides]
Mika Hirvensalo, E.M., Abuzer Yakaryılmaz, in Proceedings of Language and Automata Theory and Applications (LATA) 2017. Umeå, 2017.
PhD Thesis
 Around the Domino Problem  Combinatorial Structures and Algebraic Tools, defended the 15th of July 2020
Manuscript [pdf]  [slides]
Thanks to COVID, you can also watch the defense (almost) as if you were in the room.
Some presentations
 Some results about tilings of groups (Pythéas Fogg 01/2021)
 Algebraic Approach to Nivat's Conjecture (Journées SDA2 2020)
 Decidability and Periodicity of Low Complexity Tilings (STACS2020)
 Affine Automata: Power and Limitations (STACS2020 voluntary talk)
 Algebra, Tilings and Nivat (October 2019 version)
 The Domino Problem is Undecidable on Surface Groups (MFCS2019)
 Computational Limitations of Affine Automata (UCNC2019)
 Slopes of 3D Subshifts of Finite Type (CSR2018)
 On the Computational Power of Affine Automata (LATA2017)