On the Expected Sublinearity of the Boyer–Moore Algorithm
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (4) , 648-658
- https://doi.org/10.1137/0217041
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Boyer–Moore–Galil String Searching Strategies RevisitedSIAM Journal on Computing, 1986
- A New Proof of the Linearity of the Boyer-Moore String Searching AlgorithmSIAM Journal on Computing, 1980
- On improving the worst case running time of the Boyer-Moore string matching algorithmCommunications of the ACM, 1979
- The Complexity of Pattern Matching for a Random StringSIAM Journal on Computing, 1979
- On the Worst-Case Behavior of String-Searching AlgorithmsSIAM Journal on Computing, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977