Time-space-optimal string matching
Zvi Galil, Joel Seiferas · Journal of Computer and System Sciences · 1983
Cited by 189 works. doi:10.1016/0022-0000(83)90002-8
Authors
References
- Fast Pattern Matching in Strings
- A fast string searching algorithm
- The equation $a^M=b^Nc^P$ in a free group.
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- Saving Space in Fast String-Matching
- Real-time recognition of substring repetition and reversal
- Fooling a two-way automaton or one pushdown store is better than one counter for two way machines (Preliminary Version)
- Linear-time string-matching using only a fixed number of local storage locations