 |
| |  |
| |  |
| |  |
"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 team meetings, technical writing Week 5 initial student presentations, team meetings, technical writing Week 6 team meetings, technical writing, T-shirt design Week 7 Beamer tutorial, team meetings, technical writing Week 8 team meetings, technical writing, final student presentations
Aleksandar Chakarov 
John Lensmire 
Amelia Tebbe
Derek Allums
Texas A&M University
Kevin Black
Harvey Mudd College
Laure Flapan
Yale University
Steven Ji
Massachusetts Institute of Technology
Lucas Manuelli
Princeton University
Sarah Nelson
Bryn Mawr College
Elizabeth Reiland
Harvey Mudd College
Sean Simmons
The University of Texas at Austin
Stephen Watkins
Vanderbilt University
Dimin Xu
Bard College
Andrew Zemke
Rochester Institute of Technology
Papers and Websites
- F. Blanchet-Sadri and John Lensmire, “On minimal Sturmian partial words.” In C. Durr and T. Schwentick (Eds.), STACS 2011, 28th International Symposium on Theoretical Aspects of Computer Science, March 10-12, 2011, Dortmund, Germany, LIPIcs 9 Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, 2011, pp 225-236 (expanded version in Discrete Applied Mathematics, Vol. 159, No. 8, 2011, pp 733-745).
- F. Blanchet-Sadri, Derek Allums, John Lensmire, Jarett Schwartz, Slater Stich, and Benjamin Wyatt “De Bruijn partial words.”
- F. Blanchet-Sadri, Kevin Black, and Andrew Zemke “Unary pattern avoidance in partial words dense with holes.” In A.-H. Dediu, S. Inenaga and C. Martin-Vide, LATA 2011, 5th International Conference in Language and Automata Theory and Applications, May 26-31, 2011, Tarragona, Spain, Lecture Notes in Computer Science, Vol. 6638, Springer-Verlag, Berlin, Heidelberg, 2011, pp 155-166.
- F. Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, and Slater Stich “Constructing Partial Words with Subword Complexities not Achievable by Full Words.” Theoretical Computer Science, Vol. 432, 2012, pp 21-27.
- F. Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, and Slater Stich “Recurrent partial words.” In P. Ambroz, S. Holub and Z. Masakova (Eds.), WORDS 2011, 8th International Conference on Words, September 12-16, 2011, Prague, Czech Republic, Electronic Proceedings of Theoretical Computer Science, Vol. 63, 2011, pp 71-82.
- F. Blanchet-Sadri, Laure Flappan, and Stephen Watkins “Minimum number of holes in unavoidable sets of partial words.”
- F. Blanchet-Sadri, Steven Ji, and Elizabeth Reiland “Number of holes in unavoidable sets of partial words II.” Journal of Discrete Algorithms, Vol. 14, 2012, pp 65-73.
- F. Blanchet-Sadri, Jane Kim, Robert Mercas, William Severa, Sean Simmons and Dimin Xu “Avoiding abelian squares in partial words.” Journal of Combinatorial Theory, Series A, Vol. 119, 2012, pp 257-270.
- F. Blanchet-Sadri, “Open problems on avoidable patterns in partial words.” In P. Domosi and Sz. Ivan (Eds.), AFL 2011, 13th International Conference on Automata and Formal Languages, August 17-22, 2011, Debrecen, Hungary, Proceedings, pp 12-24.
- F. Blanchet-Sadri, Sarah Nelson, and Amelia Tebbe “On operations preserving primitivity of partial words with one hole.” In P. Domosi and Sz. Ivan (Eds.), AFL 2011, 13th International Conference on Automata and Formal Languages, August 17-22, 2011, Debrecen, Hungary, Proceedings, pp 93-107.
- F. Blanchet-Sadri, Sean Simmons, and Dimin Xu “Abelian repetitions in partial words.” Advances in Applied Mathematics, Vol. 48, 2012, pp 194-214.
- F. Blanchet-Sadri and Sean Simmons “Pattern avoidance in partial words.”
- F. Blanchet-Sadri and Sean Simmons “Avoiding abelian powers in partial words.” In G. Mauri and A. Leporati (Eds.), DLT 2011, 15th International Conference on Developments in Language Theory, July 19-22, 2011, Milano, Italy, Lecture Notes in Computer Science, Vol. 6795, Springer-Verlag, Berlin, Heidelberg, 2011, pp 70-81.
Honors
- Sean Simmons won a Graduate Research Fellowship from the National Science Foundation in 2011.
- Amelia Tebbe won a Graduate Research Fellowship from the National Science Foundation in 2011.
- Laure Flapan won a Graduate Research Fellowship from the National Science Foundation in 2012.
- Lucas Manuelli won a Graduate Research Fellowship from the National Science Foundation in 2012.
Presentations
John Lensmire, “On Minimal Sturmian Partial Words,” STACS 2011, 28th International Symposium on Theoretical Aspects of Computer Science, Dortmund, Germany, March 10, 2011 (joint work with F. Blanchet-Sadri). John Lensmire presenting the paper entitled “On minimal Sturmian partial words,” at the 28th International Symposium on Theoretical Aspects of Computer Science, Dortmund, Germany, March 10, 2011.
Kevin Black, “Unary Pattern Avoidance in Partial Words Dense with Holes,” LATA 2011, 5th International Conference on Language and Automata Theory and Applications, Tarragona, Spain, May 26, 2011 (joint work with F. Blanchet-Sadri and Andrew Zemke). Kevin Black presenting the paper “Unary pattern avoidance in partial words dense with holes,” at the 5th International Conference on Language and Automata Theory and Applications, Tarragona, Spain, May 26, 2011.
From left to right, Kevin Black and Andrew Zemke attending the 5th International Conference on Language and Automata Theory and Applications, Tarragona, Spain, from May 26 to May 31, 2011.
F. Blanchet-Sadri, “Avoiding Abelian Powers in Partial Words,” DLT 2011, 15th International Conference on Developments in Language Theory, Milano, Italy, July 19, 2011 (joint work with Sean Simmons). 
Sarah Nelson, “On Operations Preserving Primitivity of Partial Words with One Hole,” AFL 2011, 13th International Conference on Automata and Formal Languages, Debrecen, Hungary, August 22, 2011 (joint work with F. Blanchet-Sadri and Amelia Tebbe). Sarah Nelson presenting the paper “On operations preserving primitivitiy of partial words with one hole,” at the 13th International Conference on Automata and Formal Languages, Debrecen, Hungary, August 22, 2011.
From left to right, Amelia Tebbe and Sarah Nelson attending the 13th International Conference on Automata and Formal Languages, Debrecen, Hungary, from August 17 to August 22, 2011.
Lucas Manuelli, “Recurrent Partial Words,” WORDS 2011, 8th International Conference on Words, Prague, Czech Republic, September 15, 2011 (joint work with F. Blanchet-Sadri, Aleksandar Chakarov, Jarett Schwartz and Slater Stich). Lucas Manuelli presenting the paper “Recurrent partial words,” at the 8th International Conference on Words, Prague, Czech Republic, September 15, 2011.
From left to right, Lucas Manuelli and Jarett Schwartz attending the 8th International Conference on Words, Prague, Czech Republic, from September 12 to September 16, 2011.
Laure Flapan, “Unavoidable Sets,” SIAM DM12, SIAM Conference on Discrete Mathematics, Halifax, Nova Scotia, Canada, June 20, 2012 (joint work with F. Blanchet-Sadri, Steven Ji, Elizabeth Reiland and Stephen Watkins). Conferences
F. Blanchet-Sadri is on the program committee of the AITC 2010, Advances in the Theory of Computing, Conference track of SYNASC 2010, 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 23-26, 2010. F. Blanchet-Sadri chaired a session for the 5th International Conference on Language and Automata Theory and Applications, Tarragona, Spain, May 26, 2011.
T-shirt designed by the participants of Summer 2010
