Publications

Preprints

• Geniet, C., Goubault-Larrecq, A., & Perrot, K. (2026). Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions. arXiv preprint arXiv:2602.18240 [cs.CC].

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

Journal Articles

• Gamard, G., Goubault-Larrecq, A., Guillon, P., Ohlmann, P., Perrot, K., & Theyssier, G. (2026). Hardness of monadic second-order formulae over succinct graphs. Logical Methods in Computer Science, Volume 22, Issue 1. doi:10.46298/lmcs-22(1:3)2026. arXiv version arXiv:2302.04522 [cs.CC].

International Conferences

• Goubault-Larrecq, A., & Perrot, K. (2025). Circuit Metaconstruction in Logspace for Rice-Like Complexity Lower Bounds in ANs and SGRs.In Crossroads of Computability and Logic: Insights, Inspirations, and Innovations: 21st Conference on Computability in Europe , CiE 2025, Lisbon, Portugal, July 14–18,2025, Proceedings (Vol. 15764, p. 237 ). Springer Nature. arXiv version arXiv:2504.11348 [cs.CC].

• 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 verion arXiv:2109.08322 [cs.GT].