EFFICIENT RANDOMIZED PATTERN-MATCHING ALGORITHMS

被引：606

作者：

KARP, RM

RABIN, MO

机构：

[1] UNIV CALIF BERKELEY,MATH,BERKELEY,CA 94720

[2] HARVARD UNIV,COMP SCI,CAMBRIDGE,MA 02138

[3] HEBREW UNIV JERUSALEM,JERUSALEM,ISRAEL

来源：

IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1987年 / 31卷 / 02期

关键词：

D O I：

10.1147/rd.312.0249

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：249 / 260

页数：12

共 13 条

[1] TECHNIQUE FOR EXTENDING RAPID EXACT-MATCH STRING MATCHING TO ARRAYS OF MORE THAN ONE DIMENSION [J].

BAKER, TP .

SIAM JOURNAL ON COMPUTING, 1978, 7 (04) :533-541

[2]

Bird R. S., 1977, Information Processing Letters, V6, P168, DOI 10.1016/0020-0190(77)90017-5

[3] FAST STRING SEARCHING ALGORITHM [J].

BOYER, RS ;

MOORE, JS .

COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772

[4] SAVING SPACE IN FAST STRING-MATCHING [J].

GALIL, Z ;

SEIFERAS, J .

SIAM JOURNAL ON COMPUTING, 1980, 9 (02) :417-438

[5]

GALIL Z, 1981, 13TH P ACM S THEOR C, P106

[6]

Karp R. M., 1972, PROC 4 ANN ACM S THE, P125

[7]

Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024

[8]

Rabin M.O., 1981, TR1581 HARV U CTR RE

[9]

Rabin M.O., 1976, ALGORITHMS COMPLEXIT, P21

[10] PROBABILISTIC ALGORITHM FOR TESTING PRIMALITY [J].

RABIN, MO .

JOURNAL OF NUMBER THEORY, 1980, 12 (01) :128-138

← 1 2 →