Publisher
Springer International Publishing
Reference8 articles.
1. J. Pachocki, J. Radoszewski, Where to use and how not to use polynomial string hashing. Olymp. Inf. 7(1), 90–100 (2013)
2. D. Gusfield, Algorithms on Strings, Computer Science and Computational Biology, Trees and Sequences (Cambridge University Press, 1997)
3. M.G. Main, R.J. Lorentz, An $$O(n \log n)$$ algorithm for finding all repetitions in a string. J. Algo. 5(3), 422–432 (1984)
4. R.M. Karp, R.E. Miller, A.L. Rosenberg, Rapid identification of repeated patterns in strings, trees and arrays, in 4th Annual ACM Symposium on Theory of Computing (1972), (pp. 125–135)
5. J. Kärkkäinen, P. Sanders, Simple linear work suffix array construction, in International Colloquium on Automata, Languages, and Programming (2003), pp. 943–955