1. Fast Pattern Matching in Strings
2. and , The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1976.
3. A fast string searching algorithm
4. Private communication to D. E. Knuth (1977).
5. and , ‘A new proof of the linearity of the Boyer-Moore string searching algorithms’, Proc. 18th Ann. IEEE Symp. Foundations of Computer Sci., 189–195 (1977).