| Enumeration and random generation of accessible automata F Bassino, C Nicaud Theoretical Computer Science 381 (1-3), 86-104, 2007 | 78 | 2007 |
| The Brownian limit of separable permutations F Bassino, M Bouvel, V Féray, L Gerin, A Pierrot The Annals of Probability 46 (4), 2134-2189, 2018 | 63 | 2018 |
| Universal limits of substitution-closed permutation classes F Bassino, M Bouvel, V Féray, L Gerin, M Maazoun, A Pierrot Journal of the European Mathematical Society 22 (11), 3565-3639, 2020 | 52 | 2020 |
| Beta-expansions for cubic Pisot numbers F Bassino LATIN 2002: Theoretical Informatics: 5th Latin American Symposium Cancun …, 2002 | 42 | 2002 |
| The standard factorization of Lyndon words: an average point of view F Bassino, J Clément, C Nicaud Discrete Mathematics 290 (1), 1-25, 2005 | 31 | 2005 |
| Scaling limits of permutation classes with a finite specification: a dichotomy F Bassino, M Bouvel, V Féray, L Gerin, M Maazoun, A Pierrot Advances in Mathematics 405, 108513, 2022 | 30 | 2022 |
| Average case analysis of Moore’s state minimization algorithm F Bassino, J David, C Nicaud Algorithmica 63 (1), 509-531, 2012 | 30 | 2012 |
| Random generation of finitely generated subgroups of a free group F Bassino, C Nicaud, P Weil International Journal of Algebra and Computation 18 (02), 375-405, 2008 | 27 | 2008 |
| Counting occurrences for a finite set of words: combinatorial methods F Bassino, J Clément, P Nicodème ACM Transactions on Algorithms (TALG) 8 (3), 1-28, 2012 | 25 | 2012 |
| On the average complexity of Moore's state minimization algorithm F Bassino, J David, C Nicaud 26th International Symposium on Theoretical Aspects of Computer Science …, 2009 | 25 | 2009 |
| REGAL: a library to randomly and exhaustively generate automata F Bassino, J David, C Nicaud Implementation and Application of Automata: 12th International Conference …, 2007 | 25 | 2007 |
| Asymptotic enumeration of minimal automata F Bassino, J David, A Sportiello 29th International Symposium on Theoretical Aspects of Computer Science …, 2012 | 21 | 2012 |
| Enumeration of pin-permutations F Bassino, M Bouvel, D Rossin The electronic journal of combinatorics 18 (1), P57, 2011 | 19 | 2011 |
| Length distributions and regular sequences F Bassino, MP Béal, D Perrin Codes, Systems, and Graphical Models, 415-437, 2001 | 19 | 2001 |
| Generating functions of circular codes F Bassino Advances in Applied Mathematics 22 (1), 1-24, 1999 | 19 | 1999 |
| Statistical properties of subgroups of free groups F Bassino, A Martino, C Nicaud, E Ventura, P Weil Random Structures & Algorithms 42 (3), 349-373, 2013 | 18 | 2013 |
| An algorithm computing combinatorial specifications of permutation classes F Bassino, M Bouvel, A Pierrot, C Pivoteau, D Rossin Discrete Applied Mathematics 224, 16-44, 2017 | 17 | 2017 |
| Complexity and Randomness in Group Theory: GAGTA BOOK 1 F Bassino, I Kapovich, M Lohrey, A Miasnikov, C Nicaud, A Nikolaev, ... Walter de Gruyter GmbH & Co KG, 2020 | 16 | 2020 |
| Constructions for clumps statistics F Bassino, J Clément, J Fayolle, P Nicodeme 5th International Colloquium on Mathematics and Computer Science (MathInfo …, 2008 | 16 | 2008 |
| Enumeration and random generation of possibly incomplete deterministic automata. F Bassino, J David, C Nicaud Pure Mathematics and Applications 19 (2-3), 1-16, 2008 | 16 | 2008 |
Julien ClémentChargé de Recherche CNRS, GREYC, Université de Caen, ENSICAEN在 unicaen.fr 的电子邮件经过验证
