Publications

Preprint, in proceedings

• Goubault-Larrecq, A. & Perrot, K. (2024). Rice-like Complexity Lower Bounds for Boolean and Uniform Automata Networks. arXiv report arXiv:2409.08762 [cs.GT].

International Conferences

• Anand, A., Fijalkow, N., Goubault-Larrecq, A., Leroux, J., & Ohlmann, P. (2021). New Algorithms for Combinations of Objectives using Separating Automata.12th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF), 2021, Padua, Italy. Electronic Proceedings in Theoretical Computer Science 346, 2021, pp. 227–240, doi:10.4204/EPTCS.346.15. arXiv report arXiv:2109.08322 [cs.GT].

Internship reports and projects

• M2 internship report on First-Order questions on the dynamics of automata networks with distinguished configurations, 2022.

• M1 internship report on Queue layouts of graphs and posets, 2021.

• L3 internship report on Constructing separating automata for disjunctive objectives, 2020.

• Computer project (TIPE), as part of CPGE education, 2019: Recherche d’itinéraires et optimisation multimodale (Route discovery and multimodal optimization), comparison of shortest path algorithms, application to public transportation in the Paris area.