A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
- 1 November 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (4) , 672-682
- https://doi.org/10.1137/0209051
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Periods in stringsJournal of Combinatorial Theory, Series A, 1981
- On improving the worst case running time of the Boyer-Moore string matching algorithmPublished by Springer Nature ,1978
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962