default search action
Frédérique Bassino
Person information
- affiliation: Université Paris-Nord, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Random Generation of Subgroups of the Modular Group with a Fixed Isomorphism Type. Electron. J. Comb. 31(4) (2024) - 2022
- [j20]Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot:
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. Comb. Theory 2(3) (2022) - [j19]Frédérique Bassino
, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot:
Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Struct. Algorithms 60(2): 166-200 (2022) - 2021
- [j18]Frédérique Bassino
Statistics of subgroups of the modular group. Int. J. Algebra Comput. 31(8): 1691-1751 (2021) - 2020
- [j17]Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon:
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. Discret. Appl. Math. 281: 1 (2020) - [c22]Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello
The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. AofA 2020: 3:1-3:15
2010 – 2019
- 2018
- [c21]Frédérique Bassino
The complexity of the Multiple Pattern Matching Problem for random strings. ANALCO 2018: 40-53 - [c20]Frédérique Bassino, Andrea Sportiello:
Linear-time exact sampling of sum-constrained random variables. GASCom 2018: 94-105 - 2017
- [j16]Frédérique Bassino
An algorithm computing combinatorial specifications of permutation classes. Discret. Appl. Math. 224: 16-44 (2017) - [j15]Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 62: 1-2 (2017) - [i12]Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello:
The complexity of the Multiple Pattern Matching Problem for random strings. CoRR abs/1706.04928 (2017) - 2016
- [c19]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Generic properties of subgroups of free groups and finite presentations. AMS-EMS-SPM Joint Meeting 2016 - 2015
- [j14]Frédérique Bassino
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Adv. Appl. Math. 64: 124-200 (2015) - [c18]Frédérique Bassino, Andrea Sportiello:
Linear-time generation of inhomogeneous random directed walks. ANALCO 2015: 51-65 - [i11]Frédérique Bassino
An algorithm computing combinatorial specifications of permutation classes. CoRR abs/1506.00868 (2015) - [i10]Frédérique Bassino
Generic properties of subgroups of free groups and finite presentations. CoRR abs/1507.01088 (2015) - 2013
- [j13]Frédérique Bassino
Statistical properties of subgroups of free groups. Random Struct. Algorithms 42(3): 349-373 (2013) - [j12]Frédérique Bassino
Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables. IEEE Trans. Inf. Theory 59(4): 2375-2395 (2013) - [i9]Frédérique Bassino, Andrea Sportiello:
Linear-time generation of specifiable combinatorial structures: general theory and first examples. CoRR abs/1307.1728 (2013) - [i8]Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin:
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. CoRR abs/1307.2006 (2013) - [i7]Frédérique Bassino
On the genericity of Whitehead minimality. CoRR abs/1312.4510 (2013) - 2012
- [j11]Frédérique Bassino
Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica 63(1-2): 509-531 (2012) - [j10]Frédérique Bassino
Counting occurrences for a finite set of words: Combinatorial methods. ACM Trans. Algorithms 8(3): 31:1-31:28 (2012) - [c17]Omar AitMous, Frédérique Bassino, Cyril Nicaud:
An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata. CPM 2012: 110-123 - [c16]Frédérique Bassino, Julien David, Andrea Sportiello:
Asymptotic enumeration of Minimal Automata. STACS 2012: 88-99 - 2011
- [j9]Frédérique Bassino, Mathilde Bouvel, Dominique Rossin:
Enumeration of Pin-Permutations. Electron. J. Comb. 18(1) (2011) - [i6]Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola:
Optimal prefix codes for pairs of geometrically-distributed random variables. CoRR abs/1102.2413 (2011) - [i5]Frédérique Bassino, Julien David, Andrea Sportiello:
Asymptotic enumeration of Minimal Automata. CoRR abs/1109.5683 (2011) - 2010
- [j8]Frédérique Bassino, Laura Giambruno, Cyril Nicaud:
The Average State Complexity of Rational Operations on Finite Languages. Int. J. Found. Comput. Sci. 21(4): 495-516 (2010) - [c15]Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil:
On Two Distributions of Subgroups of Free Groups. ANALCO 2010: 82-89 - [c14]Omar AitMous, Frédérique Bassino, Cyril Nicaud:
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality. CPM 2010: 275-287 - [c13]Frédérique Bassino, Laura Giambruno, Cyril Nicaud:
Complexity of Operations on Cofinite Languages. LATIN 2010: 222-233 - [i4]Frédérique Bassino
Statistical properties of subgroups of free groups. CoRR abs/1001.4472 (2010) - [i3]Frédérique Bassino
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial. CoRR abs/1002.3866 (2010)
2000 – 2009
- 2009
- [c12]Frédérique Bassino, Julien David, Cyril Nicaud:
On the Average Complexity of Moore's State Minimization Algorithm. STACS 2009: 123-134 - [i2]Frédérique Bassino
On the Average Complexity of Moore's State Minimization Algorithm. CoRR abs/0902.1048 (2009) - 2008
- [j7]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Random Generation of Finitely Generated Subgroups of a Free Group. Int. J. Algebra Comput. 18(2): 375-405 (2008) - [c11]Frédérique Bassino, Laura Giambruno, Cyril Nicaud:
The Average State Complexity of the Star of a Finite Set of Words Is Linear. Developments in Language Theory 2008: 134-145 - [i1]Frédérique Bassino, Julien Clément, Julien Fayolle, Pierre Nicodème:
Constructions for Clumps Statistics. CoRR abs/0804.3671 (2008) - 2007
- [j6]Frédérique Bassino, Cyril Nicaud:
Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381(1-3): 86-104 (2007) - [c10]Frédérique Bassino
: A Library to Randomly and Exhaustively Generate Automata. CIAA 2007: 303-305 - 2006
- [c9]Frédérique Bassino, Julien Clément
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions. DCC 2006: 113-122 - [c8]Frédérique Bassino, Julien Clément
Optimal prefix codes for pairs of geometrically-distributed random variables. ISIT 2006: 2667-2671 - 2005
- [b1]Frédérique Bassino:
Automates, énumération et algorithmes. (Automata, enumeration and algorithms). University of Marne-la-Vallée, France, 2005 - [j5]Frédérique Bassino
The standard factorization of Lyndon words: an average point of view. Discret. Math. 290(1): 1-25 (2005) - [j4]Shigeki Akiyama
Arithmetic Meyer sets and finite automata. Inf. Comput. 201(2): 199-215 (2005) - 2004
- [c7]Shigeki Akiyama, Frédérique Bassino
Automata for Arithmetic Meyer Sets. LATIN 2004: 252-261 - [c6]Frédérique Bassino, Julien Clément, Cyril Nicaud:
Lyndon words with a fixed standard right factor. SODA 2004: 653-654 - 2002
- [c5]Frédérique Bassino, Julien Clément, Cyril Nicaud:
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. Developments in Language Theory 2002: 307-318 - [c4]Frédérique Bassino:
Beta-Expansions for Cubic Pisot Numbers. LATIN 2002: 141-152 - 2000
- [j3]Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
A Finite State Version of the Kraft--McMillan Theorem. SIAM J. Comput. 30(4): 1211-1230 (2000)
1990 – 1999
- 1999
- [j2]Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
Enumerative Sequences of Leaves and Nodes in Rational Trees. Theor. Comput. Sci. 221(1-2): 41-60 (1999) - 1998
- [c3]Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
Super-State Automata and Rational Trees. LATIN 1998: 42-52 - 1997
- [j1]Frédérique Bassino:
Nonnegative Companion Matrices and Star-Height of N-Rational Series. Theor. Comput. Sci. 180(1-2): 61-80 (1997) - [c2]Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
Enumerative Sequences of Leaves in Rational Trees. ICALP 1997: 76-86 - 1996
- [c1]Frédérique Bassino:
Star-Height of an N-Rational Series. STACS 1996: 125-135
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: