• Email: corentin DOT barloy AT inria DOT fr
• Current position: PhD @ CRIStAL/INRIA in LINKS team
• advisors
  • Charles Paperman
  • Michaël Cadilhac
  • 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.

Publications list

dblp

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
  • Highlights 2019
  • CSL 2020
• Bidimensional linear recursive sequences and universality of unambiguous register automata
  • Highlights 2020 (poster)
  • STACS 2021
  • STACS 2021 (recording)
• Stackless processing of streamed trees
  • PODS 2021
  • PODS 2021 (recording)
• The regular languages of first-order logic with one alternation
  • LICS 2022
  • Extended

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)