Florent Koechlin

18 papers A* 2A 2B 1C 2Misc 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Large chirotopes with computable numbers of triangulations.
CoRR
Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2025 J jnl
A Canonical Tree Decomposition for Order Types, and Some Applications.
SIAM J. Discret. Math.
Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2025 C conf
Heuristic Universality Detection over Regular Expressions Specified by Systems.
DLT
Florent Koechlin, Carine Pivoteau, Pablo Rotondo
2025 J jnl
Random Deterministic Automata With One Added Transition.
Log. Methods Comput. Sci.
Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
2025 J jnl
Weakly-unambiguous Parikh automata and their link to holonomic series.
CoRR
Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud
2024 A* conf
A Canonical Tree Decomposition for Chirotopes.
SoCG
Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2024 J jnl
A canonical tree decomposition for order types, and some applications.
CoRR
Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2024 J jnl
Random DFA With One Added Transition.
CoRR
Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
2024 J jnl
The effects of semantic simplifications on random BST-like expression-trees.
Discret. Math.
Florent Koechlin, Pablo Rotondo
2023 A conf
One Drop of Non-Determinism in a Random Deterministic Automaton.
STACS
Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
2022 — conf
New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages.
FSTTCS
Florent Koechlin
2021 A conf
Absorbing Patterns in BST-Like Expression-Trees.
STACS
Florent Koechlin, Pablo Rotondo
2021 Misc conf
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection.
CSR
Florent Koechlin, Pablo Rotondo
2021 J jnl
Simplifications of Uniform Expressions Specified by Systems.
Int. J. Found. Comput. Sci.
Florent Koechlin, Cyril Nicaud, Pablo Rotondo
2021 — —
Systèmes de fonctions holonomes: application à la théorie des automates. (Systems of holonomic functions: application in automata theory).
Florent Koechlin
2020 C conf
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations.
DLT
Florent Koechlin, Cyril Nicaud, Pablo Rotondo
2020 A* conf
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series.
ICALP
Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud
2019 B conf
Uniform Random Expressions Lack Expressivity.
MFCS
Florent Koechlin, Cyril Nicaud, Pablo Rotondo