|
The Summer 2007 program announcement is available
online in pdf format.
The tutorial Preliminaries on Partial
Words by Dr. Francine Blanchet-Sadri 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.
The Beamer
Tutorial by Charles T. Batts is
available.

This schedule is updated regularly so please visit frequently for the most current
information.
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, technical writing
|
|
Week 2
|
LaTeX tutorial, team meetings, technical writing |
| Week 3 |
basic XHTML and CSS, team meetings, technical writing
|
| Week 4 |
initial student presentations, team meetings, technical writing
|
| Week 5 |
team meetings, technical writing
|
| Week 6 |
team meetings, technical writing
|
| Week 7 |
Beamer tutorial, team meetings, technical writing
|
| Week 8 |
team meetings, technical writing,
final student presentations |
|
Robert Mercas
|
|
Gautam Sisodia
|
|
Lisa Bromberg
New College of Florida
|
|
Emily Clader
Columbia University-Columbia College
|
|
Justin Fowler
North Carolina State University
|
|
Gary Gramajo
Florida State University
|
|
Andy Kalcic
Franklin W. Olin College of Engineering
|
|
Travis Mandel
Tulane University
|
|
Geoffrey Scott
Dartmouth College
|
|
Olivia Simpson
University of Massachusetts-Amherst
|
|
Tracy Weyand
University of Central Florida
|
|
Karl Zipple
Northwestern University
|
Papers and Websites
- F. Blanchet-Sadri, L. Bromberg and Karl Zipple,
“"Remarks on Two Nonstandard Versions of Periodicity in Words,”
International Journal of Foundations of Computer Science, to appear.
-
F. Blanchet-Sadri, E. Clader and O. Simpson,
“Border Correlations of Partial Words.”
-
F. Blanchet-Sadri, Justin Fowler and Gary Gramajo,
“Combinatorics on Partial Word Correlations.”
-
F. Blanchet-Sadri, N.C. Brownstein, A. Kalcic, J. Palumbo and T. Weyand,
“Unavoidable Sets of Partial Words,” Theory of Computing Systems,
to appear.
-
F. Blanchet-Sadri, Travis Mandel and Gautam Sisodia,
“Connectivity in Graphs Associated with Partial Words.”
-
F. Blanchet-Sadri, Robert Mercas and Geoffrey Scott,
“A generalization of Thue Freeness for Partial Words.”
-
F. Blanchet-Sadri, Robert Mercas and Geoffrey Scott,
“Counting Distinct Squares in Partial Words,”
AFL 2008, 12th International Conference on Automata and Formal Languages,
May 27-30, 2008, Balatonfured, Hungary, to appear.
-
F. Blanchet-Sadri, Raphael Jungers, and Justin Palumbo,
“Testing avoidability of sets of partial words is hard.”
Presentations
|
F. Blanchet-Sadri, “Partial Words,” 6th International Summer School in Formal Languages and Applications,
Tarragona, Spain, July 28--August 2, 2008
|
|
F. Blanchet-Sadri, “Periods, Partial Words, and a Result of Guibas and Odlyzko,”
SIAM Conference on Discrete Mathematics, Burlington, Vermont, June 19, 2008 (joint work with
Brian Shirey).
|
|
Geoffrey Scott,
“Counting Distinct Squares in Partial Words,”
AFL 2008, 12th International Conference on Automata and Formal Languages,
May 27--30, 2008, Balatonfured, Hungary (joint work with F. Blanchet-Sadri and Robert Mercacs).
|
Conferences
|
F. Blanchet-Sadri has been invited for a visit at the University of Debrecen, Debrecen, Hungary, May 2008.
|
|