A new proof of the linearity of the Boyer-Moore string searching algorithm
- 1 September 1977
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (02725428) , 189-195
- https://doi.org/10.1109/sfcs.1977.3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- 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