Fast Pattern Matching in Strings
- 1 June 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (2), 323-350
- https://doi.org/10.1137/0206024
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognitionACM SIGACT News, 1975
- Efficient string matchingCommunications of the ACM, 1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- E2307The American Mathematical Monthly, 1972
- Implementation of the substring test by hashingCommunications of the ACM, 1971
- On the translation of languages from left to rightInformation and Control, 1965
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962
- Synchronization of binary messagesIEEE Transactions on Information Theory, 1960