Edit Profile Blanchet-Sadri, Francine Compute Distance To: Compute Author ID: blanchet-sadri.francine Published as: Blanchet-Sadri, F.; Blanchet-Sadri, Francine External Links: MGP Documents Indexed: 124 Publications since 1989, including 1 Book Reviewing Activity: 100 Reviews all top 5 Co-Authors 23 single-authored 15 Mercaş, Robert George 15 Simmons, Sean 7 Lohr, Andrew 5 Bodnar, Michelle 5 Chakarov, Aleksandar 5 Chen, Bob 5 Fox, Nathan 5 Munteanu, Sinziana 4 Quigley, James D. 4 Rampersad, Narad 4 Schwartz, Jarett 4 Stich, Slater 4 Weissenstein, Eric 4 Woodhouse, Brent 4 Zhang, Xufan 3 Allen, Emily 3 Blakeley, Brandon 3 De Winkle, Benjamin 3 Gunter, Josh 3 Lazarow, Justin 3 Lensmire, John 3 Manuelli, Lucas 3 Nikkel, Jordan 3 Palumbo, Justin 3 Rashin, Abraham 3 Scott, Shane 3 Sisodia, Gautam 3 Wyatt, Benjamin J. 2 Balkanski, Eric 2 Black, Kevin 2 Blair, D. Dakota 2 Brownstein, Naomi C. 2 Byrum, Cameron 2 Cordier, Michelle 2 Cucuringu, Mihai 2 Gafni, Joshua D. 2 Goldner, Kira 2 Hidakatsu, Joe 2 Jiao, Yang 2 Kilgore, Matthew 2 Kim, Jane I. 2 Kirsch, Rachel 2 Lewis, Rebeca V. 2 Machacek, John M. 2 Mandel, Travis 2 Scott, Geoffrey 2 Severa, William 2 Shackleton, Aidan 2 Tebbe, Amelia 2 Willett, Elara 2 Wilson, Kevin H. 2 Xu, Dimin 2 Zemke, Andrew 1 Anavekar, Arundhati R. 1 Bal, Deepak 1 Bowers, Brian 1 Bromberg, Luba 1 Choi, Ilkyoo 1 Chriscoe, Ajay 1 Clader, Emily 1 Coley, Ian 1 Corcoran, Kevin 1 Currie, James D. 1 Davis, C. D. 1 Dodge, Joel 1 Duncan, S. 1 Fowler, Justin 1 Gaddis, F. Dale 1 Harred, Rachel 1 Hegstrom, Robert A. 1 Howell, Thomas D. 1 Ji, Steven 1 Jungers, Raphaël M. 1 Kalcic, Andy 1 Luhmann, D. K. 1 Moorefield, Margaret 1 Morgan, Christopher L. 1 Nelson, Sarah A. 1 Nyberg, Jenell 1 Oey, Taktin 1 Osborne, Steven Paul 1 Rankin, Timothy D. 1 Reiland, Elizabeth 1 Seita, Daniel 1 Simpson, Olivia 1 Veprauskas, Amy 1 Wetzler, Nathan D. 1 Weyand, Tracy 1 Wise, David H. 1 Zhang, Lili 1 Zhang, Xinhong 1 Zipple, K. all top 5 Serials 23 Theoretical Computer Science 11 Discrete Applied Mathematics 5 International Journal of Foundations of Computer Science 5 Journal of Discrete Algorithms 5 RAIRO. Theoretical Informatics and Applications 4 Computers & Mathematics with Applications 4 Semigroup Forum 4 RAIRO. Informatique Théorique et Applications 3 Journal of Combinatorial Theory. Series A 3 Theory of Computing Systems 3 Journal of Automata, Languages and Combinatorics 2 Acta Informatica 2 European Journal of Combinatorics 2 Advances in Applied Mathematics 2 Information and Computation 2 RAIRO. Theoretical Informatics and Applications 1 IEEE Transactions on Information Theory 1 Acta Cybernetica 1 International Journal of Mathematics and Mathematical Sciences 1 Journal of Computer and System Sciences 1 The Electronic Journal of Combinatorics 1 Integers 1 Discrete Mathematics and its Applications all top 5 Fields 118 Computer science (68-XX) 21 Combinatorics (05-XX) 10 Group theory and generalizations (20-XX) 5 Mathematical logic and foundations (03-XX) 4 General algebraic systems (08-XX) 4 Information and communication theory, circuits (94-XX) 3 Number theory (11-XX) 1 Biology and other natural sciences (92-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 99 Publications have been cited 476 times in 162 Documents Cited by ▼ Year ▼ Algorithmic combinatorics on partial words. Zbl 1180.68205Blanchet-Sadri, Francine 50 2008 Partial words and a theorem of Fine and Wilf revisited. Zbl 0988.68142Blanchet-Sadri, F.; Hegstrom, Robert A. 28 2002 Periodicity on partial words. Zbl 1068.68110Blanchet-Sadri, F. 17 2004 Games, equations and the dot-depth hierarchy. Zbl 0682.03015Blanchet-Sadri, F. 14 1989 Codes, orderings, and partial words. Zbl 1086.68108Blanchet-Sadri, F. 13 2004 Local periods and binary partial words: an algorithm. Zbl 1070.68061Blanchet-Sadri, F.; Chriscoe, Ajay 13 2004 Equations and monoid varieties of dot-depth one and two. Zbl 0801.68105Blanchet-Sadri, F. 13 1994 Primitive partial words. Zbl 1101.68643Blanchet-Sadri, F. 12 2005 Partial words and the critical factorization theorem. Zbl 1073.68067Blanchet-Sadri, F.; Duncan, S. 11 2005 Conjugacy on partial words. Zbl 1061.68123Blanchet-Sadri, F.; Luhmann, D. K. 11 2002 Equations and dot-depth one. Zbl 0814.20048Blanchet-Sadri, F. 11 1993 A generalization of Thue freeness for partial words. Zbl 1162.68029Blanchet-Sadri, F.; Mercaş, Robert; Scott, Geoffrey 10 2009 On dot-depth two. Zbl 0718.68046Blanchet-Sadri, F. 10 1990 Counting distinct squares in partial words. Zbl 1199.68199Blanchet-Sadri, F.; Mercas, Robert; Scott, Geoffrey 8 2009 Unavoidable sets of partial words. Zbl 1187.68358Blanchet-Sadri, F.; Brownstein, N. C.; Kalcic, Andy; Palumbo, Justin; Weyand, T. 8 2009 Some logical characterizations of the dot-depth hierarchy and applications. Zbl 0831.68066Blanchet-Sadri, F. 8 1995 Games, equations and dot-depth two monoids. Zbl 0791.20068Blanchet-Sadri, F. 8 1992 Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. Zbl 1307.68059Blanchet-Sadri, Francine; Simmons, Sean; Tebbe, Amelia; Veprauskas, Amy 7 2013 Algorithmic combinatorics on partial words. Zbl 1266.68145Blanchet-Sadri, F. 7 2012 Avoidable binary patterns in partial words. Zbl 1243.68230Blanchet-Sadri, F.; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric 7 2011 A note on the number of squares in a partial word with one hole. Zbl 1192.68496Blanchet-Sadri, Francine; Mercaş, Robert 7 2009 A periodicity result of partial words with one hole. Zbl 1074.68046Blanchet-Sadri, F. 7 2003 On a complete set of generators for dot-depth two. Zbl 0793.68087Blanchet-Sadri, F. 7 1994 Testing avoidability on sets of partial words is hard. Zbl 1162.68028Blanchet-Sadri, F.; Jungers, Raphaël M.; Palumbo, Justin 6 2009 On the asymptotic abelian complexity of morphic words. Zbl 1371.68220Blanchet-Sadri, F.; Fox, Nathan; Rampersad, Narad 5 2014 New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings. Zbl 1359.68238Blanchet-Sadri, Francine; Bodnar, Michelle; De Winkle, Benjamin 5 2014 Squares in partial words. Zbl 1359.68236Blanchet-Sadri, F.; Jiao, Yang; Machacek, John M.; Quigley, J. D.; Zhang, Xufan 5 2014 Avoiding Abelian squares in partial words. Zbl 1233.68183Blanchet-Sadri, F.; Kim, Jane I.; Mercaş, Robert; Severa, William; Simmons, Sean; Xu, Dimin 5 2012 Unary pattern avoidance in partial words dense with holes. Zbl 1330.68232Blanchet-Sadri, Francine; Black, Kevin; Zemke, Andrew 5 2011 Graph connectivity, partial words, and a theorem of Fine and Wilf. Zbl 1146.68408Blanchet-Sadri, F.; Bal, Deepak; Sisodia, Gautam 5 2008 Testing primitivity on partial words. Zbl 1108.68093Blanchet-Sadri, F.; Anavekar, Arundhati R. 5 2007 Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\). Zbl 1285.68128Blanchet-Sadri, F.; Currie, James D.; Rampersad, Narad; Fox, Nathan 4 2014 Computing the partial word avoidability indices of binary patterns. Zbl 1334.68166Blanchet-Sadri, F.; Lohr, Andrew; Scott, Shane 4 2013 Strict bounds for pattern avoidance. Zbl 1301.68209Blanchet-Sadri, F.; Woodhouse, Brent 4 2013 Periodicity algorithms and a conjecture on overlaps in partial words. Zbl 1250.68216Blanchet-Sadri, F.; Mercaş, Robert; Rashin, Abraham; Willett, Elara 4 2012 Fine and Wilf’s theorem for partial words with arbitrarily many weak periods. Zbl 1213.68354Blanchet-Sadri, F.; Oey, Taktin; Rankin, Timothy D. 4 2010 Unbordered partial words. Zbl 1187.68289Blanchet-Sadri, F.; Davis, C. D.; Dodge, Joel; Mercaş, Robert; Moorefield, Margaret 4 2009 Partial words and the critical factorization theorem revisited. Zbl 1124.68086Blanchet-Sadri, F.; Wetzler, Nathan D. 4 2007 Equations on the semidirect product of a finite semilattice by a \(J\)- trivial monoid of height \(k\). Zbl 0833.68073Blanchet-Sadri, F. 4 1995 Computing abelian complexity of binary uniform morphic words. Zbl 1352.68198Blanchet-Sadri, F.; Seita, Daniel; Wise, David 3 2016 Squares and primitivity in partial words. Zbl 1311.05087Blanchet-Sadri, F.; Bodnar, Michelle; Nikkel, Jordan; Quigley, J. D.; Zhang, Xufan 3 2015 Abelian pattern avoidance in partial words. Zbl 1297.68190Blanchet-Sadri, F.; De Winkle, Benjamin; Simmons, Sean 3 2014 Strict bounds for pattern avoidance. Zbl 1381.68229Blanchet-Sadri, Francine; Woodhouse, Brent 3 2013 Suffix trees for partial words and the longest common compatible prefix problem. Zbl 1377.68326Blanchet-Sadri, Francine; Lazarow, Justin 3 2013 Computing the partial word avoidability indices of ternary patterns. Zbl 1293.68208Blanchet-Sadri, Francine; Lohr, Andrew; Scott, Shane 3 2012 Abelian repetitions in partial words. Zbl 1231.68187Blanchet-Sadri, F.; Simmons, Sean; Xu, Dimin 3 2012 Counting bordered partial words by critical positions. Zbl 1221.68174Allen, Emily; Blanchet-Sadri, F.; Byrum, Cameron; Cucuringu, Mihai; Mercaş, Robert 3 2011 On minimal Sturmian partial words. Zbl 1217.68165Blanchet-Sadri, F.; Lensmire, John 3 2011 On the complexity of deciding avoidability of sets of partial words. Zbl 1208.68164Blakeley, Brandon; Blanchet-Sadri, F.; Gunter, Josh; Rampersad, Narad 3 2010 An answer to a conjecture on overlaps in partial words using periodicity algorithms. Zbl 1234.68197Blanchet-Sadri, Francine; Mercaş, Robert; Rashin, Abraham; Willett, Elara 3 2009 Equations on partial words. Zbl 1170.68032Blanchet-Sadri, Francine; Blair, D. Dakota; Lewis, Rebeca V. 3 2009 Open problems on partial words. Zbl 1156.68510Blanchet-Sadri, Francine 3 2008 Correlations of partial words. Zbl 1186.68344Blanchet-Sadri, Francine; Gafni, Joshua D.; Wilson, Kevin H. 3 2007 On unique, multiset, and set decipherability of three-word codes. Zbl 0998.94039Blanchet-Sadri, F. 3 2001 Multiset and set decipherable codes. Zbl 0989.94034Blanchet-Sadri, F.; Morgan, C. 3 2001 The dot-depth of a generating class of aperiodic monoids is computable. Zbl 0776.68087Blanchet-Sadri, F. 3 1992 Longest common extensions in partial words. Zbl 1393.68137Blanchet-Sadri, Francine; Harred, Rachel; Lazarow, Justin 2 2016 Computing primitively-rooted squares and runs in partial words. Zbl 1380.68319Blanchet-Sadri, Francine; Nikkel, Jordan; Quigley, J. D.; Zhang, Xufan 2 2015 Border correlations, lattices, and the subgraph component polynomial. Zbl 1396.05004Blanchet-Sadri, Francine; Cordier, Michelle; Kirsch, Rachel 2 2015 Deciding representability of sets of words of equal length in polynomial time. Zbl 1407.68380Blanchet-Sadri, Francine; Munteanu, Sinziana 2 2013 On the asymptotic abelian complexity of morphic words. Zbl 1381.68228Blanchet-Sadri, Francine; Fox, Nathan 2 2013 A graph polynomial approach to primitivity. Zbl 1377.68190Blanchet-Sadri, Francine; Bodnar, Michelle; Fox, Nathan; Hidakatsu, Joe 2 2013 Deciding representability of sets of words of equal length. Zbl 1293.68158Blanchet-Sadri, F.; Simmons, Sean 2 2013 Erratum to: “Avoidable binary patterns in partial words”. Zbl 1234.68196Blanchet-Sadri, F.; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric 2 2012 Periods in partial words: an algorithm. Zbl 1314.68247Blanchet-Sadri, Francine; Mandel, Travis; Sisodia, Gautam 2 2011 Avoiding abelian powers in partial words. Zbl 1221.68177Blanchet-Sadri, Francine; Simmons, Sean 2 2011 Classifying all avoidable sets of partial words of size two. Zbl 1228.68041Blanchet-Sadri, Francine; Blakeley, Brandon; Gunter, Josh; Simmons, Sean; Weissenstein, Eric 2 2011 Minimum number of holes in unavoidable sets of partial words of size three. Zbl 1232.68096Blanchet-Sadri, Francine; Chen, Bob; Chakarov, Aleksandar 2 2011 Border correlations of partial words. Zbl 1205.68273Blanchet-Sadri, F.; Clader, E.; Simpson, O. 2 2010 Combinatorics on partial word correlations. Zbl 1218.05006Blanchet-Sadri, F.; Fowler, Justin; Gafni, Joshua D.; Wilson, Kevin H. 2 2010 Binary de Bruijn partial words with one hole. Zbl 1284.68482Blanchet-Sadri, Francine; Schwartz, Jarett; Stich, Slater; Wyatt, Benjamin J. 2 2010 Abelian square-free partial words. Zbl 1284.68480Blanchet-Sadri, Francine; Kim, Jane I.; Mercaş, Robert; Severa, William; Simmons, Sean 2 2010 On the complexity of deciding avoidability of sets of partial words. Zbl 1247.68126Blakeley, Brandon; Blanchet-Sadri, Francine; Gunter, Josh; Rampersad, Narad 2 2009 Two element unavoidable sets of partial words. Zbl 1202.68294Blanchet-Sadri, F.; Brownstein, N. C.; Palumbo, Justin 2 2007 Equations on partial words. Zbl 1132.68513Blanchet-Sadri, F.; Blair, D. Dakota; Lewis, Rebeca V. 2 2006 Note on decipherability of three-word codes. Zbl 1004.94014Blanchet-Sadri, F.; Howell, T. 2 2002 Inclusion relations between some congruences related to the dot-depth hierarchy. Zbl 0854.68051Blanchet-Sadri, F. 2 1996 Equations on the semidirect product of a finite semilattice by a finite commutative monoid. Zbl 0816.20052Blanchet-Sadri, F.; Zhang, Xin-Hong 2 1994 Border correlations, lattices, and the subgraph component polynomial. Zbl 1373.05002Blanchet-Sadri, F.; Cordier, M.; Kirsch, R. 1 2018 New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings. Zbl 1366.68222Blanchet-Sadri, F.; Bodnar, Michelle; De Winkle, Benjamin 1 2017 Computing minimum length representations of sets of words of uniform length. Zbl 1396.68082Blanchet-Sadri, Francine; Lohr, Andrew 1 2015 Computing minimum length representations of sets of words of uniform length. Zbl 1328.68322Blanchet-Sadri, F.; Lohr, Andrew 1 2015 Computing depths of patterns. Zbl 1407.68379Blanchet-Sadri, Francine; Lohr, Andrew; Simmons, Sean; Woodhouse, Brent 1 2014 Computing the partial word avoidability indices of ternary patterns. Zbl 1334.68167Blanchet-Sadri, F.; Lohr, Andrew; Scott, Shane 1 2013 Partial word DFAs. Zbl 1298.68123Balkanski, Eric; Blanchet-Sadri, F.; Kilgore, Matthew; Wyatt, B. J. 1 2013 Periods in partial words: an algorithm. Zbl 1279.68279Blanchet-Sadri, F.; Mandel, Travis; Sisodia, Gautam 1 2012 Squares in binary partial words. Zbl 1370.68240Blanchet-Sadri, Francine; Jiao, Yang; Machacek, John M. 1 2012 Abelian pattern avoidance in partial words. Zbl 1365.68361Blanchet-Sadri, Francine; Simmons, Sean 1 2012 Constructing partial words with subword complexities not achievable by full words. Zbl 1244.68063Blanchet-Sadri, F.; Chakarov, Aleksandar; Manuelli, Lucas; Schwartz, Jarett; Stich, Slater 1 2012 The three-squares lemma for partial words with one hole. Zbl 1250.68215Blanchet-Sadri, F.; Mercaş, Robert 1 2012 Recurrent partial words. Zbl 1331.68164Blanchet-Sadri, Francine; Chakarov, Aleksandar; Manuelli, Lucas; Schwartz, Jarett; Stich, Slater 1 2011 On minimal Sturmian partial words. Zbl 1230.68123Blanchet-Sadri, Francine; Lensmire, John 1 2011 Counting primitive partial words. Zbl 1345.68245Blanchet-Sadri, Francine; Cucuringu, Mihai 1 2010 Avoidable binary patterns in partial words. Zbl 1284.68481Blanchet-Sadri, Francine; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric 1 2010 How many holes can an unbordered partial word contain? Zbl 1234.68327Blanchet-Sadri, Francine; Allen, Emily; Byrum, Cameron; Mercaş, Robert 1 2009 Algorithms for approximate \(k\)-covering of strings. Zbl 1105.68028Zhang, Lili; Blanchet-Sadri, F. 1 2005 Trees, congruences and varieties of finite semigroups. Zbl 0906.68090Blanchet-Sadri, F. 1 1998 On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups. Zbl 0889.68089Blanchet-Sadri, F. 1 1997 On semidirect and two-sided semidirect products of finite \(\mathcal J\)-trivial monoids. Zbl 0906.20039Blanchet-Sadri, F. 1 1996 Border correlations, lattices, and the subgraph component polynomial. Zbl 1373.05002Blanchet-Sadri, F.; Cordier, M.; Kirsch, R. 1 2018 New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings. Zbl 1366.68222Blanchet-Sadri, F.; Bodnar, Michelle; De Winkle, Benjamin 1 2017 Computing abelian complexity of binary uniform morphic words. Zbl 1352.68198Blanchet-Sadri, F.; Seita, Daniel; Wise, David 3 2016 Longest common extensions in partial words. Zbl 1393.68137Blanchet-Sadri, Francine; Harred, Rachel; Lazarow, Justin 2 2016 Squares and primitivity in partial words. Zbl 1311.05087Blanchet-Sadri, F.; Bodnar, Michelle; Nikkel, Jordan; Quigley, J. D.; Zhang, Xufan 3 2015 Computing primitively-rooted squares and runs in partial words. Zbl 1380.68319Blanchet-Sadri, Francine; Nikkel, Jordan; Quigley, J. D.; Zhang, Xufan 2 2015 Border correlations, lattices, and the subgraph component polynomial. Zbl 1396.05004Blanchet-Sadri, Francine; Cordier, Michelle; Kirsch, Rachel 2 2015 Computing minimum length representations of sets of words of uniform length. Zbl 1396.68082Blanchet-Sadri, Francine; Lohr, Andrew 1 2015 Computing minimum length representations of sets of words of uniform length. Zbl 1328.68322Blanchet-Sadri, F.; Lohr, Andrew 1 2015 On the asymptotic abelian complexity of morphic words. Zbl 1371.68220Blanchet-Sadri, F.; Fox, Nathan; Rampersad, Narad 5 2014 New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings. Zbl 1359.68238Blanchet-Sadri, Francine; Bodnar, Michelle; De Winkle, Benjamin 5 2014 Squares in partial words. Zbl 1359.68236Blanchet-Sadri, F.; Jiao, Yang; Machacek, John M.; Quigley, J. D.; Zhang, Xufan 5 2014 Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\). Zbl 1285.68128Blanchet-Sadri, F.; Currie, James D.; Rampersad, Narad; Fox, Nathan 4 2014 Abelian pattern avoidance in partial words. Zbl 1297.68190Blanchet-Sadri, F.; De Winkle, Benjamin; Simmons, Sean 3 2014 Computing depths of patterns. Zbl 1407.68379Blanchet-Sadri, Francine; Lohr, Andrew; Simmons, Sean; Woodhouse, Brent 1 2014 Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. Zbl 1307.68059Blanchet-Sadri, Francine; Simmons, Sean; Tebbe, Amelia; Veprauskas, Amy 7 2013 Computing the partial word avoidability indices of binary patterns. Zbl 1334.68166Blanchet-Sadri, F.; Lohr, Andrew; Scott, Shane 4 2013 Strict bounds for pattern avoidance. Zbl 1301.68209Blanchet-Sadri, F.; Woodhouse, Brent 4 2013 Strict bounds for pattern avoidance. Zbl 1381.68229Blanchet-Sadri, Francine; Woodhouse, Brent 3 2013 Suffix trees for partial words and the longest common compatible prefix problem. Zbl 1377.68326Blanchet-Sadri, Francine; Lazarow, Justin 3 2013 Deciding representability of sets of words of equal length in polynomial time. Zbl 1407.68380Blanchet-Sadri, Francine; Munteanu, Sinziana 2 2013 On the asymptotic abelian complexity of morphic words. Zbl 1381.68228Blanchet-Sadri, Francine; Fox, Nathan 2 2013 A graph polynomial approach to primitivity. Zbl 1377.68190Blanchet-Sadri, Francine; Bodnar, Michelle; Fox, Nathan; Hidakatsu, Joe 2 2013 Deciding representability of sets of words of equal length. Zbl 1293.68158Blanchet-Sadri, F.; Simmons, Sean 2 2013 Computing the partial word avoidability indices of ternary patterns. Zbl 1334.68167Blanchet-Sadri, F.; Lohr, Andrew; Scott, Shane 1 2013 Partial word DFAs. Zbl 1298.68123Balkanski, Eric; Blanchet-Sadri, F.; Kilgore, Matthew; Wyatt, B. J. 1 2013 Algorithmic combinatorics on partial words. Zbl 1266.68145Blanchet-Sadri, F. 7 2012 Avoiding Abelian squares in partial words. Zbl 1233.68183Blanchet-Sadri, F.; Kim, Jane I.; Mercaş, Robert; Severa, William; Simmons, Sean; Xu, Dimin 5 2012 Periodicity algorithms and a conjecture on overlaps in partial words. Zbl 1250.68216Blanchet-Sadri, F.; Mercaş, Robert; Rashin, Abraham; Willett, Elara 4 2012 Computing the partial word avoidability indices of ternary patterns. Zbl 1293.68208Blanchet-Sadri, Francine; Lohr, Andrew; Scott, Shane 3 2012 Abelian repetitions in partial words. Zbl 1231.68187Blanchet-Sadri, F.; Simmons, Sean; Xu, Dimin 3 2012 Erratum to: “Avoidable binary patterns in partial words”. Zbl 1234.68196Blanchet-Sadri, F.; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric 2 2012 Periods in partial words: an algorithm. Zbl 1279.68279Blanchet-Sadri, F.; Mandel, Travis; Sisodia, Gautam 1 2012 Squares in binary partial words. Zbl 1370.68240Blanchet-Sadri, Francine; Jiao, Yang; Machacek, John M. 1 2012 Abelian pattern avoidance in partial words. Zbl 1365.68361Blanchet-Sadri, Francine; Simmons, Sean 1 2012 Constructing partial words with subword complexities not achievable by full words. Zbl 1244.68063Blanchet-Sadri, F.; Chakarov, Aleksandar; Manuelli, Lucas; Schwartz, Jarett; Stich, Slater 1 2012 The three-squares lemma for partial words with one hole. Zbl 1250.68215Blanchet-Sadri, F.; Mercaş, Robert 1 2012 Avoidable binary patterns in partial words. Zbl 1243.68230Blanchet-Sadri, F.; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric 7 2011 Unary pattern avoidance in partial words dense with holes. Zbl 1330.68232Blanchet-Sadri, Francine; Black, Kevin; Zemke, Andrew 5 2011 Counting bordered partial words by critical positions. Zbl 1221.68174Allen, Emily; Blanchet-Sadri, F.; Byrum, Cameron; Cucuringu, Mihai; Mercaş, Robert 3 2011 On minimal Sturmian partial words. Zbl 1217.68165Blanchet-Sadri, F.; Lensmire, John 3 2011 Periods in partial words: an algorithm. Zbl 1314.68247Blanchet-Sadri, Francine; Mandel, Travis; Sisodia, Gautam 2 2011 Avoiding abelian powers in partial words. Zbl 1221.68177Blanchet-Sadri, Francine; Simmons, Sean 2 2011 Classifying all avoidable sets of partial words of size two. Zbl 1228.68041Blanchet-Sadri, Francine; Blakeley, Brandon; Gunter, Josh; Simmons, Sean; Weissenstein, Eric 2 2011 Minimum number of holes in unavoidable sets of partial words of size three. Zbl 1232.68096Blanchet-Sadri, Francine; Chen, Bob; Chakarov, Aleksandar 2 2011 Recurrent partial words. Zbl 1331.68164Blanchet-Sadri, Francine; Chakarov, Aleksandar; Manuelli, Lucas; Schwartz, Jarett; Stich, Slater 1 2011 On minimal Sturmian partial words. Zbl 1230.68123Blanchet-Sadri, Francine; Lensmire, John 1 2011 Fine and Wilf’s theorem for partial words with arbitrarily many weak periods. Zbl 1213.68354Blanchet-Sadri, F.; Oey, Taktin; Rankin, Timothy D. 4 2010 On the complexity of deciding avoidability of sets of partial words. Zbl 1208.68164Blakeley, Brandon; Blanchet-Sadri, F.; Gunter, Josh; Rampersad, Narad 3 2010 Border correlations of partial words. Zbl 1205.68273Blanchet-Sadri, F.; Clader, E.; Simpson, O. 2 2010 Combinatorics on partial word correlations. Zbl 1218.05006Blanchet-Sadri, F.; Fowler, Justin; Gafni, Joshua D.; Wilson, Kevin H. 2 2010 Binary de Bruijn partial words with one hole. Zbl 1284.68482Blanchet-Sadri, Francine; Schwartz, Jarett; Stich, Slater; Wyatt, Benjamin J. 2 2010 Abelian square-free partial words. Zbl 1284.68480Blanchet-Sadri, Francine; Kim, Jane I.; Mercaş, Robert; Severa, William; Simmons, Sean 2 2010 Counting primitive partial words. Zbl 1345.68245Blanchet-Sadri, Francine; Cucuringu, Mihai 1 2010 Avoidable binary patterns in partial words. Zbl 1284.68481Blanchet-Sadri, Francine; Mercaş, Robert; Simmons, Sean; Weissenstein, Eric 1 2010 A generalization of Thue freeness for partial words. Zbl 1162.68029Blanchet-Sadri, F.; Mercaş, Robert; Scott, Geoffrey 10 2009 Counting distinct squares in partial words. Zbl 1199.68199Blanchet-Sadri, F.; Mercas, Robert; Scott, Geoffrey 8 2009 Unavoidable sets of partial words. Zbl 1187.68358Blanchet-Sadri, F.; Brownstein, N. C.; Kalcic, Andy; Palumbo, Justin; Weyand, T. 8 2009 A note on the number of squares in a partial word with one hole. Zbl 1192.68496Blanchet-Sadri, Francine; Mercaş, Robert 7 2009 Testing avoidability on sets of partial words is hard. Zbl 1162.68028Blanchet-Sadri, F.; Jungers, Raphaël M.; Palumbo, Justin 6 2009 Unbordered partial words. Zbl 1187.68289Blanchet-Sadri, F.; Davis, C. D.; Dodge, Joel; Mercaş, Robert; Moorefield, Margaret 4 2009 An answer to a conjecture on overlaps in partial words using periodicity algorithms. Zbl 1234.68197Blanchet-Sadri, Francine; Mercaş, Robert; Rashin, Abraham; Willett, Elara 3 2009 Equations on partial words. Zbl 1170.68032Blanchet-Sadri, Francine; Blair, D. Dakota; Lewis, Rebeca V. 3 2009 On the complexity of deciding avoidability of sets of partial words. Zbl 1247.68126Blakeley, Brandon; Blanchet-Sadri, Francine; Gunter, Josh; Rampersad, Narad 2 2009 How many holes can an unbordered partial word contain? Zbl 1234.68327Blanchet-Sadri, Francine; Allen, Emily; Byrum, Cameron; Mercaş, Robert 1 2009 Algorithmic combinatorics on partial words. Zbl 1180.68205Blanchet-Sadri, Francine 50 2008 Graph connectivity, partial words, and a theorem of Fine and Wilf. Zbl 1146.68408Blanchet-Sadri, F.; Bal, Deepak; Sisodia, Gautam 5 2008 Open problems on partial words. Zbl 1156.68510Blanchet-Sadri, Francine 3 2008 Testing primitivity on partial words. Zbl 1108.68093Blanchet-Sadri, F.; Anavekar, Arundhati R. 5 2007 Partial words and the critical factorization theorem revisited. Zbl 1124.68086Blanchet-Sadri, F.; Wetzler, Nathan D. 4 2007 Correlations of partial words. Zbl 1186.68344Blanchet-Sadri, Francine; Gafni, Joshua D.; Wilson, Kevin H. 3 2007 Two element unavoidable sets of partial words. Zbl 1202.68294Blanchet-Sadri, F.; Brownstein, N. C.; Palumbo, Justin 2 2007 Equations on partial words. Zbl 1132.68513Blanchet-Sadri, F.; Blair, D. Dakota; Lewis, Rebeca V. 2 2006 Primitive partial words. Zbl 1101.68643Blanchet-Sadri, F. 12 2005 Partial words and the critical factorization theorem. Zbl 1073.68067Blanchet-Sadri, F.; Duncan, S. 11 2005 Algorithms for approximate \(k\)-covering of strings. Zbl 1105.68028Zhang, Lili; Blanchet-Sadri, F. 1 2005 Periodicity on partial words. Zbl 1068.68110Blanchet-Sadri, F. 17 2004 Codes, orderings, and partial words. Zbl 1086.68108Blanchet-Sadri, F. 13 2004 Local periods and binary partial words: an algorithm. Zbl 1070.68061Blanchet-Sadri, F.; Chriscoe, Ajay 13 2004 A periodicity result of partial words with one hole. Zbl 1074.68046Blanchet-Sadri, F. 7 2003 Partial words and a theorem of Fine and Wilf revisited. Zbl 0988.68142Blanchet-Sadri, F.; Hegstrom, Robert A. 28 2002 Conjugacy on partial words. Zbl 1061.68123Blanchet-Sadri, F.; Luhmann, D. K. 11 2002 Note on decipherability of three-word codes. Zbl 1004.94014Blanchet-Sadri, F.; Howell, T. 2 2002 On unique, multiset, and set decipherability of three-word codes. Zbl 0998.94039Blanchet-Sadri, F. 3 2001 Multiset and set decipherable codes. Zbl 0989.94034Blanchet-Sadri, F.; Morgan, C. 3 2001 Trees, congruences and varieties of finite semigroups. Zbl 0906.68090Blanchet-Sadri, F. 1 1998 On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups. Zbl 0889.68089Blanchet-Sadri, F. 1 1997 Inclusion relations between some congruences related to the dot-depth hierarchy. Zbl 0854.68051Blanchet-Sadri, F. 2 1996 On semidirect and two-sided semidirect products of finite \(\mathcal J\)-trivial monoids. Zbl 0906.20039Blanchet-Sadri, F. 1 1996 Some logical characterizations of the dot-depth hierarchy and applications. Zbl 0831.68066Blanchet-Sadri, F. 8 1995 Equations on the semidirect product of a finite semilattice by a \(J\)- trivial monoid of height \(k\). Zbl 0833.68073Blanchet-Sadri, F. 4 1995 Equations and monoid varieties of dot-depth one and two. Zbl 0801.68105Blanchet-Sadri, F. 13 1994 On a complete set of generators for dot-depth two. Zbl 0793.68087Blanchet-Sadri, F. 7 1994 Equations on the semidirect product of a finite semilattice by a finite commutative monoid. Zbl 0816.20052Blanchet-Sadri, F.; Zhang, Xin-Hong 2 1994 Equations and dot-depth one. Zbl 0814.20048Blanchet-Sadri, F. 11 1993 Games, equations and dot-depth two monoids. Zbl 0791.20068Blanchet-Sadri, F. 8 1992 The dot-depth of a generating class of aperiodic monoids is computable. Zbl 0776.68087Blanchet-Sadri, F. 3 1992 On dot-depth two. Zbl 0718.68046Blanchet-Sadri, F. 10 1990 Games, equations and the dot-depth hierarchy. Zbl 0682.03015Blanchet-Sadri, F. 14 1989 all cited Publications top 5 cited Publications all top 5 Cited by 225 Authors 69 Blanchet-Sadri, Francine 14 Mercaş, Robert George 8 Kärki, Tomi 8 Kociumaka, Tomasz 8 Radoszewski, Jakub 8 Rytter, Wojciech 7 Harju, Tero 7 Smyth, William F. 7 Waleń, Tomasz 6 Crochemore, Maxime 6 Halava, Vesa 6 Iliopoulos, Costas S. 4 Lohr, Andrew 4 Rampersad, Narad 4 Simmons, Sean 3 Bodnar, Michelle 3 Chakarov, Aleksandar 3 Chen, Bob 3 Christodoulakis, Manolis 3 Christou, Michalis 3 Manea, Florin 3 Ochem, Pascal 3 Pin, Jean-Eric 3 Quigley, James D. 3 Rahman, Mohammad Sohel 3 Shur, Arseny M. 3 Weil, Pascal 3 Zhang, Xufan 2 Alatabbi, Ali 2 Allen, Emily 2 Blakeley, Brandon 2 Černý, Anton 2 Currie, James D. 2 Fici, Gabriele 2 Fox, Nathan 2 Gasnikov, Daniil 2 Gawrychowski, Paweł 2 Gunter, Josh 2 Kirsch, Rachel 2 Klíma, Ondřej 2 Lensmire, John 2 Machacek, John M. 2 Munteanu, Sinziana 2 Nikkel, Jordan 2 Pach, Péter Pál 2 Palumbo, Justin 2 Peltomäki, Jarkko 2 Polák, Libor 2 Rashin, Abraham 2 Sapir, Olga B. 2 Scott, Shane 2 Shallit, Jeffrey O. 2 Sisodia, Gautam 2 Volkov, Mikhail Vladimirovich 2 Wang, Shu 2 Willett, Elara 2 Xu, Dimin 2 Zhang, Wen Ting 1 Adjeroh, Don A. 1 Adjeroh, Donald A. 1 Alazemi, Hamed M. K. 1 Amir, Amihood 1 Amit, Mika 1 Anavekar, Arundhati R. 1 Apostolico, Alberto 1 Artamonov, Vyacheslav Aleksandrovich 1 Ashikhmin, D. N. 1 Azer, Erfan Sadeqi 1 Badkobeh, Golnaz 1 Bal, Deepak 1 Balkanski, Eric 1 Beal, Richard 1 Bell, Paul C. 1 Blair, D. Dakota 1 Bollobás, Béla 1 Bowers, Brian 1 Branco, Mário J. J. 1 Bromberg, Luba 1 Brownstein, Naomi C. 1 Byrum, Cameron 1 Charalampopoulos, Panagiotis 1 Chen, Herman Z. Q. 1 Chen, Jin 1 Chernova, Alëna Alekseevich 1 Choi, Ilkyoo 1 Chriscoe, Ajay 1 Cicalese, Ferdinando 1 Clader, Emily 1 Constantinescu, Sorin 1 Cooper, Joshua N. 1 Corcoran, Kevin 1 Cordier, Michelle 1 Dassow, Jürgen 1 Davis, C. D. 1 De Winkle, Benjamin 1 Dekking, Frederik Michel 1 Dodge, Joel 1 Dolinka, Igor 1 Dubey, Maneesh Kumar 1 Duncan, S. ...and 125 more Authors all top 5 Cited in 35 Serials 48 Theoretical Computer Science 15 Discrete Applied Mathematics 9 Semigroup Forum 9 International Journal of Foundations of Computer Science 9 Journal of Discrete Algorithms 5 Theory of Computing Systems 5 RAIRO. Theoretical Informatics and Applications 4 Information Processing Letters 4 Journal of Combinatorial Theory. Series A 4 European Journal of Combinatorics 4 Advances in Applied Mathematics 4 Information and Computation 4 RAIRO. Informatique Théorique et Applications 3 Computers & Mathematics with Applications 3 RAIRO. Theoretical Informatics and Applications 2 Journal of Computer and System Sciences 2 International Journal of Algebra and Computation 2 The Electronic Journal of Combinatorics 1 Acta Informatica 1 American Mathematical Monthly 1 Algebra Universalis 1 Annales Universitatis Mariae Curie-Skłodowska. Sectio A. Mathematica 1 Demonstratio Mathematica 1 Information Sciences 1 Journal of Number Theory 1 Algorithmica 1 Indagationes Mathematicae. New Series 1 Soft Computing 1 Journal of Combinatorial Optimization 1 Journal of Integer Sequences 1 Journal of Applied Mathematics and Computing 1 Contributions to Discrete Mathematics 1 Online Journal of Analytic Combinatorics 1 Computational & Mathematical Methods in Medicine 1 Izvestiya Instituta Matematiki i Informatiki. Udmurtskiĭ Gosudarstvennyĭ Universitet all top 5 Cited in 14 Fields 151 Computer science (68-XX) 22 Combinatorics (05-XX) 17 Group theory and generalizations (20-XX) 7 Number theory (11-XX) 5 Mathematical logic and foundations (03-XX) 5 General algebraic systems (08-XX) 4 Information and communication theory, circuits (94-XX) 3 Biology and other natural sciences (92-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Commutative algebra (13-XX) 1 General topology (54-XX) 1 Mechanics of deformable solids (74-XX) 1 Fluid mechanics (76-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Citations by Year