An analytical comparison of two string searching algorithms
Information Processing Letters - Lecture Notes in Computer Science, no. 173
SIAM Journal on Computing
On the expected sublinearity of the Boyer-Moore algorithm
SIAM Journal on Computing
Software—Practice & Experience
A new approach to text searching
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient text searching
On improving the worst case running time of the Boyer-Moore string matching algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Knuth-Morris-Pratt Algorithm: An Analysis
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
String Searching Algorithms Revisited
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Tight bounds on the complexity of the Boyer-Moore string matching algorithm
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Predicting string search speed
Journal of Experimental Algorithmics (JEA)
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of the Boyer-Moore algorithm
Random Structures & Algorithms
Improving Boyer-Moore-Horspool using machine-words for comparison
Proceedings of the 48th Annual Southeast Regional Conference
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Probabilistic Arithmetic Automata and Their Applications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |