Cyril Nicaud

From MaRDI portal
Person:691580

Available identifiers

zbMath Open nicaud.cyrilMaRDI QIDQ691580

List of research outcomes





PublicationDate of PublicationType
Random generation of subgroups of the modular group with a fixed isomorphism type2024-11-09Paper
One drop of non-determinism in a random deterministic automaton2024-10-08Paper
Back-to-front online Lyndon forest construction2024-05-06Paper
Silhouettes and generic properties of subgroups of the modular group2023-11-14Paper
Random generation of subgroups of the modular group with a fixed isomorphism type2023-10-29Paper
Simplifications of Uniform Expressions Specified by Systems2023-08-15Paper
Random Regular Expression Over Huge Alphabets2023-08-15Paper
A probabilistic model revealing shortcomings in Lua's hybrid tables2023-08-10Paper
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50924132022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50889702022-07-18Paper
Statistics of subgroups of the modular group2022-01-13Paper
On the worst-case complexity of TimSort2021-08-04Paper
Synchronizing almost-group automata2021-04-19Paper
https://portal.mardi4nfdi.de/entity/Q58545632021-03-17Paper
Silhouettes and generic properties of subgroups of the modular group2020-11-18Paper
Some families of trees arising in permutation analysis2020-06-04Paper
Gapped pattern statistics2020-05-25Paper
On the biased partial word collector problem2020-02-12Paper
The Cerny Conjecture Holds with High Probability2020-01-15Paper
On two distributions of subgroups of free groups2019-09-16Paper
Lannes’ T functor on injective unstable modules and Harish-Chandra restriction2019-04-29Paper
Lannes’ T functor on injective unstable modules and Harish-Chandra restriction2019-02-06Paper
Synchronizing random almost-group automata2018-11-07Paper
On the expected number of distinct gapped palindromic factors2018-09-06Paper
https://portal.mardi4nfdi.de/entity/Q46364772018-04-19Paper
Good predictions are worth a few comparisons2018-01-24Paper
Estimating statistics on words using ambiguous descriptions2017-10-17Paper
Generic properties of subgroups of free groups and finite presentations2017-04-11Paper
Random generation using binomial approximations2017-02-10Paper
Random presentations and random subgroups: a survey2017-02-07Paper
Average case analysis of Brzozowski's algorithm2016-06-23Paper
On the genericity of Whitehead minimality2016-01-19Paper
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm2015-08-20Paper
https://portal.mardi4nfdi.de/entity/Q55013222015-08-03Paper
Random deterministic automata2014-10-14Paper
On the average complexity of Brzozowski's algorithm for deterministic automata with a small number of final states2014-10-14Paper
Generic properties of random subgroups of a free group for general distributions.2014-09-29Paper
Some simple varieties of trees arising in permutation analysis2014-02-18Paper
Brzozowski algorithm is generically super-polynomial for deterministic automata2013-06-28Paper
Random generation of deterministic acyclic automata using the recursive method2013-06-14Paper
Statistical properties of subgroups of free groups.2013-05-28Paper
Set systems and families of permutations with small traces2012-12-03Paper
Average analysis of Glushkov automata under a BST-like model2012-08-29Paper
Distribution of the number of accessible states in a random deterministic automaton2012-08-23Paper
An efficient linear pseudo-minimization algorithm for Aho-Corasick automata2012-08-14Paper
Average case analysis of Moore's state minimization algorithm2012-04-26Paper
On the average complexity of Moore's state minimization algorithm2012-04-24Paper
Enumeration and random generation of possibly incomplete deterministic automata2011-02-22Paper
A challenging family of automata for classical minimization algorithms2011-02-11Paper
Parametric random generation of deterministic tree automata2010-10-07Paper
The average state complexity of rational operations on finite languages2010-09-06Paper
Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality2010-07-26Paper
Accessible and deterministic automata: enumeration and Boltzmann samplers2010-07-05Paper
Complexity of Operations on Cofinite Languages2010-04-27Paper
Random Generation of Deterministic Tree (Walking) Automata2009-07-09Paper
On the Average Size of Glushkov’s Automata2009-04-02Paper
The Average State Complexity of the Star of a Finite Set of Words Is Linear2008-10-30Paper
RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP2008-08-26Paper
REGAL: A Library to Randomly and Exhaustively Generate Automata2008-06-10Paper
Enumeration and random generation of accessible automata2007-09-03Paper
The standard factorization of Lyndon words: an average point of view2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q44121232003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q49419052000-03-19Paper

Research outcomes over time

This page was built for person: Cyril Nicaud