Number of documents

53


Journal articles12 documents

  • Frédérique Bassino, Cyril Nicaud, Pascal Weil. On the genericity of Whitehead minimality. Journal of Group Theory, De Gruyter, 2016, 19 (1), pp.137-159. ⟨hal-00919489v2⟩
  • Sven de Felice, Cyril Nicaud. Average Case Analysis of Brzozowski's Algorithm. International Journal of Foundations of Computer Science, World Scientific Publishing, 2016, 27 (02), pp.109-126. ⟨10.1142/S0129054116400025⟩. ⟨hal-01772820⟩
  • Otfried Cheong, Xavier Goaoc, Cyril Nicaud. Set Systems and Families of Permutations with Small Traces. European Journal of Combinatorics, Elsevier, 2013, 34, pp.229-239. ⟨http://www.sciencedirect.com/science/article/pii/S0195669812001072⟩. ⟨hal-00752064⟩
  • Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil. Statistical properties of subgroups of free groups. Random Structures and Algorithms, Wiley, 2013, 42, pp.349-373. ⟨10.1002/rsa.20407⟩. ⟨hal-00450218v3⟩
  • Frédérique Bassino, Julien David, Cyril Nicaud. Average Case Analysis of Moore's State Minimization Algorithm.. Algorithmica, Springer Verlag, 2012, 63 (1-2), pp.509-531. ⟨10.1007/s00453-011-9557-7⟩. ⟨hal-00452749⟩
  • Sarah Behrens, Cyril Nicaud, Pierre Nicodème. An Automaton Approach for Waiting Times in DNA Evolution. Journal of Computational Biology, Mary Ann Liebert, 2012, 19 (5), pp.550-562. ⟨hal-00793413⟩
  • Pierre-Cyrille Heam, Cyril Nicaud, Sylvain Schmitz. Parametric Random Generation of Deterministic Tree Automata. Theoretical Computer Science, Elsevier, 2010, 411 (1), pp.3469--3480. ⟨hal-00561274⟩
  • Frédérique Bassino, Laura Giambruno, Cyril Nicaud. The Average State Complexity of Rational Operations on Finite Languages. International Journal of Foundations of Computer Science, World Scientific Publishing, 2010, 21 (4), pp.495-515. ⟨hal-00452751v2⟩
  • Frédérique Bassino, Julien David, Cyril Nicaud. Enumeration and random generation of possibly incomplete deterministic automata.. Pure Mathematics and Applications, 2008, 19 (2-3), pp.1-16. ⟨hal-00452748⟩
  • Frédérique Bassino, Cyril Nicaud, Pascal Weil. Random generation of finitely generated subgroups of a free group. International Journal of Algebra and Computation, World Scientific Publishing, 2008, 18 (1), pp.375-405. ⟨hal-00164584⟩
  • Frédérique Bassino, Cyril Nicaud. Enumeration and random generation of accessible automata. Theoretical Computer Science, Elsevier, 2007, 381, pp.86-104. ⟨hal-00459712⟩
  • Frédérique Bassino, Julien Clément, Cyril Nicaud. The Standard Factorization of Lyndon Words: an Average Point of View. Discrete Mathematics, Elsevier, 2005, 290 (1), pp.1-25. ⟨hal-00619337⟩

Conference papers36 documents

  • Xavier Goaoc, Andreas Holmsen, Cyril Nicaud. An experimental study of forbidden patterns in geometric permutations by combinatorial lifting. 35th International Symposium on Computational Geometry, 2019, Portland, United States. ⟨10.4230/LIPIcs.SoCG.2019.40⟩. ⟨hal-02050539⟩
  • Philippe Duchon, Cyril Nicaud. On the Biased Partial Word Collector Problem. LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Apr 2018, Buenos Aires, Argentina. ⟨hal-01798293⟩
  • Philippe Duchon, Cyril Nicaud. On the Expected Number of Distinct Gapped Palindromic Factors. IWOCA 2018: International Workshop on Combinatorial Algorithms, Jul 2018, Singapour, Singapore. ⟨hal-01798294⟩
  • Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau. On the Worst-Case Complexity of TimSort. 26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.4:1--4:13, ⟨10.4230/LIPIcs.ESA.2018.4⟩. ⟨hal-01798381⟩
  • Philippe Duchon, Cyril Nicaud, Carine Pivoteau. Gapped Pattern Statistics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), Jul 2017, Varsovie, Poland. pp.21:1-21:12, ⟨10.4230/LIPIcs.CPM.2017.21⟩. ⟨hal-01565941⟩
  • Cyril Nicaud. Fast Synchronization of Random Automata. APPROX/RANDOM 2016, Sep 2016, Paris, France. pp.43.1-12, ⟨10.4230/LIPIcs.APPROX-RANDOM.2016.43⟩. ⟨hal-01719171⟩
  • Nicolas Auger, Cyril Nicaud, Carine Pivoteau. Good predictions are worth a few comparisons. STACS 2016, Feb 2016, Orléans, France. pp.12:1-12:14, ⟨10.4230/LIPIcs.STACS.2016.12⟩. ⟨hal-01212840⟩
  • Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau. Analysis of Algorithms for Permutations Biased by Their Number of Records. 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithm AOFA 2016, Jul 2016, Cracovie, Poland. ⟨hal-01838692⟩
  • Cyril Nicaud. Estimating Statistics on Words Using Ambiguous Descriptions. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), Jun 2016, Tel Aviv, Israel. pp.9, ⟨10.4230/LIPIcs.CPM.2016.9⟩. ⟨hal-01769095⟩
  • Cyril Nicaud. A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm. CPM 2015, Jun 2015, Ischia Island, Italy. pp.374-384, ⟨10.1007/978-3-319-19929-0_32⟩. ⟨hal-01719172⟩
  • Sven de Felice, Cyril Nicaud. On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States. DLT 2014, Aug 2014, Ekaterinburg, Russia. pp.25-36, ⟨10.1007%2F978-3-319-09698-8_3⟩. ⟨hal-01772856⟩
  • Cyril Nicaud. Random Deterministic Automata. MFCS 2014, Aug 2014, Budapest, Hungary. pp.5-23, ⟨10.1007/978-3-662-44522-8_2⟩. ⟨hal-01772890⟩
  • Sven de Felice, Cyril Nicaud. Brzozowski Algorithm Is Generically Super-Polynomial Deterministic Automata. DLT'13, 2013, France. pp.179-190, ⟨10.1007/978-3-642-38771-5_17⟩. ⟨hal-00841848⟩
  • Sven de Felice, Cyril Nicaud. Random Generation of Deterministic Acyclic Automata Using the Recursive Method. 8th International Computer Science Symposium in Russia (CSR'13), 2013, Russia. pp.88-99, ⟨10.1007/978-3-642-38536-0_8⟩. ⟨hal-00841835⟩
  • Mathilde Bouvel, Marni Mishna, Cyril Nicaud. Some simple varieties of trees arising in permutation analysis. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.825-836. ⟨hal-01229665⟩
  • Arnaud Carayol, Cyril Nicaud. Distribution of the number of accessible states in a random deterministic automaton. Christoph Dürr, Thomas Wilke. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. LIPIcs, 14, pp.194-205, 2012. 〈hal-00678213〉
  • Omar Aitmous, Frédérique Bassino, Cyril Nicaud. An Efficient Linear Pseudo-Minimization Algorithm for Aho-Corasick Automata. 23st Annual Symposium on Combinatorial Pattern Matching (CPM'12), 2012, Finland. pp.110-123. ⟨hal-00793395⟩
  • Frédérique Bassino, Cyril Nicaud, Pascal Weil. Generic properties of random subgroups of a free group for general distributions. 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'12), 2012, Canada. pp.155-166. ⟨hal-00687981⟩
  • Pierre-Cyrille Héam, Cyril Nicaud. Seed, an Easy-to-Use Random Generator of Recursive Data Structures for Testing. 4th IEEE International Conference on Software Testing, Verification and Validation (ICST'11), Mar 2011, Berlin, Germany. pp.60 - 69, ⟨10.1109/ICST.2011.31⟩. ⟨hal-00620373⟩
  • Frédérique Bassino, Laura Giambruno, Cyril Nicaud. Complexity of operations on cofinite languages. 9th Latin American Theoretical INformatics Symposium (LATIN 2010), Apr 2010, Oaxaca, Mexico. pp.222-233. ⟨hal-00459651⟩
  • Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil. On two distributions of subgroups of free groups. Workshop on Analytic Algorithmics and Combinatorics (ANALCO) 2010, Jan 2010, United States. pp.82-89. ⟨hal-00433210v2⟩
  • Giusi Castiglione, Cyril Nicaud, Marinella Sciortino. A challenging family of automata for classical minimization algorithms. 15th International Conference on Implementation and Application of Automata (CIAA'10), 2010, Canada. pp.251-260. ⟨hal-00620381⟩
  • Cyril Nicaud, Carine Pivoteau, Benoît Razet. Average Analysis of Glushkov Automata under a BST-Like Model. 30th Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), 2010, India. pp.388-399. ⟨hal-00620382⟩
  • Omar Aitmous, Frédérique Bassino, Cyril Nicaud. Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality. 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), Jun 2010, United States. pp.275-287. ⟨hal-00450674v2⟩
  • Otfried Cheong, Xavier Goaoc, Cyril Nicaud. Set Systems and Families of Permutations with Small Traces (abstract). 8th French Combinatorial Conference, 2010, France. ⟨hal-00620460⟩
  • Dominique Gouyou-Beauchamps, Cyril Nicaud. Random Generation Using Binomial Approximations. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.359-372. ⟨hal-01185570⟩
  • Frédérique Bassino, Julien David, Cyril Nicaud. On the Average Complexity of Moore's State Minimization Algorithm. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.123-134. ⟨inria-00359162⟩
  • Cyril Nicaud. On the Average Size of Glushkov's Automata. 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), Apr 2009, Tarragona, Spain. pp.626-637. ⟨hal-00430482⟩
  • Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz. Random Generation of Deterministic Tree (Walking) Automata. 14th 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⟩. ⟨inria-00408316⟩
  • Frédérique Bassino, Laura Giambruno, Cyril Nicaud. 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. ⟨hal-00452752⟩
  • Frédérique Bassino, Julien David, Cyril Nicaud. Random generation of possibly incomplete deterministic automata.. Génération Aléatoire de Structures COMbinatoires, 2008, Italy. pp.31-40. ⟨hal-00452754⟩
  • Frédérique Bassino, Julien David, Cyril Nicaud. REGAL: a library to randomly and exhaustively generate automata. 12th International Conference on Implementation and Application of Automata (CIAA'07), Jul 2007, Prague, Czech Republic. pp.303-305. ⟨hal-00459643⟩
  • Frédérique Bassino, Cyril Nicaud. Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.151-160. ⟨hal-00619870v2⟩
  • Frédérique Bassino, Julien Clément, Cyril Nicaud. Lyndon words with a fixed standard right factor. 15th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2004), Jan 2004, New Orleans, Louisiana, United States. pp.646-647. ⟨hal-00619866⟩
  • Frédérique Bassino, Julien Clément, Cyril Nicaud. The average lengths of the factors of the standard factorization of Lyndon words. 6th International Conference on Developments in Language Theory (DLT 2002), Sep 2003, Kyoto, Japan. pp.307-318. ⟨hal-00619865⟩
  • Cyril Nicaud. Average State Complexity of Operations on Unary Automata. MFCS 1999, Sep 1999, Szklarska Poreba, Poland, Poland. pp.231-240, ⟨10.1007/3-540-48340-3_21⟩. ⟨hal-00620109⟩

Book sections1 document

  • Frédérique Bassino, Cyril Nicaud, Pascal Weil. Generic properties of subgroups of free groups and finite presentations. Delaram Kahrobaei, Bren Cavallo, David Garber. Algebra and Computer Science, 677, American Mathematical Society, pp.1-44, 2016, Contemporary Mathematics, 978-1-4704-2303-2. ⟨hal-01171484v2⟩

Preprints, Working Papers, ...2 documents

  • Frédérique Bassino, Cyril Nicaud, Pascal Weil. Random presentations and random subgroups: a survey. 2017. ⟨hal-01456207v2⟩
  • Nicolas Auger, Cyril Nicaud, Carine Pivoteau. Merge Strategies: from Merge Sort to TimSort. 2015. ⟨hal-01212839v2⟩

Reports2 documents

  • Otfried Cheong, Xavier Goaoc, Cyril Nicaud. Set Systems and Families of Permutations with Small Traces. [Research Report] RR-7154, INRIA. 2009, pp.14. ⟨inria-00441376v2⟩
  • Pierre-Cyrille Heam, Cyril Nicaud. Seed: an easy to use random generator of recursive data structures for testing. [Research Report] 2009, pp.18. ⟨inria-00528585⟩