An analytical comparison of two string searching algorithms
Information Processing Letters - Lecture Notes in Computer Science, no. 173
Average running time of the Boyer-Moore-Horspool algorithm
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Tight Bounds on the Complexity of the Boyer--Moore String Matching Algorithm
SIAM Journal on Computing
Analysis of Boyer-Moore-Horspool string-matching heuristic
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Analysis of Boyer-Moore-type string searching algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A fast string searching algorithm
Communications of the ACM
The Boyer-Moore-Horspool heuristic with Markovian input
Random Structures & Algorithms
Knuth-Morris-Pratt Algorithm: An Analysis
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Handbook of Exact String Matching Algorithms
Handbook of Exact String Matching Algorithms
The Practical Efficiency of Convolutions in Pattern Matching Algorithms
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
The Practical Efficiency of Convolutions in Pattern Matching Algorithms
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Probabilistic Arithmetic Automata and Their Applications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.00 |
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a random text. Previously, only special variants of this algorithm have been analyzed. We also propose a means of computing the limiting constants for the mean and the variance. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006.