Aliénor Goubault-Larrecq

According to our database, Aliénor Goubault-Larrecq authored at least 5 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions.

Colin Geniet, Aliénor Goubault-Larrecq, Kévin Perrot

CoRR, February, 2026

Hardness of monadic second-order formulae over succinct graphs.

Guilhem Gamard, Aliénor Goubault-Larrecq, Pierre Guillon, Pierre Ohlmann, Kévin Perrot, Guillaume Theyssier

Log. Methods Comput. Sci., 2026

2025

Circuit Metaconstruction in Logspace for Rice-Like Complexity Lower Bounds in ANs and SGRs.

Aliénor Goubault-Larrecq, Kévin Perrot

Proceedings of the Crossroads of Computability and Logic: Insights, Inspirations, and Innovations, 2025

2024

Rice-like complexity lower bounds for Boolean and uniform automata networks.

Aliénor Goubault-Larrecq, Kévin Perrot

CoRR, 2024

2021

New Algorithms for Combinations of Objectives using Separating Automata.

Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann

Proceedings of the Proceedings 12th International Symposium on Games, 2021