* Authors are listed alphabetically by last name.
- A. Deza, F. Franek, and M. Jiang
A computational framework for determining square-maximal strings
Proceedings of the Prague Stringology Conference, Prague, Czech Republic (2012) 111-119 - F. Franek, M. Jiang, and C. Weng
An improved version of the runs algorithm based on Crochemore's partitioning algorithm
Proceedings of the Prague Stringology Conference, Prague, Czech Republic (2011) 98-105 - A. Deza, F. Franek, and M. Jiang
A d-step approach for distinct squares in strings
Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, Palermo, Italy (2011), Lecture Notes in Computer Science, Volume 6661 (2011) 77-89 - F. Franek and M. Jiang
Crochemore's repetitions algorithm revisited - computing runs
International Journal of Foundations of Computer Science, Volume 23 Number 2 (2012) 389-401 - F. Franek and M. Jiang
Crochemore's repetitions algorithm revisited - computing runs
Proceedings of the Prague Stringology Conference, Prague, Czech Republic (2009) 214-224