Inproceedings,

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.

, , , , , and .
Stringology, page 135-145. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)

Meta data

Tags

Users

  • @dblp

Comments and Reviews