 |
| |  |
| |  |
| |  |
"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
- Eric Balkanski, F. Blanchet-Sadri, Matthew Kilgore and Benjamin Wyatt, “Partial Word DFAs.” In S. Konstantinidis (Ed.), CIAA 2013, 18th International Conference on Developments in Language Theory, July 16-19, 2013, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, Vol. 7982, Springer-Verlag, Berlin, Heidelberg, 2013, pp 36-47. Received “Best Paper Award” of CIAA 2013.
- 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, Vol. 7810, Springer-Verlag, Berlin, Heidelberg, 2013, pp 153-164.
- F. Blanchet-Sadri, Bernadette Bucher and Nathan Fox, “Abelian Complexity of Partial Words.”
- F. Blanchet-Sadri and Nathan Fox, “On the Asymptotic Abelian Complexity of Morphic Words.” In M.-P. Beal and O. Carton (Eds.), DLT 2013, 17th International Conference on Developments in Language Theory, June 18-21, 2013, Paris-Est, France, Lecture Notes in Computer Science, Vol. 7907, Springer-Verlag, Berlin, Heidelberg, 2013, pp 94-105.
- 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, Vol. 7810, Springer-Verlag, Berlin, Heidelberg, 2013, pp 165-176.
- F. Blanchet-Sadri, Andrew Lohr and Brent Woodhouse, “Computing Depths of Patterns.”
- F. Blanchet-Sadri and Brent Woodhouse, “Strict Bounds for Pattern Avoidance.” In M.-P. Beal and O. Carton (Eds.), DLT 2013, 17th International Conference on Developments in Language Theory, June 18-21, 2013, Paris-Est, France, Lecture Notes in Computer Science, Vol. 7907, Springer-Verlag, Berlin, Heidelberg, 2013, pp 94-105.
- F. Blanchet-Sadri and Katie McKeon, “Subwords in Partial Words.”
- F. Blanchet-Sadri and Sinziana Munteanu, “Deciding Representability of Words of Equal Length in Polynomial Time.” In T. Lecroq and L. Mouchard (Eds.), IWOCA 2013, 24th International Workshop on Combinatorial Algorithms, July 10-12, 2013, Rouen, France, Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, 2013, to appear.
Honors
- Matthew Kilgore has been named a 2013 Goldwater Scholar.
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 5, 2013 (joint work with F. Blanchet-Sadri). Justin Lazarow presenting the paper entitled “Suffix trees for partial words and the longest common compatible prefix problem,” at LATA 2013, 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, April 5, 2013.
Michelle Bodnar, “A Graph Theoretical Approach to Primitivity,” LATA 2013, 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, April 5, 2013 (joint work with F. Blanchet-Sadri, Nathan Fox and Joe Hidakatsu). Michelle Bodnar presenting the paper entitled “A graph polynomial approach to primitivity,” at LATA 2013, 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, April 5, 2013.
From left to right, Justin Lazarow, Michelle Bodnar and Joe Hidakatsu attending LATA 2013, 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, from April 2 to April 5, 2013.
F. Blanchet-Sadri, “Partial Word Representation,” Fields Workshop on Challenges in Combinatorics on Words, Fields Institute, Toronto, Ontario, Canada, April 22, 2013. F. Blanchet-Sadri, “Strict Bounds for Pattern Avoidance,” Fields Workshop on Challenges in Combinatorics on Words, Fields Institute, Toronto, Ontario, Canada, April 25, 2013 (joint work with Brent Woodhouse). 
Brent Woodhouse, “Strict Bounds for Pattern Avoidance,” DLT 2013, 17th International Conference on Developments in Language Theory, Paris-Est, France, June 18, 2013 (joint work with F. Blanchet-Sadri). Brent Woodhouse presenting the paper entitled “Strict Bounds for Pattern Avoidance,” at DLT 2013, 17th International Conference on Developments in Language Theory, Paris-Est, France, June 18, 2013.
Nathan Fox, “On the Asymptotic Abelian Complexity of Morphic Words,” DLT 2013, 17th International Conference on Developments in Language Theory, Paris-Est, France, June 21, 2013 (joint work with F. Blanchet-Sadri). Nathan Fox presenting the paper entitled “On the Asymptotic Abelian Complexity of Morphic Words,” at DLT 2013, 17th International Conference on Developments in Language Theory, Paris-Est, France, June 21, 2013.
From left to right, Nathan Fox and Brent Woodhouse attending DLT 2013, 17th International Conference on Developments in Language Theory, Paris-Est, France, June 20, 2013.
F. Blanchet-Sadri, “Partial Word DFAs,” CIAA 2013, 18th International Conference on Implementation and Application of Automata, Halifax, Nova Scotia, Canada, July 16, 2013 (joint work with Eric Balkanski, Matthew Kilgore and B. J. Wyatt). From left to right, Dr. Stavros Konstantinidis and Eric Balkanski at CIAA 2013, 18th International Conference on Implementation and Application of Automata, Halifax, Nova Scotia, Canada (the paper entitled “Partial Word DFAs” co-authored with Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, and Benjamin Wyatt was awarded “BEST PAPER AWARD of CIAA 2013” on July 19, 2013).
Eric Balkanski attending CIAA 2013, 18th International Conference on Implementation and Application of Automata, Halifax, Nova Scotia, Canada, July 18, 2013.
Sinziana Munteanu, “Deciding Representability of Sets of Words of Equal Length in Polynomial Time,” IWOCA 2013, 24th International Workshop on Combinatorial Algorithms, Rouen, France, July 10, 2013 (joint work with F. Blanchet-Sadri). Sinziana Munteanu presenting the paper entitled “Deciding Representability of Words of Equal Length in Polynomial Time,” at IWOCA 2013, 24th International Workshop on Combinatorial Algorithms, Rouen, France, July 10, 2013.
Sinziana Munteanu attending IWOCA 2013, 24th International Workshop on Combinatorial Algorithms, Rouen, France, July 10-12, 2013.
Conferences
F. Blanchet-Sadri chaired a session for the 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, April 2, 2013.
F. Blanchet-Sadri was invited to be a participant in the "Fields Workshop on Challenges in Combinatorics on Words" that was held at the Fields Institute, Toronto, Canada from April 22 to April 26, 2013.
Program T-shirt
