Frédérique Bassino

According to our database1, Frédérique Bassino authored at least 43 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings.
Proceedings of the 31st International Conference on Probabilistic, 2020

2018
Linear-time exact sampling of sum-constrained random variables.
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.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2017

An algorithm computing combinatorial specifications of permutation classes.
Discret. Appl. Math., 2017

2015
Generic properties of subgroups of free groups and finite presentations.
CoRR, 2015

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
Adv. Appl. Math., 2015

Linear-time generation of inhomogeneous random directed walks.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2013
Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables.
IEEE Trans. Inf. Theory, 2013

Statistical properties of subgroups of free groups.
Random Struct. Algorithms, 2013

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

On the genericity of Whitehead minimality.
CoRR, 2013

2012
Counting occurrences for a finite set of words: Combinatorial methods.
ACM Trans. Algorithms, 2012

Average Case Analysis of Moore's State Minimization Algorithm.
Algorithmica, 2012

Asymptotic enumeration of Minimal Automata.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Enumeration of Pin-Permutations.
Electron. J. Comb., 2011

2010
The Average State Complexity of Rational Operations on Finite Languages.
Int. J. Found. Comput. Sci., 2010

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

Complexity of Operations on Cofinite Languages.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Building the Minimal Automaton of <i>A</i><sup>*</sup><i>X</i> in Linear Time, When <i>X</i> Is of Bounded Cardinality.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

On Two Distributions of Subgroups of Free Groups.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009
On the Average Complexity of Moore's State Minimization Algorithm.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
Random Generation of Finitely Generated Subgroups of a Free Group.
Int. J. Algebra Comput., 2008

Constructions for Clumps Statistics
CoRR, 2008

The Average State Complexity of the Star of a Finite Set of Words Is Linear.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
Enumeration and random generation of accessible automata.
Theor. Comput. Sci., 2007

: A Library to Randomly and Exhaustively Generate Automata.
Proceedings of the Implementation and Application of Automata, 2007

2006
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005
Arithmetic Meyer sets and finite automata.
Inf. Comput., 2005

The standard factorization of Lyndon words: an average point of view.
Discret. Math., 2005

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

2004
Lyndon words with a fixed standard right factor.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Automata for Arithmetic Meyer Sets.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2002
Beta-Expansions for Cubic Pisot Numbers.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2000
A Finite State Version of the Kraft--McMillan Theorem.
SIAM J. Comput., 2000

1999
Enumerative Sequences of Leaves and Nodes in Rational Trees.
Theor. Comput. Sci., 1999

1998
Super-State Automata and Rational Trees.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997
Nonnegative Companion Matrices and Star-Height of <i>N</i>-Rational Series.
Theor. Comput. Sci., 1997

Enumerative Sequences of Leaves in Rational Trees.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Star-Height of an N-Rational Series.
Proceedings of the STACS 96, 1996


  Loading...