Francine Blanchet-Sadri

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 15

Top Venues

Theor. Comput. Sci.

IWOCA

RAIRO Theor. Informatics Appl.

AFL

Publications

Francine Blanchet-Sadri, Kun Chen, Kenneth Hawes
Dyck Words, Lattice Paths, and Abelian Borders. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Francine Blanchet-Sadri, Michelle Cordier, Rachel Kirsch
Border correlations, lattices, and the subgraph component polynomial. Eur. J. Comb. 68 (2018)
Francine Blanchet-Sadri, Justin Lazarow, Jordan Nikkel, J. D. Quigley, Xufan Zhang
Computing primitively-rooted squares and runs in partial words. Eur. J. Comb. 68 (2018)
Francine Blanchet-Sadri, S. Osborne
Computing longest common extensions in partial words. Discret. Appl. Math. 246 (2018)
Francine Blanchet-Sadri, Kun Chen, Kenneth Hawes
Dyck Words, Lattice Paths, and Abelian Borders. AFL (2017)
Joey Becker, Francine Blanchet-Sadri, Laure Flapan, Stephen Watkins
Unavoidable Sets of Partial Words of Uniform Length. AFL (2017)
Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. Theory Comput. Syst. 60 (3) (2017)
Kevin Black, Francine Blanchet-Sadri, Ian Coley, Brent Woodhouse, Andrew Zemke
Pattern Avoidance in Partial Words Dense with Holes. J. Autom. Lang. Comb. 22 (4) (2017)
Francine Blanchet-Sadri, Kira Goldner, Aidan Shackleton
Minimal partial languages and automata. RAIRO Theor. Informatics Appl. 51 (2) (2017)
Francine Blanchet-Sadri, S. Osborne
Constructing Words with High Distinct Square Densities. AFL (2017)
Francine Blanchet-Sadri, Sinziana Munteanu
Computing generalized de Bruijn sequences. Theor. Comput. Sci. 704 (2017)
Francine Blanchet-Sadri, Daniel Seita, David Wise
Computing abelian complexity of binary uniform morphic words. Theor. Comput. Sci. 640 (2016)
Emily Allen, Francine Blanchet-Sadri, Michelle Bodnar, Brian Bowers, Joe Hidakatsu, John Lensmire
Combinatorics on partial word borders. Theor. Comput. Sci. 609 (2016)
Francine Blanchet-Sadri, Aleksandar Chakarov, Bob Chen, Lucas Manuelli, Sinziana Munteanu, Jarett Schwartz, Slater Stich
Recurrent Partial Words and Representable Sets. J. Autom. Lang. Comb. 21 (3) (2016)
Francine Blanchet-Sadri, Andrew Lohr
Computing Depths of Patterns. RAIRO Theor. Informatics Appl. 50 (2) (2016)
Francine Blanchet-Sadri, Michelle Bodnar, Jordan Nikkel, J. D. Quigley, Xufan Zhang
Squares and primitivity in partial words. Discret. Appl. Math. 185 (2015)
Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt
On the state complexity of partial word DFAs. Theor. Comput. Sci. 578 (2015)
Francine Blanchet-Sadri, Andrew Lohr
Computing minimum length representations of sets of words of uniform length. Theor. Comput. Sci. 596 (2015)
Francine Blanchet-Sadri, Rachel Harred, Justin Lazarow
Longest Common Extensions in Partial Words. IWOCA (2015)
Francine Blanchet-Sadri, Abraham Rashin
Squareable Words. DLT (2015)
Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu
Recurrence in infinite partial words. Theor. Comput. Sci. 524 (2014)
Francine Blanchet-Sadri, Yang Jiao, John M. Machacek, J. D. Quigley, Xufan Zhang
Squares in partial words. Theor. Comput. Sci. 530 (2014)
Francine Blanchet-Sadri, Kira Goldner, Aidan Shackleton
Minimal Partial Languages and Automata. CIAA (2014)
Francine Blanchet-Sadri, Benjamin De Winkle, Sean Simmons
Abelian pattern avoidance in partial words. RAIRO Theor. Informatics Appl. 48 (3) (2014)
Francine Blanchet-Sadri, Nathan Fox, Narad Rampersad
On the asymptotic abelian complexity of morphic words. Adv. Appl. Math. 61 (2014)
Francine Blanchet-Sadri, Jordan Nikkel, J. D. Quigley, Xufan Zhang
Computing Primitively-Rooted Squares and Runs in Partial Words. IWOCA (2014)
Francine Blanchet-Sadri, Andrew Lohr
Computing Minimum Length Representations of Sets of Words of Uniform Length. IWOCA (2014)
Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons, Brent Woodhouse
Computing Depths of Patterns. LATA (2014)
Francine Blanchet-Sadri, Michelle Cordier, Rachel Kirsch
Border Correlations, Lattices, and the Subgraph Component Polynomial. IWOCA (2014)
Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. Integers 14 (2014)
Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. STACS (2014)
Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu
A note on constructing infinite binary words with polynomial subword complexity. RAIRO Theor. Informatics Appl. 47 (2) (2013)
Francine Blanchet-Sadri, Brent Woodhouse
Strict bounds for pattern avoidance. Theor. Comput. Sci. 506 (2013)
Francine Blanchet-Sadri, Sean Simmons
Counting minimal semi-Sturmian words. Discret. Appl. Math. 161 (18) (2013)
Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu
A Graph Polynomial Approach to Primitivity. LATA (2013)
Francine Blanchet-Sadri, Brent Woodhouse
Strict Bounds for Pattern Avoidance. Developments in Language Theory (2013)
Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt
Partial Word DFAs. CIAA (2013)
Francine Blanchet-Sadri, Andrew Lohr, Shane Scott
Computing the partial word avoidability indices of ternary patterns. J. Discrete Algorithms 23 (2013)
Francine Blanchet-Sadri, Nathan Fox
On the Asymptotic Abelian Complexity of Morphic Words. Developments in Language Theory (2013)
Francine Blanchet-Sadri, Nathan Fox
Abelian-primitive partial words. Theor. Comput. Sci. 485 (2013)
Francine Blanchet-Sadri, Sean Simmons
Deciding representability of sets of words of equal length. Theor. Comput. Sci. 475 (2013)
Francine Blanchet-Sadri, Justin Lazarow
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem. LATA (2013)
Francine Blanchet-Sadri, Sinziana Munteanu
Deciding Representability of Sets of Words of Equal Length in Polynomial Time. IWOCA (2013)
Francine Blanchet-Sadri, Andrew Lohr, Shane Scott
Computing the partial word avoidability indices of binary patterns. J. Discrete Algorithms 23 (2013)
Francine Blanchet-Sadri, Sean Simmons, Amelia Tebbe, Amy Veprauskas
Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. RAIRO Theor. Informatics Appl. 47 (3) (2013)
Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia
Periods in partial words: An algorithm. J. Discrete Algorithms 16 (2012)
Francine Blanchet-Sadri
Algorithmic Combinatorics on Partial Words. Int. J. Found. Comput. Sci. 23 (6) (2012)
Francine Blanchet-Sadri, Sean Simmons, Dimin Xu
Abelian repetitions in partial words. Adv. Appl. Math. 48 (1) (2012)
Francine Blanchet-Sadri, Yang Jiao, John M. Machacek
Squares in Binary Partial Words. Developments in Language Theory (2012)
Francine Blanchet-Sadri, Sean Simmons
Deciding Representability of Sets of Words of Equal Length. DCFS (2012)
Francine Blanchet-Sadri, Sean Simmons
Abelian Pattern Avoidance in Partial Words. MFCS (2012)
Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett
Periodicity algorithms and a conjecture on overlaps in partial words. Theor. Comput. Sci. 443 (2012)
Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich
Constructing partial words with subword complexities not achievable by full words. Theor. Comput. Sci. 432 (2012)
Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
Erratum to: Avoidable binary patterns in partial words. Acta Informatica 49 (1) (2012)
Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons, Dimin Xu
Avoiding abelian squares in partial words. J. Comb. Theory, Ser. A 119 (1) (2012)
Francine Blanchet-Sadri, Andrew Lohr, Shane Scott
Computing the Partial Word Avoidability Indices of Ternary Patterns. IWOCA (2012)
Francine Blanchet-Sadri, Steven Ji, Elizabeth Reiland
Number of holes in unavoidable sets of partial words II. J. Discrete Algorithms 14 (2012)
Francine Blanchet-Sadri, Robert Mercas
The three-squares lemma for partial words with one hole. Theor. Comput. Sci. 428 (2012)
Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov
Number of holes in unavoidable sets of partial words I. J. Discrete Algorithms 14 (2012)
Francine Blanchet-Sadri, Sean Simmons
Avoiding Abelian Powers in Partial Words. Developments in Language Theory (2011)
Francine Blanchet-Sadri, Kevin Black, Andrew Zemke
Unary Pattern Avoidance in Partial Words Dense with Holes. LATA (2011)
Francine Blanchet-Sadri, Sarah Nelson, Amelia Tebbe
On Operations Preserving Primitivity of Partial Words with One Hole. AFL (2011)
Francine Blanchet-Sadri, John Lensmire
On Minimal Sturmian Partial Words. STACS (2011)
Francine Blanchet-Sadri, John Lensmire
On minimal Sturmian partial words. Discret. Appl. Math. 159 (8) (2011)
Francine Blanchet-Sadri
Open Problems on Avoidable Patterns in Partial Words. AFL (2011)
Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia
Periods in Partial Words: An Algorithm. IWOCA (2011)
Emily Allen, Francine Blanchet-Sadri, Cameron Byrum, Mihai Cucuringu, Robert Mercas
Counting Bordered Partial Words by Critical Positions. Electron. J. Comb. 18 (1) (2011)
Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
Avoidable binary patterns in partial words. Acta Informatica 48 (1) (2011)
Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich
Recurrent Partial Words WORDS (2011)
Francine Blanchet-Sadri, Ilkyoo Choi, Robert Mercas
Avoiding large squares in partial words. Theor. Comput. Sci. 412 (29) (2011)
Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
Avoidable Binary Patterns in Partial Words. LATA (2010)
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
On the complexity of deciding avoidability of sets of partial words. Theor. Comput. Sci. 411 (49) (2010)
Francine Blanchet-Sadri, Mihai Cucuringu
Counting Primitive Partial Words. J. Autom. Lang. Comb. 15 (3/4) (2010)
Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons
Abelian Square-Free Partial Words. LATA (2010)
Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich, Benjamin J. Wyatt
Binary De Bruijn Partial Words with One Hole. TAMC (2010)
Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three. IWOCA (2010)
Francine Blanchet-Sadri, E. Clader, O. Simpson
Border Correlations of Partial Words. Theory Comput. Syst. 47 (1) (2010)
Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin
Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods. Int. J. Found. Comput. Sci. 21 (5) (2010)
Francine Blanchet-Sadri, Justin Fowler, Joshua D. Gafni, Kevin H. Wilson
Combinatorics on partial word correlations. J. Comb. Theory, Ser. A 117 (6) (2010)
Francine Blanchet-Sadri, Raphaël M. Jungers, Justin Palumbo
Testing avoidability on sets of partial words is hard. Theor. Comput. Sci. 410 (8-10) (2009)
Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
Equations on partial words. RAIRO Theor. Informatics Appl. 43 (1) (2009)
Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas
How Many Holes Can an Unbordered Partial Word Contain?. LATA (2009)
Francine Blanchet-Sadri, Robert Mercas
A note on the number of squares in a partial word with one hole. RAIRO Theor. Informatics Appl. 43 (4) (2009)
Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
Counting Distinct Squares in Partial Words. Acta Cybern. 19 (2) (2009)
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory (2009)
Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
A generalization of Thue freeness for partial words. Theor. Comput. Sci. 410 (8-10) (2009)
Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. LATA (2009)
Francine Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas, Margaret Moorefield
Unbordered partial words. Discret. Appl. Math. 157 (5) (2009)
Francine Blanchet-Sadri, N. C. Brownstein, Andy Kalcic, Justin Palumbo, Tracy Weyand
Unavoidable Sets of Partial Words. Theory Comput. Syst. 45 (2) (2009)
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia
Graph connectivity, partial words, and a theorem of Fine and Wilf. Inf. Comput. 206 (5) (2008)
Francine Blanchet-Sadri, L. Bromberg, K. Zipple
Remarks on Two Nonstandard Versions of Periodicity in Words. Int. J. Found. Comput. Sci. 19 (6) (2008)
Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
Counting Distinct Squares in Partial Words. AFL (2008)
Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg
Periodicity properties on partial words. Inf. Comput. 206 (9-10) (2008)
Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin
Computing Weak Periods of Partial Words. AFL (2008)
Francine Blanchet-Sadri, N. C. Brownstein, Justin Palumbo
Two Element Unavoidable Sets of Partial Words. Developments in Language Theory (2007)
Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg
Fine and Wilf's Periodicity Result on Partial Words and Consequences. LATA (2007)
Francine Blanchet-Sadri, Arundhati R. Anavekar
Testing primitivity on partial words. Discret. Appl. Math. 155 (3) (2007)
Francine Blanchet-Sadri, Nathan D. Wetzler
Partial words and the critical factorization theorem revisited. Theor. Comput. Sci. 385 (1-3) (2007)
Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson
Correlations of Partial Words. STACS (2007)
Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
Equations on Partial Words. MFCS (2006)

Francine Blanchet-Sadri.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Francine Blanchet-Sadri