Last update: Fri Apr 25 02:02:08 MDT 2025
@TechReport{Karp:1981:ERPa,
author = "R. M. Karp and M. O. Rabin",
title = "Efficient Randomized Pattern-Matching Algorithms",
type = "Technical report",
number = "TR-31-81",
institution = "Harvard University",
address = "Cambridge, MA, USA",
pages = "??",
month = "??",
year = "1981",
bibdate = "Sun May 02 07:50:09 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
note = "An incremental hash function is described for
application to the string search problem. See
\cite{Baeza-Yates:1992:NAT}.",
acknowledgement = ack-nhfb,
}