1. L. Carter and M. Wegman, Universal Classes of Hash Functions. JCSS, 18:143–154, 1979.
2. R. M. Karp and M. O. Rabin, Efficient randomized pattern matching algorithms. Center for Research in Computing Technology, Harvard University, Report TR-31–81, 1981.
3. M. O. Rabin, Probabilistic algorithms in finite fields. SIAM J. of Computing, 9:273–280, 1980.
4. M. O. Rabin, Fingerprinting by random polynomials. Center for Research in Computing Technology, Harvard University, Report TR-15–81, 1981.
5. M. O. Rabin, Discovering repetitions in strings. In A. Apostolico and Z. Galil, (eds.), “Combinatorial Algorithms on Words,” Springer-Verlag, 279–288, 1985.