 |
| |  |
| |  |
| |  |
"Algorithmic Combinatorics on Partial Words" by Francine Blanchet-Sadri, Chapman&Hall/CRC Press 2008.
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.
Photo Album week 1 week 2 week 3 week 4 week 5 week 6 week 7 week 8
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 guest speaker Dr. Peter J. Humphries, team meetings, technical writing Week 6 T-shirt design, team meetings, technical writing Week 7 Beamer tutorial, team meetings, technical writing Week 8 final student presentations, team meetings, technical writing
Nathan Fox 
Sinziana Munteanu 
Benjamin Wyatt
Eric Balkanski
Carnegie Mellon University
Michelle Bodnar
University of Michigan - Ann Arbor
Bernadette Bucher
University of Alabama
Ian Coley
Northwestern University
Benjamin De Winkle
Pomona College
Joe Hidakatsu
University of Michigan - Ann Arbor
Matthew Kilgore
Lehigh University
Justin Lazarow
The University of Texas at Austin
Andrew Lohr
University of Maryland - College Park
Katie McKeon
University of Nebraska - Lincoln
Jordan Nikkel
Vanderbilt University
Brent Woodhouse
Purdue University
Papers and Websites
- F. Blanchet-Sadri, Eric Balkanski, Matthew Kilgore and Benjamin Wyatt, “Partial Languages.”
- F. Blanchet-Sadri, Michelle Bodnar, Nathan Fox and Joe Hidakatsu, “A Graph Polynomial Approach to Primitivity.” In A.-H. Dediu, C. Martin-Vide and B. Truthe (Eds.), LATA 2013, 7th International Conference on Language and Automata Theory and Applications, April 2-5, 2013, Bilbao, Spain, Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, 2013, to appear.
- F. Blanchet-Sadri, Bernadette Bucher and Nathan Fox, “Abelian Complexity of Partial Words.”
- F. Blanchet-Sadri, Ian Coley and Benjamin De Winkle, “Abelian Patterns in Partial Words.”
- F. Blanchet-Sadri and Jordan Nikkel, “Computing Primitively-Rooted Squares and Runs in Partial Words.”
- F. Blanchet-Sadri and Justin Lazarow, “Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.” In A.-H. Dediu, C. Martin-Vide and B. Truthe (Eds.), LATA 2013, 7th International Conference on Language and Automata Theory and Applications, April 2-5, 2013, Bilbao, Spain, Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, 2013, to appear.
- F. Blanchet-Sadri, Andrew Lohr and Brent Woodhouse, “Patterns in Partial Words.”
- F. Blanchet-Sadri, Katie McKeon and Sinziana Munteanu, “Subwords in Partial Words.”
Presentations
Justin Lazarow, “Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem,” LATA 2013, 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, April 2-5, 2013 (joint work with F. Blanchet-Sadri). Michelle Bodnar, “A Graph Theoretical Approach to Primitivity,” LATA 2013, 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, April 2-5, 2013 (joint work with F. Blanchet-Sadri, Nathan Fox and Joe Hidakatsu).
Program T-shirt
