Cyril Nicaud

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