Entry Karp:1981:ERPa from cacm1970.bib
Last update: Fri Apr 25 02:02:08 MDT 2025
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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,
}
Related entries
- Baeza-Yates:1992:NAT,
20(10)762,
35(10)74,
35(10)83
- hash,
0(0)168,
13(2)107,
13(7)422,
13(7)427,
13(8)481,
13(9)573,
13(11)675,
14(4)228,
15(11)996,
15(12)1045,
16(1)11,
16(1)46,
16(2)105,
17(3)164,
17(7)403,
18(4)216,
18(7)413,
20(1)31,
20(4)262,
20(11)841,
21(7)554,
21(11)947
- incremental,
15(12)1040,
16(2)117,
19(5)266,
19(9)522,
20(2)100
- Karp:1981:ERPa,
35(10)74
- string,
6(2)323,
12(1)35,
13(2)83,
13(2)94,
13(7)403,
13(7)407,
13(12)758,
14(7)476,
14(11)713,
14(12)769,
15(6)438,
15(6)455,
15(8)742,
15(10)891,
15(10)910,
16(2)91,
16(3)148,
17(1)3,
17(3)143,
17(5)265,
17(6)315,
17(6)345,
17(10)563,
17(11)621,
17(11)646,
18(6)333,
18(6)341,
18(7)390,
19(5)285,
19(11)617,
19(12)655,
20(2)93,
20(7)495,
20(7)527,
20(10)762,
20(11)874,
21(3)232,
21(4)259,
21(4)315,
21(6)448,
21(9)750,
21(10)866,
22(9)505,
33(6)677,
34(11)118,
34(11)118,
34(11)118,
34(11)120,
35(10)74,
35(10)83
- Yates:1992:NAT, Baeza-,
20(10)762,
35(10)83