|
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.
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, Vol. 19, 2008,
pp 1439-1448.
-
F. Blanchet-Sadri, N.C. Brownstein, A. Kalcic, J. Palumbo and T. Weyand,
“Unavoidable Sets of Partial Words,” Theory of Computing Systems, Vol. 45, 2009, pp 381-406.
-
F. Blanchet-Sadri, E. Clader and O. Simpson,
“Border Correlations of Partial Words,”
Theory of Computing Systems, Vol. 47, 2010, pp 179-195.
-
F. Blanchet-Sadri, Justin Fowler, Joshua Gafni and Kevin Wilson,
“Combinatorics on Partial Word Correlations.”
Journal of Combinatorial Theory, Series A, Vol. 117, 2010, pp 607-624.
-
F. Blanchet-Sadri, Travis Mandel and Gautam Sisodia,
“Periods in Partial Words: An Algorithm.”
In C. S. Iliopoulos and W. F. Smyth (Eds.), IWOCA 2011, 22nd International Workshop on Combinatorial Algorithms, June 20-22, 2011,
Victoria, British Columbia, Canada, Lecture Notes in Computer Science, Vol. 7056, Springer-Verlag, Berlin, Heidelberg, 2011, pp 57-70.
-
F. Blanchet-Sadri, Travis Mandel and Gautam Sisodia,
“Periods in Partial Words: An Algorithm.”
Journal of Discrete Algorithms, Vol. 16, 2012, pp 113-128.
-
F. Blanchet-Sadri, Robert Mercas and Geoffrey Scott,
“A
generalization of Thue Freeness for Partial Words,” Theoretical
Computer Science, Vol. 410, 2009, pp 793-800.
-
F. Blanchet-Sadri, Robert Mercas and Geoffrey Scott,
“Counting Distinct Squares in Partial Words,”
In E. Csuhaj-Varju and Z. Esik (Eds.), AFL 2008, 12th International Conference on Automata and Formal Languages,
May 27-30, 2008, Balatonfüred, Hungary, Proceedings, pp 122-133 (extended version in Acta Cybernetica, Vol. 19, 2009, pp 465-477).
-
F. Blanchet-Sadri and Brian Shirey,
“Periods and Binary Partial Words,” In WORDS 2009, the 7th International Conference on Words,
September 14-18, 2009, Salerno, Italy.
Honors
-
Travis Mandel received Tulane's Glendy Burke Medal in Mathematics in
2008. This is awarded (to a graduating student) for excellence in the
field of mathematics.
-
Travis Mandel received the Frank Gerth III Graduate Excellence Award from The University of Texas at Austin in 2009.
-
Olivia Simpson was awarded MK Bennet award for Geometry.
Presentations
|
F. Blanchet-Sadri, “Counting Unbordered Partial Words”, College of Nyíregyháza,
Institute of Mathematics and Computer Science, May 23, 2008 (joint work with Mihai Cucuringu, Joel Dodge and Robert Mercas).
|
|
Geoffrey Scott,
“Counting Distinct Squares in Partial Words,”
AFL 2008, 12th International Conference on Automata and Formal Languages,
May 28, 2008, Balatonfüred, Hungary (joint work with F. Blanchet-Sadri and Robert Mercas).
|
Geoffrey Scott presenting the paper entitled “Counting Distinct Squares in Partial Words” at AFL 2008, 12th International Conference on Automata and Formal Languages, Balatonfüred, Hungary, May 28, 2008.
|
|
Gautam Sisodia,
“Periods in Partial Words: An Algorithm,”
IWOCA 2011, 22nd International Workshop on Combinatorial Algorithms,
June 20, 2011, Victoria, British Columbia, Canada (joint work with F. Blanchet-Sadri and Travis Mandel).
|
Gautam Sisodia presenting the paper entitled “Periods in Partial Words: An Algorithm,” at IWOCA 2011, 22nd International Workshop on Combinatorial Algorithms,
Victoria, British Columbia, Canada, June 20, 2011.
|
Geoffrey Scott and Robert Mercaş meeting in Berlin, Germany in April 2012.
|
Conferences
F. Blanchet-Sadri was invited for a visit at the University of Debrecen, Debrecen, Hungary, May 2008.
|
T-shirt designed by the participants of Summer 2007
|