I am a Maître de conférences (associate professor) at Université de Rennes, in the LogicA team at IRISA. My research sits at the intersection of automata theory, circuit complexity, and algebraic semigroups. I am teaching at ESIR.
Current
Université de Rennes · LogicA / IRISA
Previously
Postdoctoral researcher at Ruhr University Bochum with Thomas Zeume
Doctorate
CRIStAL / Inria LINKS team, advised by Charles Paperman, Michaël Cadilhac, and Sylvain Salvati
Research
My main interests are automata theory, circuit complexity, and algebraic semigroups. I am particularly interested in lower bounds for small-depth circuits with a linear number of wires or gates.
Read the PhD manuscript · View the defense slides
Publications
Conference proceedings
Shuffles of Context-Free Languages Along Regular Trajectories
C. Barloy, M. Cadilhac, K. Ockerlund · ICALP 2026
Algebraic characterizations of classes of regular languages in DynFO
C. Barloy, F. Tschirbs, N. Vortmeier, T. Zeume · STACS 2026
Dynamic membership for regular tree languages
A. Amarilli, C. Barloy, L. Jachiet, C. Paperman · MFCS 2025
The regular languages of first-order logic with one alternation
C. Barloy, M. Cadilhac, C. Paperman, T. Zeume · LICS 2022
Stackless processing of streamed trees
C. Barloy, F. Murlak, C. Paperman · PODS 2021
Bidimensional linear recursive sequences and universality of unambiguous register automata
C. Barloy, L. Clemente · STACS 2021
A robust class of linear recurrence sequences
C. Barloy, N. Fijalkow, N. Lhote, F. Mazowiecki · CSL 2020
Journal articles
A robust class of linear recurrence sequences
C. Barloy, N. Fijalkow, N. Lhote, F. Mazowiecki · Information and Computation, 2022
Talks & slides
Shuffles of Context-Free Languages Along Regular Trajectories
ICALP 2026 · Slides
Algebraic characterizations of classes of regular languages in DynFO
STACS 2026 · Slides
Dynamic membership for regular tree languages
MFCS 2025 · Slides
The regular languages of first-order logic with one alternation
Stackless processing of streamed trees
Bidimensional linear recursive sequences
A robust class of linear recurrence sequences
Teaching
2025–2026
- Computational complexity theory, Ruhr
University Bochum
Lecture and exercises - Highlights of theoretical computer science,
Ruhr University Bochum
Lecture and exercises · Transformers slides - Gems of logic, Ruhr University Bochum
Seminar
2024–2025
- Computational complexity theory, Ruhr
University Bochum
Lecture and exercises · Boolean circuits slides - Highlights of theoretical computer science,
Ruhr University Bochum
Lecture and exercises - Gems of logic, Ruhr University Bochum
Seminar
2023–2024
- UNIX practical sessions, Université de Lille
- Relational databases — lectures, tutorials, and practical sessions, Université de Lille
- Computer science oral examinations (MPI), Lycée Faidherbe
2022–2023
- Algorithms and Programming 1 — tutorials and practical sessions, Université de Lille
- Computer science oral examinations (MPI), Lycée Faidherbe
2021–2022
- Algorithms and Programming 1 — tutorials and practical sessions, Université de Lille
- Databases 1 — tutorials and practical sessions, Université de Lille