default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCyril Nicaud
Person information
- affiliation: Université Paris-Est, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Random Generation of Subgroups of the Modular Group with a Fixed Isomorphism Type. Electron. J. Comb. 31(4) (2024)- [i14]Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
Random DFA With One Added Transition. CoRR abs/2402.06591 (2024) - [i13]Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau:
Record-biased permutations and their permuton limit. CoRR abs/2409.01692 (2024) - 2023
- [c38]Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
One Drop of Non-Determinism in a Random Deterministic Automaton. STACS 2023: 19:1-19:14 - [c37]Cyril Nicaud:
Theoretical Perspectives on Algorithmic Choices Made in Programming Languages. PSC 2023: 1 - 2022
- [c36]Conrado Martínez
, Cyril Nicaud, Pablo Rotondo:
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. COCOON 2022: 381-393 - [c35]Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud:
Back-To-Front Online Lyndon Forest Construction. CPM 2022: 13:1-13:23 - [i12]Conrado Martínez, Cyril Nicaud, Pablo Rotondo:
A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. CoRR abs/2208.13602 (2022) - 2021
- [j18]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Statistics of subgroups of the modular group. Int. J. Algebra Comput. 31(8): 1691-1751 (2021) - [j17]Cyril Nicaud, Pablo Rotondo:
Random Regular Expression Over Huge Alphabets. Int. J. Found. Comput. Sci. 32(5): 419-438 (2021) - [j16]Florent Koechlin, Cyril Nicaud, Pablo Rotondo:
Simplifications of Uniform Expressions Specified by Systems. Int. J. Found. Comput. Sci. 32(6): 733-760 (2021) - 2020
- [j15]Mathilde Bouvel, Marni Mishna, Cyril Nicaud:
Some Families of Trees Arising in Permutation Analysis. Electron. J. Comb. 27(2): 2 (2020) - [j14]Mikhail V. Berlinkov, Cyril Nicaud:
Synchronizing Almost-Group Automata. Int. J. Found. Comput. Sci. 31(8): 1091-1112 (2020) - [j13]Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An experimental study of forbidden patterns in geometric permutations by combinatorial lifting. J. Comput. Geom. 11(2): 131-161 (2020) - [c34]Florent Koechlin, Cyril Nicaud, Pablo Rotondo:
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations. DLT 2020: 164-177 - [c33]Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud:
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. ICALP 2020: 114:1-114:16
2010 – 2019
- 2019
- [j12]Cyril Nicaud:
The Černý Conjecture Holds with High Probability. J. Autom. Lang. Comb. 24(2-4): 343-365 (2019) - [j11]Arnaud Carayol, Cyril Nicaud:
Special issue - Implementation and Application of Automata (CIAA 2017). Theor. Comput. Sci. 787: 1 (2019) - [c32]Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. SoCG 2019: 40:1-40:16 - [c31]Florent Koechlin, Cyril Nicaud, Pablo Rotondo:
Uniform Random Expressions Lack Expressivity. MFCS 2019: 51:1-51:14 - [i11]Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. CoRR abs/1903.03014 (2019) - 2018
- [c30]Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau:
On the Worst-Case Complexity of TimSort. ESA 2018: 4:1-4:13 - [c29]Philippe Duchon, Cyril Nicaud:
On the Expected Number of Distinct Gapped Palindromic Factors. IWOCA 2018: 165-176 - [c28]Philippe Duchon, Cyril Nicaud:
On the Biased Partial Word Collector Problem. LATIN 2018: 413-426 - [c27]Mikhail V. Berlinkov, Cyril Nicaud:
Synchronizing Random Almost-Group Automata. CIAA 2018: 84-96 - [i10]Mikhail V. Berlinkov, Cyril Nicaud:
Synchronizing Random Almost-Group Automata. CoRR abs/1805.02154 (2018) - [i9]Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau:
On the Worst-Case Complexity of TimSort. CoRR abs/1805.08612 (2018) - 2017
- [c26]Philippe Duchon, Cyril Nicaud, Carine Pivoteau:
Gapped Pattern Statistics. CPM 2017: 21:1-21:12 - [e1]Arnaud Carayol, Cyril Nicaud:
Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings. Lecture Notes in Computer Science 10329, Springer 2017, ISBN 978-3-319-60133-5 [contents] - 2016
- [j10]Sven De Felice, Cyril Nicaud:
Average Case Analysis of Brzozowski's Algorithm. Int. J. Found. Comput. Sci. 27(2): 109-126 (2016) - [c25]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Generic properties of subgroups of free groups and finite presentations. AMS-EMS-SPM Joint Meeting 2016 - [c24]Cyril Nicaud:
Fast Synchronization of Random Automata. APPROX-RANDOM 2016: 43:1-43:12 - [c23]Cyril Nicaud:
Estimating Statistics on Words Using Ambiguous Descriptions. CPM 2016: 9:1-9:12 - [c22]Nicolas Auger, Cyril Nicaud, Carine Pivoteau:
Good Predictions Are Worth a Few Comparisons. STACS 2016: 12:1-12:14 - [i8]Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau:
Analysis of Algorithms for Permutations Biased by Their Number of Records. CoRR abs/1605.02905 (2016) - 2015
- [c21]Cyril Nicaud:
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm. CPM 2015: 374-384 - [i7]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Generic properties of subgroups of free groups and finite presentations. CoRR abs/1507.01088 (2015) - 2014
- [c20]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: 25-36 - [c19]Cyril Nicaud:
Random Deterministic Automata. MFCS (1) 2014: 5-23 - [i6]Cyril Nicaud:
Fast Synchronization of Random Automata. CoRR abs/1404.6962 (2014) - 2013
- [j9]Otfried Cheong, Xavier Goaoc, Cyril Nicaud:
Set systems and families of permutations with small traces. Eur. J. Comb. 34(2): 229-239 (2013) - [j8]Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil:
Statistical properties of subgroups of free groups. Random Struct. Algorithms 42(3): 349-373 (2013) - [c18]Sven De Felice, Cyril Nicaud:
Random Generation of Deterministic Acyclic Automata Using the Recursive Method. CSR 2013: 88-99 - [c17]Sven De Felice, Cyril Nicaud:
Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata. Developments in Language Theory 2013: 179-190 - [i5]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
On the genericity of Whitehead minimality. CoRR abs/1312.4510 (2013) - 2012
- [j7]Frédérique Bassino, Julien David, Cyril Nicaud:
Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica 63(1-2): 509-531 (2012) - [j6]Sarah Behrens, Cyril Nicaud, Pierre Nicodème:
An Automaton Approach for Waiting Times in DNA Evolution. J. Comput. Biol. 19(5): 550-562 (2012) - [c16]Omar AitMous, Frédérique Bassino, Cyril Nicaud:
An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata. CPM 2012: 110-123 - [c15]Arnaud Carayol, Cyril Nicaud:
Distribution of the number of accessible states in a random deterministic automaton. STACS 2012: 194-205 - 2011
- [c14]Pierre-Cyrille Héam, Cyril Nicaud:
Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. ICST 2011: 60-69 - [i4]Sarah Behrens, Cyril Nicaud, Pierre Nicodème:
An automaton approach for waiting times in DNA evolution. CoRR abs/1112.0126 (2011) - 2010
- [j5]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): 495-516 (2010) - [j4]Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz:
Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411(38-39): 3469-3480 (2010) - [c13]Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil:
On Two Distributions of Subgroups of Free Groups. ANALCO 2010: 82-89 - [c12]Omar AitMous, Frédérique Bassino, Cyril Nicaud:
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality. CPM 2010: 275-287 - [c11]Cyril Nicaud, Carine Pivoteau, Benoît Razet:
Average Analysis of Glushkov Automata under a BST-Like Model. FSTTCS 2010: 388-399 - [c10]Frédérique Bassino, Laura Giambruno, Cyril Nicaud:
Complexity of Operations on Cofinite Languages. LATIN 2010: 222-233 - [c9]Giusi Castiglione, Cyril Nicaud, Marinella Sciortino:
A Challenging Family of Automata for Classical Minimization Algorithms. CIAA 2010: 251-260 - [i3]Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil:
Statistical properties of subgroups of free groups. CoRR abs/1001.4472 (2010)
2000 – 2009
- 2009
- [c8]Cyril Nicaud:
On the Average Size of Glushkov's Automata. LATA 2009: 626-637 - [c7]Frédérique Bassino, Julien David, Cyril Nicaud:
On the Average Complexity of Moore's State Minimization Algorithm. STACS 2009: 123-134 - [c6]Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz:
Random Generation of Deterministic Tree (Walking) Automata. CIAA 2009: 115-124 - [i2]Frédérique Bassino, Julien David, Cyril Nicaud:
On the Average Complexity of Moore's State Minimization Algorithm. CoRR abs/0902.1048 (2009) - [i1]Otfried Cheong, Xavier Goaoc, Cyril Nicaud:
Set Systems and Families of Permutations with Small Traces. CoRR abs/0912.2979 (2009) - 2008
- [j3]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Random Generation of Finitely Generated Subgroups of a Free Group. Int. J. Algebra Comput. 18(2): 375-405 (2008) - [c5]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: 134-145 - 2007
- [j2]Frédérique Bassino, Cyril Nicaud:
Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381(1-3): 86-104 (2007) - [c4]Frédérique Bassino, Julien David, Cyril Nicaud:
: A Library to Randomly and Exhaustively Generate Automata. CIAA 2007: 303-305 - 2005
- [j1]Frédérique Bassino, Julien Clément, Cyril Nicaud:
The standard factorization of Lyndon words: an average point of view. Discret. Math. 290(1): 1-25 (2005) - 2004
- [c3]Frédérique Bassino, Julien Clément, Cyril Nicaud:
Lyndon words with a fixed standard right factor. SODA 2004: 653-654 - 2002
- [c2]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: 307-318
1990 – 1999
- 1999
- [c1]Cyril Nicaud:
Average State Complexity of Operations on Unary Automata. MFCS 1999: 231-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
