Page of Corentin Barloy
- Email: corentin DOT barloy AT rub DOT de
- Current position: Post-doc at Ruhr-Universität-Bochum with Thomas Zeume.
- Past position: PhD @ CRIStAL/INRIA in LINKS team with Charles Paperman, Michaël Cadilhac and Sylvain Salvati.
- French CV
PhD subject
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 current version of the manuscript is here.
Publications list
In proceedings of conferences
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.The regular languages of first-order logic with one alternation
C. Barloy, M. Cadilhac, C. Paperman, T. Zeume, LICS, 2022.
In journals
- A
robust class of linear recurrence sequences
C. Barloy, N. Fijalkow, N. Lhote et F. Mazowiecki, Information and Computation, 2022.
Slides of my talks
- 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
- The regular languages of first-order logic with one alternation
Teaching
- 2021-2022
- TD/TP Algorithmes et Programmation 1 (Univ. Lille)
- TD/TP Base de Données 1 (Univ. Lille)
- 2022-2023
- TD/TP Algorithmes et Programmation 1 (Univ. Lille)
- Colles d’informatique en MPI (Faidherbe)
- 2023-2024