Cyril Nicaud
Publications
Publications
|
|
Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt AlgorithmsCPM 2025, Jun 2025, Milano, Italy. pp.8:1-8:17, ⟨10.4230/LIPIcs.CPM.2025.8⟩ |
|
|
A Probabilistic Model Revealing Shortcomings in Lua’s Hybrid TablesThe 28th International Computing and Combinatorics Conference COCOON 2022, Oct 2022, Shenzhen, China. pp.381-393, ⟨10.1007/978-3-031-22105-7_34⟩ |
One Drop of Non-Determinism in a Random Deterministic AutomatonSTACS: Symposium on Theoretical Aspects of Computer Science, 2023, Hamburg, Germany. pp.19:1--19:14, ⟨10.4230/LIPIcs.STACS.2023.1910.4230/LIPIcs.STACS.2023.19⟩ |
|
Back-To-Front Online Lyndon Forest Construction33rd Annual Symposium on Combinatorial Pattern Matching, 2022, Prague, Czech Republic. pp.13:1--13:23, ⟨10.4230/lipics.cpm.2022.13⟩ |
|
|
|
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial EquationsInternational Conference on Developments in Language Theory (DLT 2020), May 2020, Tampa, United States. pp.164-177, ⟨10.1007/978-3-030-48516-0_13⟩ |
|
|
Weakly-unambiguous Parikh automata and their link to holonomic seriesICALP 2020 - 47th International Colloquium on Automata, Languages and Programming, Jul 2020, Saarbrücken, Germany. pp.114.1-114.16, ⟨10.4230/LIPIcs.ICALP.2020.114⟩ |
|
|
An experimental study of forbidden patterns in geometric permutations by combinatorial lifting35th International Symposium on Computational Geometry, 2019, Portland, United States. ⟨10.4230/LIPIcs.SoCG.2019.40⟩ |
|
|
Uniform Random Expressions Lack ExpressivityMFCS 2019, Aug 2019, Aachen, Germany. pp.51:1-51:14, ⟨10.4230/LIPIcs.MFCS.2019.51⟩ |
On the Biased Partial Word Collector ProblemLATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Apr 2018, Buenos Aires, Argentina |
|
Synchronizing Random Almost-Group Automata23rd International Conference on Implementation and Application of Automata, 2018, Charlottetown, Canada. pp.84-96 |
|
On the Expected Number of Distinct Gapped Palindromic FactorsIWOCA 2018: International Workshop on Combinatorial Algorithms, Jul 2018, Singapour, Singapore |
|
|
|
On the Worst-Case Complexity of TimSort26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.4:1--4:13, ⟨10.4230/LIPIcs.ESA.2018.4⟩ |
|
|
Gapped Pattern Statistics28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), Jul 2017, Varsovie, Poland. pp.21:1-21:12, ⟨10.4230/LIPIcs.CPM.2017.21⟩ |
|
|
Fast Synchronization of Random AutomataAPPROX/RANDOM 2016, Sep 2016, Paris, France. pp.43.1-12, ⟨10.4230/LIPIcs.APPROX-RANDOM.2016.43⟩ |
|
|
Analysis of Algorithms for Permutations Biased by Their Number of Records27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithm AOFA 2016, Jul 2016, Cracovie, Poland |
|
|
Estimating Statistics on Words Using Ambiguous Descriptions27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), Jun 2016, Tel Aviv, Israel. pp.9, ⟨10.4230/LIPIcs.CPM.2016.9⟩ |
|
|
Good predictions are worth a few comparisonsSTACS 2016, Feb 2016, Orléans, France. pp.12:1-12:14, ⟨10.4230/LIPIcs.STACS.2016.12⟩ |
|
|
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-AlgorithmCPM 2015, Jun 2015, Ischia Island, Italy. pp.374-384, ⟨10.1007/978-3-319-19929-0_32⟩ |
|
|
On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final StatesDLT 2014, Aug 2014, Ekaterinburg, Russia. pp.25-36, ⟨10.1007/978-3-319-09698-8_3⟩ |
|
|
Random Deterministic AutomataMFCS 2014, Aug 2014, Budapest, Hungary. pp.5-23, ⟨10.1007/978-3-662-44522-8_2⟩ |
|
|
Brzozowski Algorithm Is Generically Super-Polynomial Deterministic AutomataDLT'13, 2013, France. pp.179-190, ⟨10.1007/978-3-642-38771-5_17⟩ |
|
|
Some simple varieties of trees arising in permutation analysis25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.825-836, ⟨10.46298/dmtcs.2346⟩ |
|
|
Random Generation of Deterministic Acyclic Automata Using the Recursive Method8th International Computer Science Symposium in Russia (CSR'13), 2013, Russia. pp.88-99, ⟨10.1007/978-3-642-38536-0_8⟩ |
An Efficient Linear Pseudo-Minimization Algorithm for Aho-Corasick Automata23st Annual Symposium on Combinatorial Pattern Matching (CPM'12), 2012, Finland. pp.110-123 |
|
|
|
Generic properties of random subgroups of a free group for general distributions23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'12), 2012, Canada. pp.155-166, ⟨10.46298/dmtcs.2991⟩ |
|
|
Distribution of the number of accessible states in a random deterministic automatonSTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.194-205 |
Seed, an Easy-to-Use Random Generator of Recursive Data Structures for Testing4th IEEE International Conference on Software Testing, Verification and Validation (ICST'11), Mar 2011, Berlin, Germany. pp.60 - 69, ⟨10.1109/ICST.2011.31⟩ |
|
A challenging family of automata for classical minimization algorithms15th International Conference on Implementation and Application of Automata (CIAA'10), 2010, Canada. pp.251-260 |
|
|
|
Random Generation Using Binomial Approximations21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.359-372, ⟨10.46298/dmtcs.2772⟩ |
|
|
Complexity of operations on cofinite languages9th Latin American Theoretical INformatics Symposium (LATIN 2010), Apr 2010, Oaxaca, Mexico. pp.222-233 |
|
|
Average Analysis of Glushkov Automata under a BST-Like Model30th Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), 2010, India. pp.388-399 |
|
|
On two distributions of subgroups of free groupsWorkshop on Analytic Algorithmics and Combinatorics (ANALCO) 2010, Jan 2010, United States. pp.82-89 |
|
|
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), Jun 2010, United States. pp.275-287 |
Set Systems and Families of Permutations with Small Traces (abstract)8th French Combinatorial Conference, 2010, France |
|
|
|
On the Average Complexity of Moore's State Minimization Algorithm26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.123-134 |
|
|
Random Generation of Deterministic Tree (Walking) Automata14th International Conference on Implementation and Application of Automata - CIAA 2009, Jul 2009, Sydney, Australia. pp.115--124, ⟨10.1007/978-3-642-02979-0_15⟩ |
|
|
On the Average Size of Glushkov's Automata3rd International Conference on Language and Automata Theory and Applications (LATA 2009), Apr 2009, Tarragona, Spain. pp.626-637, ⟨10.1007/978-3-642-00982-2_53⟩ |
|
|
The average state complexity of the star of a finite set of words is linear.International Conference on Developments in Language Theory, 2008, Japan. pp.134-145 |
|
|
Random generation of possibly incomplete deterministic automata.Génération Aléatoire de Structures COMbinatoires, 2008, Italy. pp.31-40 |
|
|
REGAL: a library to randomly and exhaustively generate automata12th International Conference on Implementation and Application of Automata (CIAA'07), Jul 2007, Prague, Czech Republic. pp.303-305., ⟨10.1007/978-3-540-76336-9_28⟩ |
|
|
Accessible and Deterministic Automata: Enumeration and Boltzmann SamplersFourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.151-160, ⟨10.46298/dmtcs.3499⟩ |
|
|
Lyndon words with a fixed standard right factor15th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2004), Jan 2004, New Orleans, Louisiana, United States. pp.646-647 |
|
|
The average lengths of the factors of the standard factorization of Lyndon words6th International Conference on Developments in Language Theory (DLT 2002), Sep 2003, Kyoto, Japan. pp.307-318 |
Average State Complexity of Operations on Unary AutomataMFCS 1999, Sep 1999, Szklarska Poreba, Poland, Poland. pp.231-240, ⟨10.1007/3-540-48340-3_21⟩ |
|
|
Random presentations and random subgroups: a surveyFrédérique Bassino, Ilya Kapovich, Markus Lohrey, Alexei Miasnikov, Cyril Nicaud, Andrey Nikolaev, Igor Rivin, Vladimir Shpilrain, Alexander Ushakov and Pascal Weil. Complexity and Randomness in Group Theory - GAGTA Book 1, de Gruyter, 2020, 978-3-11-066491-1 |
|
|
Generic properties of subgroups of free groups and finite presentationsDelaram Kahrobaei, Bren Cavallo, David Garber. Algebra and Computer Science, 677, American Mathematical Society, pp.1-44, 2016, Contemporary Mathematics, 978-1-4704-2303-2 |
|
|
Theoretical Analysis of Branch Prediction in the Sliding Window Algorithm2024 |
|
|
Merge Strategies: from Merge Sort to TimSort2015 |
|
|
Seed: an easy to use random generator of recursive data structures for testing[Research Report] ENS Cachan. 2009, pp.18 |
|
|
Set Systems and Families of Permutations with Small Traces[Research Report] RR-7154, INRIA. 2009, pp.14 |