* Authors are listed alphabetically by last name.

  1. A. Deza, F. Franek, and M. Jiang
    A computational framework for determining square-maximal strings [pdf]
    AdvOL-Report No. 2011/05, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, December 2011
  2. F. Franek, M. Jiang, and C. Weng
    An improved version of the runs algorithm based on Crochemore's partitioning algorithm [pdf]
    AdvOL-Report No. 2011/03, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, May 2011
  3. A. Deza, F. Franek, and M. Jiang
    A d-step approach for distinct squares in strings [pdf]
    AdvOL-Report No. 2011/01, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, January 2011
  4. F. Franek and M. Jiang
    A Parallel Approach to Computing Runs in a String [pdf]
    AdvOL-Report No. 2010/05, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, June 2010
  5. F. Franek and M. Jiang
    Crochemore repetition algorithm revisited - computing runs [pdf]
    AdvOL-Report No. 2009/01, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, April 2009