Stackless Processing of Streamed Trees. - Corentin Barloy; Filip Murlak; Charles Paperman (PODS, 2021)

Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. - Corentin Barloy; Lorenzo Clemente (STACS, 2021)

The Regular Languages of First-Order Logic with One Alternation. - Corentin Barloy; Michaël Cadilhac; Charles Paperman; Thomas Zeume (LICS, 2022)

A robust class of linear recurrence sequences. - Corentin Barloy; Nathanaël Fijalkow; Nathan Lhote; Filip Mazowiecki (Inf. Comput., 2022)

On the complexity of regular languages. (Sur la complexité des langages réguliers). - Corentin Barloy (2024)

Dynamic Membership for Regular Tree Languages. - Antoine Amarilli; Corentin Barloy; Louis Jachiet; Charles Paperman (MFCS, 2025)