- Email: corentin DOT barloy AT inria DOT fr
- Current position: PhD @ CRIStAL/INRIA in LINKS team
- advisors
- French CV

My main area of interest are automata theory, circuit complexity and algebraic semigroups. I especially try to find lower bounds for small-depth circuit with linear numbers of wires or gates.

- The regular languages of first-order logic with one alternation

C. Barloy, M. Cadilhac, C. Paperman, T. Zeume, 2022.

A robust class of linear recurrence sequences

C. Barloy, N. Fijalkow, N. Lhote et F. Mazowiecki, CSL, 2020.Bidimensional linear recursive sequences and universality of unambiguous register automata

C. Barloy et L. Clemente, STACS, 2021.Stackless processing of streamed trees

C. Barloy, F. Murlak et C. Paperman, PODS, 2021.

- A robust class of linear recurrence sequences
- Bidimensional linear recursive sequences and universality of unambiguous register automata
- Highlights 2020 (poster)
- STACS 2021
- STACS 2021 (recording)

- Stackless processing of streamed trees