Frédérique Bassino

Electron. J. Comb., 2024

2022

Random cographs: Brownian graphon limit and asymptotic degree distribution.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

2021

Statistics of subgroups of the modular group.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2021

2020

Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017.

[BibT_eX]

[DOI]

Flavia Bonomo-Braberman

Lionel Pournin

Mario Valencia-Pabon

Discret. Appl. Math., 2020

The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings.

[BibT_eX]

[DOI]

Tsinjo Rakotoarimalala

Proceedings of the 31st International Conference on Probabilistic, 2020

2018

Linear-time exact sampling of sum-constrained random variables.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

The complexity of the Multiple Pattern Matching Problem for random strings.

[BibT_eX]

[DOI]

Tsinjo Rakotoarimalala

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

An algorithm computing combinatorial specifications of permutation classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Generic properties of subgroups of free groups and finite presentations.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Computer Science, 2016

2015

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2015

Linear-time generation of inhomogeneous random directed walks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2013

Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Statistical properties of subgroups of free groups.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Linear-time generation of specifiable combinatorial structures: general theory and first examples.

[BibT_eX]

[DOI]

CoRR, 2013

On the genericity of Whitehead minimality.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Counting occurrences for a finite set of words: Combinatorial methods.

[BibT_eX]

[DOI]

Pierre Nicodème

ACM Trans. Algorithms, 2012

Average Case Analysis of Moore's State Minimization Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2012

Asymptotic enumeration of Minimal Automata.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata.

[BibT_eX]

[DOI]

Omar AitMous

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Enumeration of Pin-Permutations.

[BibT_eX]

[DOI]

Mathilde Bouvel

Dominique Rossin

Electron. J. Comb., 2011

2010

The Average State Complexity of Rational Operations on Finite Languages.

[BibT_eX]

[DOI]

Laura Giambruno

Int. J. Found. Comput. Sci., 2010

Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial

[BibT_eX]

[DOI]

CoRR, 2010

Complexity of Operations on Cofinite Languages.

[BibT_eX]

[DOI]

Laura Giambruno

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality.

[BibT_eX]

[DOI]

Omar AitMous

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

On Two Distributions of Subgroups of Free Groups.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009

On the Average Complexity of Moore's State Minimization Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

Random Generation of Finitely Generated Subgroups of a Free Group.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2008

Constructions for Clumps Statistics

[BibT_eX]

[DOI]

CoRR, 2008

The Average State Complexity of the Star of a Finite Set of Words Is Linear.

[BibT_eX]

[DOI]

Laura Giambruno

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

Enumeration and random generation of accessible automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

: A Library to Randomly and Exhaustively Generate Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2007

2006

Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions.

[BibT_eX]

[DOI]

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005

Arithmetic Meyer sets and finite automata.

[BibT_eX]

[DOI]

Shigeki Akiyama

Christiane Frougny

Inf. Comput., 2005

The standard factorization of Lyndon words: an average point of view.

[BibT_eX]

[DOI]

Discret. Math., 2005

Automates, énumération et algorithmes. (Automata, enumeration and algorithms).

[BibT_eX]

[DOI]

, 2005

2004

Lyndon words with a fixed standard right factor.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Automata for Arithmetic Meyer Sets.

[BibT_eX]

[DOI]

Shigeki Akiyama

Christiane Frougny

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2002

Beta-Expansions for Cubic Pisot Numbers.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2000

A Finite State Version of the Kraft--McMillan Theorem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

1999

Enumerative Sequences of Leaves and Nodes in Rational Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1998

Super-State Automata and Rational Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

Nonnegative Companion Matrices and Star-Height of N-Rational Series.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Enumerative Sequences of Leaves in Rational Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Star-Height of an N-Rational Series.

[BibT_eX]

[DOI]