Cyril Nicaud

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 32

Top Topics

Deterministic Automata

Top Venues

Int. J. Found. Comput. Sci.

Publications

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
Random DFA With One Added Transition. CoRR (2024)
Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
One Drop of Non-Determinism in a Random Deterministic Automaton. STACS (2023)
Cyril Nicaud
Theoretical Perspectives on Algorithmic Choices Made in Programming Languages. PSC (2023)
Conrado Martínez, Cyril Nicaud, Pablo Rotondo
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. COCOON (2022)
Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud
Back-To-Front Online Lyndon Forest Construction. CPM (2022)
Conrado Martínez, Cyril Nicaud, Pablo Rotondo
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. CoRR (2022)
Cyril Nicaud, Pablo Rotondo
Random Regular Expression Over Huge Alphabets. Int. J. Found. Comput. Sci. 32 (5) (2021)
Florent Koechlin, Cyril Nicaud, Pablo Rotondo
Simplifications of Uniform Expressions Specified by Systems. Int. J. Found. Comput. Sci. 32 (6) (2021)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Statistics of subgroups of the modular group. Int. J. Algebra Comput. 31 (8) (2021)
Mathilde Bouvel, Marni Mishna, Cyril Nicaud
Some Families of Trees Arising in Permutation Analysis. Electron. J. Comb. 27 (2) (2020)
Florent Koechlin, Cyril Nicaud, Pablo Rotondo
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations. DLT (2020)
Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. ICALP (2020)
Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud
An experimental study of forbidden patterns in geometric permutations by combinatorial lifting. J. Comput. Geom. 11 (2) (2020)
Mikhail V. Berlinkov, Cyril Nicaud
Synchronizing Almost-Group Automata. Int. J. Found. Comput. Sci. 31 (8) (2020)
Arnaud Carayol, Cyril Nicaud
Special issue - Implementation and Application of Automata (CIAA 2017). Theor. Comput. Sci. 787 (2019)
Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. CoRR (2019)
Cyril Nicaud
The Černý Conjecture Holds with High Probability. J. Autom. Lang. Comb. 24 (2-4) (2019)
Florent Koechlin, Cyril Nicaud, Pablo Rotondo
Uniform Random Expressions Lack Expressivity. MFCS (2019)
Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. SoCG (2019)
Philippe Duchon, Cyril Nicaud
On the Expected Number of Distinct Gapped Palindromic Factors. IWOCA (2018)
Philippe Duchon, Cyril Nicaud
On the Biased Partial Word Collector Problem. LATIN (2018)
Mikhail V. Berlinkov, Cyril Nicaud
Synchronizing Random Almost-Group Automata. CoRR (2018)
Mikhail V. Berlinkov, Cyril Nicaud
Synchronizing Random Almost-Group Automata. CIAA (2018)
Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau
On the Worst-Case Complexity of TimSort. ESA (2018)
Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau
On the Worst-Case Complexity of TimSort. CoRR (2018)
Philippe Duchon, Cyril Nicaud, Carine Pivoteau
Gapped Pattern Statistics. CPM (2017)
Cyril Nicaud
Fast Synchronization of Random Automata. APPROX-RANDOM (2016)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Generic properties of subgroups of free groups and finite presentations. AMS-EMS-SPM Joint Meeting (2016)
Cyril Nicaud
Estimating Statistics on Words Using Ambiguous Descriptions. CPM (2016)
Sven De Felice, Cyril Nicaud
Average Case Analysis of Brzozowski's Algorithm. Int. J. Found. Comput. Sci. 27 (2) (2016)
Nicolas Auger, Cyril Nicaud, Carine Pivoteau
Good Predictions Are Worth a Few Comparisons. STACS (2016)
Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau
Analysis of Algorithms for Permutations Biased by Their Number of Records. CoRR (2016)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Generic properties of subgroups of free groups and finite presentations. CoRR (2015)
Cyril Nicaud
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm. CPM (2015)
Sven De Felice, Cyril Nicaud
On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States. Developments in Language Theory (2014)
Cyril Nicaud
Fast Synchronization of Random Automata. CoRR (2014)
Cyril Nicaud
Random Deterministic Automata. MFCS (1) (2014)
Sven De Felice, Cyril Nicaud
Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata. Developments in Language Theory (2013)
Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
Statistical properties of subgroups of free groups. Random Struct. Algorithms 42 (3) (2013)
Sven De Felice, Cyril Nicaud
Random Generation of Deterministic Acyclic Automata Using the Recursive Method. CSR (2013)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
On the genericity of Whitehead minimality. CoRR (2013)
Otfried Cheong, Xavier Goaoc, Cyril Nicaud
Set systems and families of permutations with small traces. Eur. J. Comb. 34 (2) (2013)
Sarah Behrens, Cyril Nicaud, Pierre Nicodème
An Automaton Approach for Waiting Times in DNA Evolution. J. Comput. Biol. 19 (5) (2012)
Omar AitMous, Frédérique Bassino, Cyril Nicaud
An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata. CPM (2012)
Frédérique Bassino, Julien David, Cyril Nicaud
Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica 63 (1-2) (2012)
Arnaud Carayol, Cyril Nicaud
Distribution of the number of accessible states in a random deterministic automaton. STACS (2012)
Sarah Behrens, Cyril Nicaud, Pierre Nicodème
An automaton approach for waiting times in DNA evolution CoRR (2011)
Pierre-Cyrille Héam, Cyril Nicaud
Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. ICST (2011)
Cyril Nicaud, Carine Pivoteau, Benoît Razet
Average Analysis of Glushkov Automata under a BST-Like Model. FSTTCS (2010)
Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
On Two Distributions of Subgroups of Free Groups. ANALCO (2010)
Giusi Castiglione, Cyril Nicaud, Marinella Sciortino
A Challenging Family of Automata for Classical Minimization Algorithms. CIAA (2010)
Omar AitMous, Frédérique Bassino, Cyril Nicaud
Is of Bounded Cardinality. CPM (2010)
Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
Statistical properties of subgroups of free groups CoRR (2010)
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411 (38-39) (2010)
Frédérique Bassino, Laura Giambruno, Cyril Nicaud
The Average State Complexity of Rational Operations on Finite Languages. Int. J. Found. Comput. Sci. 21 (4) (2010)
Frédérique Bassino, Laura Giambruno, Cyril Nicaud
Complexity of Operations on Cofinite Languages. LATIN (2010)
Otfried Cheong, Xavier Goaoc, Cyril Nicaud
Set Systems and Families of Permutations with Small Traces CoRR (2009)
Frédérique Bassino, Julien David, Cyril Nicaud
On the Average Complexity of Moore's State Minimization Algorithm CoRR (2009)
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
Random Generation of Deterministic Tree (Walking) Automata. CIAA (2009)
Cyril Nicaud
On the Average Size of Glushkov's Automata. LATA (2009)
Frédérique Bassino, Julien David, Cyril Nicaud
On the Average Complexity of Moore's State Minimization Algorithm. STACS (2009)
Frédérique Bassino, Laura Giambruno, Cyril Nicaud
The Average State Complexity of the Star of a Finite Set of Words Is Linear. Developments in Language Theory (2008)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Random Generation of Finitely Generated Subgroups of a Free Group. Int. J. Algebra Comput. 18 (2) (2008)
Frédérique Bassino, Julien David, Cyril Nicaud
: A Library to Randomly and Exhaustively Generate Automata. CIAA (2007)
Frédérique Bassino, Cyril Nicaud
Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381 (1-3) (2007)
Frédérique Bassino, Julien Clément, Cyril Nicaud
The standard factorization of Lyndon words: an average point of view. Discret. Math. 290 (1) (2005)
Frédérique Bassino, Julien Clément, Cyril Nicaud
Lyndon words with a fixed standard right factor. SODA (2004)
Frédérique Bassino, Julien Clément, Cyril Nicaud
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. Developments in Language Theory (2002)
Cyril Nicaud
Average State Complexity of Operations on Unary Automata. MFCS (1999)