Travelled to:1 × Canada
1 × Finland
1 × France
1 × Italy
1 × Taiwan
1 × United Kingdom
2 × Hungary
3 × Germany
4 × Spain
Collaborated with:R.Mercas S.Simmons ∅ A.Rashin B.Woodhouse N.Fox T.Oey T.D.Rankin E.Balkanski M.Kilgore B.J.Wyatt J.Lazarow S.Osborne K.Goldner A.Shackleton Y.Jiao J.M.Machacek S.Nelson A.Tebbe K.Black A.Zemke G.Scott N.C.Brownstein J.Palumbo K.Corcoran J.Nyberg K.Chen K.Hawes A.Lohr M.Bodnar J.Hidakatsu E.Weissenstein B.Blakeley J.Gunter N.Rampersad E.Allen C.Byrum E.Willett J.Becker L.Flapan S.Watkins J.I.Kim W.Severa
Talks about:word (24) partial (21) avoid (6) pattern (5) abelian (4) period (4) squar (4) complex (3) hole (3) set (3)
Person: Francine Blanchet-Sadri
DBLP: Blanchet-Sadri:Francine
Contributed to:
2015
2014
201420132015201320132012
201120122011201120102009200920082010200720072017Wrote 28 papers:
- DLT-2015-Blanchet-SadriR #word
- Squareable Words (FBS, AR), pp. 132–142.
- CIAA-2014-Blanchet-SadriGS #automaton
- Minimal Partial Languages and Automata (FBS, KG, AS), pp. 110–123.
- LATA-2014-Blanchet-SadriLSW
- Computing Depths of Patterns (FBS, AL, SS, BW), pp. 173–185.
- CIAA-2013-BalkanskiBKW #word
- Partial Word DFAs (EB, FBS, MK, BJW), pp. 36–47.
- CIAA-J-2013-BalkanskiBKW15 #complexity #on the #word
- On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
- DLT-2013-Blanchet-SadriF #complexity #on the #word
- On the Asymptotic Abelian Complexity of Morphic Words (FBS, NF), pp. 94–105.
- DLT-2013-Blanchet-SadriW #bound #strict
- Strict Bounds for Pattern Avoidance (FBS, BW), pp. 106–117.
- LATA-2013-Blanchet-SadriBFH #approach #graph #polynomial
- A Graph Polynomial Approach to Primitivity (FBS, MB, NF, JH), pp. 153–164.
- LATA-2013-Blanchet-SadriL #problem #word
- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
- DLT-2012-Blanchet-SadriJM #word
- Squares in Binary Partial Words (FBS, YJ, JMM), pp. 404–415.
- AFL-2011-Blanchet-Sadri #problem #word
- Open Problems on Avoidable Patterns in Partial Words (FBS), pp. 12–24.
- AFL-2011-Blanchet-SadriNT #on the #word
- On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.
- AFL-J-2011-Blanchet-Sadri12 #algorithm #combinator #word
- Algorithmic Combinatorics on Partial Words (FBS), pp. 1189–1206.
- DLT-2011-Blanchet-SadriS #word
- Avoiding Abelian Powers in Partial Words (FBS, SS), pp. 70–81.
- LATA-2011-Blanchet-SadriBZ #word
- Unary Pattern Avoidance in Partial Words Dense with Holes (FBS, KB, AZ), pp. 155–166.
- LATA-2010-Blanchet-SadriKMSS #word
- Abelian Square-Free Partial Words (FBS, JIK, RM, WS, SS), pp. 94–105.
- LATA-2010-Blanchet-SadriMSW #word
- Avoidable Binary Patterns in Partial Words (FBS, RM, SS, EW), pp. 106–117.
- DLT-2009-BlakeleyBGR #complexity #on the #set #word
- On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
- LATA-2009-Blanchet-SadriABM #how #question #word
- How Many Holes Can an Unbordered Partial Word Contain? (FBS, EA, CB, RM), pp. 176–187.
- LATA-2009-Blanchet-SadriMRW #algorithm #using #word
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (FBS, RM, AR, EW), pp. 188–199.
- AFL-2008-Blanchet-SadriMS #word
- Counting Distinct Squares in Partial Words (FBS, RM, GS), pp. 122–133.
- AFL-2008-Blanchet-SadriOR #word
- Computing Weak Periods of Partial Words (FBS, TO, TDR), pp. 134–145.
- AFL-J-2008-Blanchet-SadriOR10 #theorem #word
- Fine and Wilf’s Theorem for Partial Words with Arbitrarily Many Weak Periods (FBS, TO, TDR), pp. 705–722.
- DLT-2007-Blanchet-SadriBP #set #word
- Two Element Unavoidable Sets of Partial Words (FBS, NCB, JP), pp. 96–107.
- LATA-2007-Blanchet-SadriCN #word
- Fine and Wilf’s Periodicity Result on Partial Words and Consequences (FBS, KC, JN), pp. 115–126.
- AFL-2017-BeckerBSFW #set #word
- Unavoidable Sets of Partial Words of Uniform Length (JB, FBS, LF, SW), pp. 26–40.
- AFL-2017-BlanchetSadriCH #word
- Dyck Words, Lattice Paths, and Abelian Borders (FBS, KC, KH), pp. 56–70.
- AFL-2017-BlanchetSadriO #word
- Constructing Words with High Distinct Square Densities (FBS, SO), pp. 71–85.