* Speaker's name is underlined.
- A. Deza, F. Franek, and M. Jiang
A computational framework for determining square-maximal strings [pdf]
Prague Stringology Conference, Prague, Czech Republic, August 27 - 28, 2012 - A. Deza, F. Franek, and M. Jiang
Computational approaches to the maximum number of distinct squares [pdf]
AdvOL student smeninar, Department of Computing and Software, McMaster University, Hamilton, Canada, November 22, 2011 - F. Franek, M. Jiang, and C. Weng
An improved version of the runs algorithm based on Crochemore's partitioning algorithm [pdf]
Prague Stringology Conference, Prague, Czech Republic, August 29 - 31, 2011 - A. Deza, F. Franek, and M. Jiang
A d-step approach for distinct squares in strings [pdf]
The 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Palermo, Italy, June 27 - 29, 2011 - A. Deza, F. Franek, and M. Jiang
A d-step approach for distinct squares in strings [pdf]
AdvOL student smeninar, Department of Computing and Software, McMaster University, Hamilton, Canada, March 8, 2011 - A. Deza, F. Franek, and M. Jiang
A d-step approach for distinct squares in strings [pdf]
London Stringology Days / London Algorithmic Workshop, London, U.K., February 7 - 8, 2011 - M. Jiang
Parallelizing Crochemore's Repetitions Algorithm to Compute Runs in Strings [pdf]
AdvOL student smeninar, Department of Computing and Software, McMaster University, Hamilton, Canada, April 27, 2010 - F. Franek and M. Jiang
Crochemore's repetitions algorithm revisited - computing runs [pdf]
Prague Stringology Conference, Prague, Czech Republic, August 31 - September 4, 2009 - F. Franek and M. Jiang
Crochemore's algorithm for repetitions revisited - computing runs [pdf]
The 4th Stringology Research Workshop, Bar-Ilan University, Ramat Gan, Israel, March 29 - April 2, 2009 - M. Jiang
Revising Crochemore's Repetitions Algorithm to Compute Runs in a String [pdf]
AdvOL student smeninar, Department of Computing and Software, McMaster University, Hamilton, Canada, March 5, 2009