Florent Koechlin

Orcid: 0000-0002-5576-4847

According to our database1, Florent Koechlin authored at least 13 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The effects of semantic simplifications on random BST-like expression-trees.
Discret. Math., 2024

A canonical tree decomposition for order types, and some applications.
CoRR, 2024

Random DFA With One Added Transition.
CoRR, 2024

A Canonical Tree Decomposition for Chirotopes.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
One Drop of Non-Determinism in a Random Deterministic Automaton.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022
New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021
Systèmes de fonctions holonomes: application à la théorie des automates. (Systems of holonomic functions: application in automata theory).
PhD thesis, 2021

Simplifications of Uniform Expressions Specified by Systems.
Int. J. Found. Comput. Sci., 2021

Absorbing Patterns in BST-Like Expression-Trees.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection.
Proceedings of the Computer Science - Theory and Applications, 2021

2020
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019
Uniform Random Expressions Lack Expressivity.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019


  Loading...