Corentin Barloy

Orcid: 0000-0001-5420-8761

According to our database1, Corentin Barloy authored at least 8 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Shuffles of Context-Free Languages along Regular Trajectories.
CoRR, March, 2026

Algebraic Characterizations of Classes of Regular Languages in DynFO.
Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025
Dynamic Membership for Regular Tree Languages.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024
On the complexity of regular languages. (Sur la complexité des langages réguliers).
PhD thesis, 2024

2022
The Regular Languages of First-Order Logic with One Alternation.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Stackless Processing of Streamed Trees.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

2020
A Robust Class of Linear Recurrence Sequences.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020


  Loading...