Average running time of the Boyer-Moore-Horspool algorithm
- 1 January 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 92 (1) , 19-31
- https://doi.org/10.1016/0304-3975(92)90133-z
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A very fast substring search algorithmCommunications of the ACM, 1990
- Improved string searchingSoftware: Practice and Experience, 1989
- On the Expected Sublinearity of the Boyer–Moore AlgorithmSIAM Journal on Computing, 1988
- An analytical comparison of two string searching algorithmsInformation Processing Letters, 1984
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- 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
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977