Nombre de documents

42


Article dans une revue11 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〉
  • 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〉
  • 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〉
  • 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, 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, 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. 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〉

Communication dans un congrès26 documents

  • Philippe Duchon, Cyril Nicaud, Carine Pivoteau. Gapped Pattern Statistics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), Jul 2017, Varsovie, Poland. 78, pp.21:1-21:12, LIPICS. 〈hal-01565941〉
  • Nicolas Auger, Cyril Nicaud, Carine Pivoteau. Good predictions are worth a few comparisons. STACS 2016, Feb 2016, Orléans, France. Leibniz International Proceedings in Informatics (LIPIcs), 47, pp.12:1-12:14, 〈10.4230/LIPIcs.STACS.2016.12〉. 〈hal-01212840〉
  • 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. 7913, pp.88-99, 2013, 〈10.1007/978-3-642-38536-0_8〉. 〈hal-00841835〉
  • Sven De Felice, Cyril Nicaud. Brzozowski Algorithm Is Generically Super-Polynomial Deterministic Automata. DLT'13, 2013, France. 7907, pp.179-190, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-38771-5_17〉. 〈hal-00841848〉
  • Mathilde Bouvel, Marni Mishna, Cyril Nicaud. Some simple varieties of trees arising in permutation analysis. Alain Goupil and Gilles Schaeffer. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), pp.825-836, 2013, DMTCS Proceedings. 〈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. 7354, pp.110-123, 2012. 〈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. DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), pp.155-166, 2012, Discrete Mathematics and Theoretical Computer Science. 〈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. IEEE, pp.60 - 69, 2011, 〈10.1109/ICST.2011.31〉. 〈hal-00620373〉
  • Otfried Cheong, Xavier Goaoc, Cyril Nicaud. Set Systems and Families of Permutations with Small Traces (abstract). 8th French Combinatorial Conference, 2010, France. 〈hal-00620460〉
  • 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. SIAM, pp.82-89, 2010. 〈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. Springer-Verlag, 6482, pp.251-260, 2010, LNCS. 〈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. Schloss Dagstuhl, 8, pp.388-399, 2010, LIPIcs. 〈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. 6129, pp.275-287, 2010. 〈hal-00450674v2〉
  • 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. Springer-Verlag., 6034, pp.222-233, 2010, LNCS. 〈hal-00459651〉
  • Dominique Gouyou-Beauchamps, Cyril Nicaud. Random Generation Using Binomial Approximations. Drmota, Michael and Gittenberger, Bernhard. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), pp.359-372, 2010, DMTCS Proceedings. 〈hal-01185570〉
  • 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. 5457, pp.626-637, 2009. 〈hal-00430482〉
  • Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz. Random Generation of Deterministic Tree (Walking) Automata. Sebastian Maneth. 14th International Conference on Implementation and Application of Automata - CIAA 2009, Jul 2009, Sydney, Australia. Springer-Verlag, 5642, pp.115--124, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-02979-0_15〉. 〈inria-00408316〉
  • Frédérique Bassino, Julien David, Cyril Nicaud. On the Average Complexity of Moore's State Minimization Algorithm. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.123-134, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00359162〉
  • 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, 2008. 〈hal-00452754〉
  • 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. 5257, pp.134-145, 2008. 〈hal-00452752〉
  • Frédérique Bassino, Julien David, Cyril Nicaud. REGAL: a library to randomly and exhaustively generate automata. Jan Holub, Jan Žďárek. 12th International Conference on Implementation and Application of Automata (CIAA'07), Jul 2007, Prague, Czech Republic. Springer-Verlag, 4783, pp.303-305., 2007, LNCS. 〈hal-00459643〉
  • Frédérique Bassino, Cyril Nicaud. Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers. Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.151-160, 2006, DMTCS Proceedings. 〈hal-00619870v2〉
  • Frédérique Bassino, Julien Clément, Cyril Nicaud. Lyndon words with a fixed standard right factor. Munro J. Ian. 15th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2004), Jan 2004, New Orleans, Louisiana, United States. SIAM, pp.646-647, 2004. 〈hal-00619866〉
  • Frédérique Bassino, Julien Clément, Cyril Nicaud. The average lengths of the factors of the standard factorization of Lyndon words. Ito Masami and Toyama Masafumi. 6th International Conference on Developments in Language Theory (DLT 2002), Sep 2003, Kyoto, Japan. Springer-Verlag, 2450, pp.307-318, 2003, LNCS. 〈hal-00619865〉
  • Cyril Nicaud. Average State Complexity of Operations on Unary Automata. MFCS 1999, Sep 1999, Szklarska Poreba, Poland, Poland. Springer-Verlag, 1672, pp.231-240, 1999, LNCS. 〈10.1007/3-540-48340-3_21〉. 〈hal-00620109〉

Chapitre d'ouvrage1 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〉

Pré-publication, Document de travail2 documents

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

Rapport2 documents

  • 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〉
  • 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〉