
The tutorial Preliminaries on Partial
Words by Dr. Francine BlanchetSadri is available.
The powerpoint presentation entitled Basic
XHTML and CSS by Margaret Moorefield is available.
The LaTeX
Tutorial by Stephanie Rednour and Robert Misior is
available.
For a detailed account of a specific week, click on the week number.
Week 1

orientation, preliminaries on partial words, description of problems,
creation of teams, team meetings, welcome breakfast

Week 2

LaTeX tutorial, basic XHTML and CSS, team meetings, technical writing, dinner 
Week 3 
team meetings, technical writing

Week 4 
guest speaker Brian Shirey, initial student presentations, team meetings, technical writing

Week 5 
team meetings, technical writing 
Week 6 
team meetings, technical writing

Week 7 
A day with Professor Jeffrey Shallit

Week 8 
team meetings, technical writing,
talk on NSF Graduate Research
Fellowship Program,
final student presentations, farewell picnic 

Crystal Davis


Mihai Cucuringu


Deepak Bal
Ohio State UniversityColumbus


Naomi Brownstein
University of Central Florida


Ajay Chriscoe
University of North CarolinaGreensboro


Joshua Gafni
University of Pennsylvania


Taktin Mizutani Oey
Harvard University


Justin Palumbo
Rutgers, The State University of New JerseyNew Brunswick


Timothy Rankin
Davidson College


Gautam Sisodia
The University of Texas at Arlington


Kevin Wilson
University of MichiganAnn Arbor

Books
Book
F. BlanchetSadri,
“Algorithmic Combinatorics on Partial Words,”
Chapman & Hall/CRC Press, 2008.
Book Chapter
F. BlanchetSadri, “Open Problems on Partial Words,” In G. BelEnguix, M.D. JimenezLopez and C. MartinVide
(Eds.), New Developments in Formal Languages and Applications, Ch. 2, Vol. 3, SpringerVerlag, Berlin, Heidelberg, 2008, pp 1158.
Papers and Websites
 F. BlanchetSadri, Deepak Bal and Gautam Sisodia,
“Graph connectivity, partial words, and a theorem of Fine and Wilf,”
Information and Computation, 206 (2008) 676693.

F. BlanchetSadri, N.C. Brownstein and Justin Palumbo,
“Two Element Unavoidable Sets of Partial
Words.”
In T. Harju, J Karhumäki, and A. Lepistö (Eds.): DLT 2007, 11th International Conference on Developments in Language Theory,
July 36, 2007, Turku, Finland,
Lectures Notes in Computer Science, Vol. 4588, SpringerVerlag, Berlin, Heidelberg, 2007, pp 96107.

F. BlanchetSadri and Mihai Cucuringu,
“Counting primitive partial words.”
Journal of Automata, Languages and Combinatorics, Vol. 15, 2010, pp 199227.

F. BlanchetSadri, Joshua Gafni and Kevin Wilson,
“Correlations of partial words.”
In W. Thomas and P. Weil (Eds.),
STACS 2007, 24th International Symposium on Theoretical Aspects of
Computer Science,
February 2224, 2007, Aachen, Germany,
Lecture Notes in Computer Science, Vol. 4393, SpringerVerlag, Berlin, Heidelberg, 2007,
pp 97108.

F. BlanchetSadri, Taktin Oey and Timothy Rankin,
“Computing Weak Periods of Partial Words,”
In E. CsuhajVarju and Z. Esik (Eds.), AFL 2008, 12th International Conference on Automata and Formal Languages,
May 2730, 2008, Balatonfüred, Hungary, Proceedings, pp 134145.

F. BlanchetSadri, Taktin Oey and Timothy Rankin,
“Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods,”
International Journal of Foundations of Computer Science, Vol. 21, No. 5, 2010, pp 705722.

F. BlanchetSadri and Ajay Chriscoe,
“Periods and binary partial words: An algorithm revisited.”

F. BlanchetSadri, Raphael Jungers, and Justin Palumbo,
“Testing avoidability of sets of partial words
is hard,” Theoretical Computer Science, Vol. 410, 2009, pp
968972.
Honors

Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, Portugal, and Forum for Interdisciplinary
Mathematics gratefully acknowledged and honored Professor Francine BlanchetSadri for Outstanding Contributions in
Mathematical Sciences (the award was presented at the SCRA 2006FIM XIII, 13th International Conference of
the Forum for Interdisciplinary Mathematics on Interdisciplinary Mathematical and Statistical Techniques,
New University of LisbonTomar Polytechnic Institute, Tomar, Portugal, September 3, 2006).

Kevin Wilson won a Goldwater Scholarship in 2007.

Kevin Wilson won the Cornwell Prize from the department of Mathematics at
the University of MichiganAnn Arbor
(this prize is given to “a student (graduate or undergraduate) at
the
University of Michigan who shall have demonstrated the greatest
intellectual curiosity and given the most promise of original study and
creative work in Mathematics”).

Mihai Cucuringu was selected for Honorable Mention in the Computing Research Association's Outstanding Undergraduate
Award for 2007.

Naomi Brownstein was selected for Honorable Mention for a Goldwater Scholarship in 2007.

Ajay Chriscoe's paper entitled "Periods and binary partial words: An algorithm.", Theoretical Computer Science,
Vol. 314 (2004) 189216, was nominated for the 2006 Frank and Brennie Morgan AMSMAASIAM Prize for outstanding
research in mathematics by an undergraduate student.

Naomi Brownstein received the “Order of Pegasus” which is the most prestigious and significant award a student can receive while at
UCF. It
recognizes students for outstanding academic achievement, leadership, service, and research.

Naomi Brownstein was selected for Honorable Mention for the
Schafer Prize for 2007.
 Kevin Wilson received a graduate research fellowship from the National
Science Foundation in 2008.
 Naomi Brownstein received a graduate research fellowship from the National
Science Foundation in 2008.
Presentations

F. BlanchetSadri, "Partial Words,"
5th International Ph.D. School in Formal Languages and
Applications, Tarragona, Spain, May 1213, 2006 (10 hours).


F. BlanchetSadri, "Partial Words,"
SCRA 2006FIM XIII,
13th International Conference on Interdisciplinary Mathematical & Statistical
Techniques,
New University of LisbonTomar Polytechnic Institute, Tomar, Portugal, September 2006
(Plenary Talk).


F. BlanchetSadri, "Algorithmic Combinatorics on Words,"
SCRA 2006FIM XIII, 13th
International Conference on Interdisciplinary Mathematical & Statistical Techniques,
New University of LisbonTomar Polytechnic Institute, Tomar, Portugal, September 2006
(Invited Talk for Session on Undergraduate Research in Interdisciplinary Mathematics).


Kevin Wilson,
"Correlations of Partial Words,"
STACS
2007, 24th International Symposium on Theoretical Aspects of
Computer Science,
February 22, 2007, Aachen, Germany (joint work with F. BlanchetSadri and Joshua D. Gafni).

Kevin Wilson presenting the paper entitled “Correlations of Partial Words” at STACS 2007, 24th
International Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22, 2007.


Justin Palumbo,
“Two Element Unavoidable Sets of Partial Words.”
DLT 2007, 11th International Conference on Developments in
Language Theory,
July 3, 2007, Turku, Finland (joint work with F. BlanchetSadri and N.C. Brownstein).

Justin Palumbo presenting the paper entitled “Two Element Unavoidable Sets of Partial Words.” at DLT 2007, 11th International Conference on Developments in
Language Theory, Turku, Finland, July 3, 2007.


Naomi Brownstein,
“Two Element Unavoidable Sets of Partial Words.”
International Conference on Advances in Interdisciplinary
Statistics and Combinatorics,
October 12, 2007, Greensboro, North Carolina (joint work with F. BlanchetSadri and Justin Palumbo).

Naomi Brownstein presenting the paper entitled “Two Element Unavoidable Sets of Partial Words,” at the International Conference
on Advances in Interdisciplinary Statistics and Combinatorics, Greensboro, NC, October 12, 2007.


Naomi Brownstein, “Two Element Unavoidable Sets of Partial Words”, 16th International Conference on Interdisciplinary Mathematical & Statistical
Techniques IMST 2008/FIM XVI, May 1518, 2008, Memphis, Tennessee (joint work with F. BlanchetSadri and Justin Palumbo).

Naomi Brownstein presenting the paper entitled “Two Element Unavoidable Sets of Partial Words” at 16th International Conference on Interdisciplinary Mathematical & Statistical
Techniques IMST 2008/FIM XVI, Memphis, Tennessee, May 2008.


F. BlanchetSadri,
“Computing Weak Periods of Partial Words,”
AFL 2008, 12th International Conference on Automata and Formal Languages,
May 28, 2008, Balatonfured, Hungary (joint work with Taktin Oey and Timothy Rankin).

Conferences
F. BlanchetSadri organized a Session on Semigroups and Languages for the
SCRA 2006FIM XIII, 13th
International Conference on Interdisciplinary Mathematical &
Statistical Techniques, New University of LisbonTomar Polytechnic Institute, Tomar,
Portugal, September 2006.
We attended the FOCS 2006, 47th Annual
IEEE Symposium on Foundations of Computer Science
from October 22 to October 24, 2006 in Berkeley, California.
F. BlanchetSadri was invited to attend the conference "Promoting Undergraduate Research in Mathematics" from
September 28 to September 30, 2006 in Rosemont, Illinois.
F. BlanchetSadri served on the programme committee of LATA 2007, 1st International Conference on Language
and Automata Theory and Applications that was held in Tarragona, Spain, March 29April 4, 2007.
F. BlanchetSadri chaired a session for LATA 2007, 1st International Conference on Language
and Automata Theory and Applications that was held in Tarragona, Spain, March 29, 2007.
Tshirt designed by the participants of Summer 2006
