Cyril Nicaud

According to our database, Cyril Nicaud authored at least 58 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Random DFA With One Added Transition.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

CoRR, 2024

2023

Theoretical Perspectives on Algorithmic Choices Made in Programming Languages.

Cyril Nicaud

Proceedings of the Prague Stringology Conference 2023, 2023

One Drop of Non-Determinism in a Random Deterministic Automaton.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Back-To-Front Online Lyndon Forest Construction.

Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables.

Conrado Martínez, Cyril Nicaud, Pablo Rotondo

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Random Regular Expression Over Huge Alphabets.

Cyril Nicaud, Pablo Rotondo

Int. J. Found. Comput. Sci., 2021

Simplifications of Uniform Expressions Specified by Systems.

Florent Koechlin, Cyril Nicaud, Pablo Rotondo

Int. J. Found. Comput. Sci., 2021

Statistics of subgroups of the modular group.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

Int. J. Algebra Comput., 2021

2020

An experimental study of forbidden patterns in geometric permutations by combinatorial lifting.

Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud

J. Comput. Geom., 2020

Synchronizing Almost-Group Automata.

Mikhail V. Berlinkov, Cyril Nicaud

Int. J. Found. Comput. Sci., 2020

Some Families of Trees Arising in Permutation Analysis.

Mathilde Bouvel, Marni Mishna, Cyril Nicaud

Electron. J. Comb., 2020

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series.

Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations.

Florent Koechlin, Cyril Nicaud, Pablo Rotondo

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

Special issue - Implementation and Application of Automata (CIAA 2017).

Arnaud Carayol, Cyril Nicaud

Theor. Comput. Sci., 2019

The Černý Conjecture Holds with High Probability.

Cyril Nicaud

J. Autom. Lang. Comb., 2019

Uniform Random Expressions Lack Expressivity.

Florent Koechlin, Cyril Nicaud, Pablo Rotondo

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Synchronizing Random Almost-Group Automata.

Mikhail V. Berlinkov, Cyril Nicaud

Proceedings of the Implementation and Application of Automata, 2018

On the Biased Partial Word Collector Problem.

Philippe Duchon, Cyril Nicaud

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

On the Expected Number of Distinct Gapped Palindromic Factors.

Philippe Duchon, Cyril Nicaud

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

On the Worst-Case Complexity of TimSort.

Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Gapped Pattern Statistics.

Philippe Duchon, Cyril Nicaud, Carine Pivoteau

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Average Case Analysis of Brzozowski's Algorithm.

Sven De Felice, Cyril Nicaud

Int. J. Found. Comput. Sci., 2016

Analysis of Algorithms for Permutations Biased by Their Number of Records.

Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau

CoRR, 2016

Good Predictions Are Worth a Few Comparisons.

Nicolas Auger, Cyril Nicaud, Carine Pivoteau

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Estimating Statistics on Words Using Ambiguous Descriptions.

Cyril Nicaud

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Fast Synchronization of Random Automata.

Cyril Nicaud

Proceedings of the Approximation, 2016

Generic properties of subgroups of free groups and finite presentations.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

Proceedings of the Algebra and Computer Science, 2016

2015

A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm.

Cyril Nicaud

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Random Deterministic Automata.

Cyril Nicaud

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States.

Sven De Felice, Cyril Nicaud

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

Statistical properties of subgroups of free groups.

Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil

Random Struct. Algorithms, 2013

Set systems and families of permutations with small traces.

Otfried Cheong, Xavier Goaoc, Cyril Nicaud

Eur. J. Comb., 2013

On the genericity of Whitehead minimality.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

CoRR, 2013

Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata.

Sven De Felice, Cyril Nicaud

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Random Generation of Deterministic Acyclic Automata Using the Recursive Method.

Sven De Felice, Cyril Nicaud

Proceedings of the Computer Science - Theory and Applications, 2013

2012

An Automaton Approach for Waiting Times in DNA Evolution.

Sarah Behrens, Cyril Nicaud, Pierre Nicodème

J. Comput. Biol., 2012

Average Case Analysis of Moore's State Minimization Algorithm.

Frédérique Bassino, Julien David, Cyril Nicaud

Algorithmica, 2012

Distribution of the number of accessible states in a random deterministic automaton.

Arnaud Carayol, Cyril Nicaud

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata.

Omar AitMous, Frédérique Bassino, Cyril Nicaud

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing.

Pierre-Cyrille Héam, Cyril Nicaud

Proceedings of the Fourth IEEE International Conference on Software Testing, 2011

2010

Parametric random generation of deterministic tree automata.

Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz

Theor. Comput. Sci., 2010

The Average State Complexity of Rational Operations on Finite Languages.

Frédérique Bassino, Laura Giambruno, Cyril Nicaud

Int. J. Found. Comput. Sci., 2010

A Challenging Family of Automata for Classical Minimization Algorithms.

Giusi Castiglione, Cyril Nicaud, Marinella Sciortino

Proceedings of the Implementation and Application of Automata, 2010

Complexity of Operations on Cofinite Languages.

Frédérique Bassino, Laura Giambruno, Cyril Nicaud

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Average Analysis of Glushkov Automata under a BST-Like Model.

Cyril Nicaud, Carine Pivoteau, Benoît Razet

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Building the Minimal Automaton of <i>A</i>^*<i>X</i> in Linear Time, When <i>X</i> Is of Bounded Cardinality.

Omar AitMous, Frédérique Bassino, Cyril Nicaud

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

On Two Distributions of Subgroups of Free Groups.

Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009

Random Generation of Deterministic Tree (Walking) Automata.

Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz

Proceedings of the Implementation and Application of Automata, 2009

On the Average Complexity of Moore's State Minimization Algorithm.

Frédérique Bassino, Julien David, Cyril Nicaud

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

On the Average Size of Glushkov's Automata.

Cyril Nicaud

Proceedings of the Language and Automata Theory and Applications, 2009

2008

Random Generation of Finitely Generated Subgroups of a Free Group.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

Int. J. Algebra Comput., 2008

The Average State Complexity of the Star of a Finite Set of Words Is Linear.

Frédérique Bassino, Laura Giambruno, Cyril Nicaud

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

Enumeration and random generation of accessible automata.

Frédérique Bassino, Cyril Nicaud

Theor. Comput. Sci., 2007

: A Library to Randomly and Exhaustively Generate Automata.

Frédérique Bassino, Julien David, Cyril Nicaud

Proceedings of the Implementation and Application of Automata, 2007

2005

The standard factorization of Lyndon words: an average point of view.

Frédérique Bassino, Julien Clément, Cyril Nicaud

Discret. Math., 2005

2004

Lyndon words with a fixed standard right factor.

Frédérique Bassino, Julien Clément, Cyril Nicaud

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002

The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.

Frédérique Bassino, Julien Clément, Cyril Nicaud

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

1999

Average State Complexity of Operations on Unary Automata.

Cyril Nicaud

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999