TIME-SPACE-OPTIMAL STRING MATCHING

[1] Borodin A., 1979, 20th Annual Symposium of Foundations of Computer Science, P319, DOI 10.1109/SFCS.1979.4

[2] FAST STRING SEARCHING ALGORITHM [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772

[3] DURIS P, 1981, 13TH P ANN STOC MILW, P177

[4] UNIQUENESS THEOREMS FOR PERIODIC FUNCTIONS [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 16 (01) : 109 - &

[5] Fischer M.J., 1974, SIAM AMS P, V7, P113

[6] IMPROVING THE WORST CASE RUNNING TIME OF THE BOYER-MOORE STRING MATCHING ALGORITHM [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (09) : 505 - 508

[7] LINEAR-TIME STRING-MATCHING USING ONLY A FIXED NUMBER OF LOCAL STORAGE LOCATIONS [J]. THEORETICAL COMPUTER SCIENCE, 1981, 13 (03) : 331 - 336

[8] SAVING SPACE IN FAST STRING-MATCHING [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (02) : 417 - 438

[9] GALIL Z, 1976, 17TH ANN S F COMP SC, P236

[10] KARP RM, UNPUB EFFICIENT RAND

[1] Borodin A., 1979, 20th Annual Symposium of Foundations of Computer Science, P319, DOI 10.1109/SFCS.1979.4

[2] FAST STRING SEARCHING ALGORITHM [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772

[3] DURIS P, 1981, 13TH P ANN STOC MILW, P177

[4] UNIQUENESS THEOREMS FOR PERIODIC FUNCTIONS [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 16 (01) : 109 - &

[5] Fischer M.J., 1974, SIAM AMS P, V7, P113

[6] IMPROVING THE WORST CASE RUNNING TIME OF THE BOYER-MOORE STRING MATCHING ALGORITHM [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (09) : 505 - 508

[7] LINEAR-TIME STRING-MATCHING USING ONLY A FIXED NUMBER OF LOCAL STORAGE LOCATIONS [J]. THEORETICAL COMPUTER SCIENCE, 1981, 13 (03) : 331 - 336

[8] SAVING SPACE IN FAST STRING-MATCHING [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (02) : 417 - 438

[9] GALIL Z, 1976, 17TH ANN S F COMP SC, P236

[10] KARP RM, UNPUB EFFICIENT RAND