Summer 2013
                                        June 3 - July 27, 2013




Project Home
Application
Resources
Contact Information
UNCG Campus and Greensboro,
        NC Information
Summer 2005 Information
Summer 2006 Information
Summer 2007 Information
Summer 2008 Information
Summer 2009 Information
Summer 2010 Information
Summer 2011 Information
Summer 2012 Information
Summer 2014 Information Summer 2015 Information Summer 2016 Information
Schedule | Research Assistants | Student Participants | Research



"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


Schedule

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 T-shirt design, team meetings, technical writing
Week 7 Beamer tutorial, team meetings, technical writing
Week 8 final student presentations, team meetings, technical writing

Return to Menu



Research Assistants
Michelle Bodnar Michelle Bodnar
Benjamin De Winkle Benjamin De Winkle
Andrew Lohr Andrew Lohr

Return to Menu



Student Participants
Joey Becker Joey Becker
University of Nebraska–Lincoln
Elizabeth Grace Elizabeth Campolongo
NYU Gallatin
Kira Goldner Kira Goldner
Oberlin College
Kenneth Hawes Kenneth Hawes
University of Virginia
Mark Heimann Mark Heimann
Washington University in St. Louis
JD Quigley JD Quigley
University of Illinois at Urbana-Champaign
Daniel Seita Daniel Seita
Williams College
Aidan Shackleton Aidan Shackleton
Swarthmore College
Jim Tao Jim Tao
Princeton University
David Wise David Wise
Carnegie Mellon University
Xufan Zhang Xufan Zhang
Princeton University

Return to Menu



Research

    Papers and Websites

  1. Joey Becker, F. Blanchet-Sadri, and Jim Tao Unavoidable Sets and Patterns

  2. F. Blanchet-Sadri, Michelle Bodnar, and Benjamin De Winkle New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings In E. W. Mayr and N. Portier (Eds.), STACS 2014, 31st International Symposium on Theoretical Aspects of Computer Science, March 5-8, 2014, Lyon, France, LIPIcs Schloss Dagstuhl-Leinniz-Zentrum fur Informatik, Vol. 25, 2014, pp 162-173.

  3. F. Blanchet-Sadri, Elizabeth Campolongo, and Kenneth Hawes Abelian Patterns in Partial Words

  4. F. Blanchet-Sadri, Kira Goldner, and Aidan Shackleton Minimal Partial Languages and Automata In M. Holzer and M. Kutrib (Eds.), CIAA 2014, 19th International Conference on Implementation and Application of Automata, July 30-August 2, 2014, Giessen, Germany, Lecture Notes in Computer Science, Vol. 8587, Springer International Publishing Switzerland 2014, pp 110-123.

  5. F. Blanchet-Sadri, Mark Heimann, and Andrew Lohr Subwords of Partial Words

  6. F. Blanchet-Sadri, Yang Jiao, John Machacek, J.D. Quigley, and Xufan Zhang Squares in Partial Words Theoretical Computer Science, Vol. 530, 2014, pp 42-57.

  7. F. Blanchet-Sadri and Andrew Lohr Computing Minimum Length Representations of Sets of Words of Uniform Length In J. Kratochvil and M. Miller (Eds.), IWOCA 2014, 25th International Workshop on Combinatorial Algorithms, October 15-17, 2014, Duluth, Minnesota, Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, to appear.

  8. F. Blanchet-Sadri, Michelle Bodnar, Jordan Nikkel, J. D. Quigley and Xufan Zhang Squares and Primitivity in Partial Words Discrete Applied Mathematics, to appear.

  9. F. Blanchet-Sadri, Daniel Seita, and David Wise Abelian Complexity of Morphic Words

    Presentations

France Benjamin De Winkle, “New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings,” STACS 2014, 31st International Symposium on Theoretical Aspects of Computer Science, Lyon, France, March 5-8, 2014 (joint work with F. Blanchet-Sadri and Michelle Bodnar).

Benjamin De Winkle presenting at STACS 2014.

Benjamin De Winkle presenting the paper entitled “New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings,” at STACS 2014, 31st International Symposium on Theoretical Aspects of Computer Science Lyon, France, March 5-8, 2014

Benjamin De Winkle attending STACS 2014.

Benjamin De Winkle attending STACS 2014, 31st International Symposium on Theoretical Aspects of Computer Science Lyon, France, March 5-8, 2014

United States Jim Tao, “Pattern Occurrence Statistics and Applications to the Ramsey Theory of Unavoidable Patterns,” DM 2014, SIAM Conference on Discrete Mathematics, Minneapolis, Minnesota, June 16-19, 2014 (joint work with F. Blanchet-Sadri).

Jim Tao presenting at SIAM DM 2014

Jim Tao presenting, "Pattern Occurrence Statistics and Applications to the Ramsey Theory of Unavoidable Patterns," at DM 2014, SIAM Conference on Discrete Mathematics in Minneapolis, Minnesota, June 16-19, 2014

Jim Tao attending SIAM DM 2014

Jim Tao attending DM 2014, SIAM Conference on Discrete Mathematics in Minneapolis, Minnesota, June 16-19, 2014
Germany Kira Goldner, “Minimal Partial Languages and Automata,” CIAA 2014, 19th International Conference on Implementation and Application of Automata, Giessen, Germany, July 30-August 2, 2014 (joint work with F. Blanchet-Sadri and Aidan Shackleton).

Kira Goldner presenting at CIAA 2014, 19th International Conference on Implementation and Application of Automata

Kira Goldner presenting "Minimal Partial Languages and Automata" at the International Conference on Implementation and Application of Automata in Giessen, Germany, July 30-August 2, 2014

Kira Goldner attending CIAA 2014

Kira Goldner attending the International Conference on Implementation and Application of Automata in Giessen, Germany, July 30-August 2, 2014
United States F. Blanchet-Sadri, “Computing Minimum Langth Representations of Sets of Words of Uniform Length,” IWOCA 2014, 25th International Workshop on Combinatorial Algorithms, Duluth, Minnesota, October 15-17, 2014 (joint work with Andrew Lohr).
United States F. Blanchet-Sadri, “Computing Primitively-Rooted Squares and Runs in Partial Words,” IWOCA 2014, 25th International Workshop on Combinatorial Algorithms, Duluth, Minnesota, October 15-17, 2014 (joint work with Jordan Nikkel, J. D. Quigley and Xufan Zhang).

    Conferences

F. Blanchet-Sadri was on the program committee of WORDS 2013 9th International Conference on Words, Turku, Finland, September 16-20, 2013.
F. Blanchet-Sadri chaired a session for the 17th International Conference on Developments in Language Theory, Paris-Est, France, June 20, 2013.
F. Blanchet-Sadri was invited to be a participant in the Dagstuhl Seminar "Combinatorics and Algorithms of Strings" that will be held at the Schloss Dagstuhl-Leibniz Center for Informatics, Saarbrucken, Germany from March 9 to March 14, 2014.
F. Blanchet-Sadri gave a talk entitled "Algorithmic Combinatorics on Partial Words" at the Clemson mini-conference that will be held on October 3-4, 2013.

Program T-shirt

front   back  

Our Wonderful REU Group

Return to Menu