Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Sadri, F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the state complexity of partial word DFAs
Eric Balkanski
,
F. Blanchet-Sadri
,
Matthew Kilgore
,
B.J. Wyatt
Theoretical Computer Science
578
, 2015, pp. 2-12
Recurrence in infinite partial words
F. Blanchet-Sadri
,
Bob Chen
,
Sinziana Munteanu
Theoretical Computer Science
524
, 2014, pp. 41-47
Squares in partial words
F. Blanchet-Sadri
,
Yang Jiao
,
John M. Machacek
,
J.D. Quigley
,
Xufan Zhang
Theoretical Computer Science
530
, 2014, pp. 42-57
Abelian-primitive partial words
F. Blanchet-Sadri
,
Nathan Fox
Theoretical Computer Science
485
, 2013, pp. 16-37
Deciding representability of sets of words of equal length
F. Blanchet-Sadri
,
Sean Simmons
Theoretical Computer Science
475
, 2013, pp. 34-46
Strict bounds for pattern avoidance
F. Blanchet-Sadri
,
Brent Woodhouse
Theoretical Computer Science
506
, 2013, pp. 17-28
Constructing partial words with subword complexities not achievable by full words
F. Blanchet-Sadri
,
Aleksandar Chakarov
,
Lucas Manuelli
,
Jarett Schwartz
,
Slater Stich
Theoretical Computer Science
432
, 2012, pp. 21-27
Avoiding Abelian squares in partial words
F. Blanchet-Sadri
,
Jane I. Kim
,
Robert Mercaş
,
William Severa
,
Sean Simmons
,
Dimin Xu
Journal of Combinatorial Theory Series A
119
(1), 2012, pp. 257-270
Periodicity algorithms and a conjecture on overlaps in partial words
F. Blanchet-Sadri
,
Robert Mercaş
,
Abraham Rashin
,
Elara Willett
Theoretical Computer Science
443
, 2012, pp. 35-45
Erratum to ``Avoidable binary patterns in partial words''
F. Blanchet-Sadri
,
Robert Mercaş
,
Sean Simmons
,
Eric Weissenstein
Acta Informatica
49
(1), 2012, pp. 53-54
The three-squares lemma for partial words with one hole
F. Blanchet-Sadri
,
Robert Mercaş
Theoretical Computer Science
428
, 2012, pp. 1-9
Algorithmic combinatorics on partial words
F. Blanchet-Sadri
International Journal of Foundations of Computer Science
23
(6), 2012, pp. 1189-1206
Avoiding large squares in partial words
F. Blanchet-Sadri
,
Ilkyoo Choi
,
Robert Mercaş
Theoretical Computer Science
412
(29), 2011, pp. 3752-3758
Avoidable binary patterns in partial words
F. Blanchet-Sadri
,
Robert Mercaş
,
Sean Simmons
,
Eric Weissenstein
Acta Informatica
48
(1), 2011, pp. 25-41
On the complexity of deciding avoidability of sets of partial words
Brandon Blakeley
,
F. Blanchet-Sadri
,
Josh Gunter
,
Narad Rampersad
Theoretical Computer Science
411
(49), 2010, pp. 4263-4271
Border correlations of partial words
F. Blanchet-Sadri
,
E. Clader
,
O. Simpson
Theory of Computing Systems
47
(1), 2010, pp. 179-195
Combinatorics on partial word correlations
F. Blanchet-Sadri
,
Justin Fowler
,
Joshua D. Gafni
,
Kevin H. Wilson
Journal of Combinatorial Theory Series A
117
(6), 2010, pp. 607-624
Fine and Wilf's theorem for partial words with arbitrarily many weak periods
F. Blanchet-Sadri
,
Taktin Oey
,
Timothy D. Rankin
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 705-722
Unavoidable sets of partial words
F. Blanchet-Sadri
,
N.C. Brownstein
,
Andy Kalcic
,
Justin Palumbo
,
T. Weynand
Theory of Computing Systems
45
(2), 2009, pp. 381-406
Testing avoidability on sets of partial words is hard
F. Blanchet-Sadri
,
Raphaël M. Jungers
,
Justin Palumbo
Theoretical Computer Science
410
(8-10), 2009, pp. 968-972
A generalization of Thue freeness for partial words
F. Blanchet-Sadri
,
Robert Mercaş
,
Geoffrey Scott
Theoretical Computer Science
410
(8-10), 2009, pp. 793-800
Graph connectivity, partial words, and a theorem of Fine and Wilf
F. Blanchet-Sadri
,
Deepak Bal
,
Gautam Sisodia
Information and Computation
206
(5), 2008, pp. 676-693
Remarks on two nonstandard versions of periodicity in words
F. Blanchet-Sadri
,
L. Bromberg
,
K. Zipple
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1439-1448
Periodicity properties on partial words
F. Blanchet-Sadri
,
Kevin Corcoran
,
Jenell Nyberg
Information and Computation
206
(9-10), 2008, pp. 1057-1064
Partial words and the critical factorization theorem revisited
F. Blanchet-Sadri
,
Nathan D. Wetzler
Theoretical Computer Science
385
(1-3), 2007, pp. 179-192
Seiten 1
2
>