EFFICIENT RANDOMIZED PATTERN-MATCHING ALGORITHMS

[1] TECHNIQUE FOR EXTENDING RAPID EXACT-MATCH STRING MATCHING TO ARRAYS OF MORE THAN ONE DIMENSION [J]. 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]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772

[4] SAVING SPACE IN FAST STRING-MATCHING [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]. JOURNAL OF NUMBER THEORY, 1980, 12 (01) : 128 - 138

[1] TECHNIQUE FOR EXTENDING RAPID EXACT-MATCH STRING MATCHING TO ARRAYS OF MORE THAN ONE DIMENSION [J]. 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]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772

[4] SAVING SPACE IN FAST STRING-MATCHING [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]. JOURNAL OF NUMBER THEORY, 1980, 12 (01) : 128 - 138