Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Apostolico, A. and Preparata, F.P. Optimal off-time detection of repetitions in a string. Theoretical Computer Science 12 (1983), 297–315.
2. Carter, J.L. and Wegman, M.N. Universal classes of hash functions. 9th Annual STOC, ACM, 1977, pp. 106–112.
3. Galil, Z. and Seiferas, J. Saving space in fast string matching. SIAM J. on Computing 9 (1980), 417–438.
4. Karp, R.M. and Rabin, M.O. Efficient randomized pattern matching algorithms. Harvard University, Center for Research in Computing Technology, 1981. TR-31–81.
5. Knuth, D.E., Morris, J.H., and Pratt, V.R. Fast pattern matching in strings. SIAM J. on Computing 6, (1977), 323–350.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献