Selected papers that cite this one
- Alberto Apostolico and Dany Breslauer. An optimal O(log log n)-time parallel algorithm for detecting all squares in a string. SIAM Journal on Computing, 25(6):1318-1331, December 1996.
- Richard Cole. Tight bounds on the complexity of the Boyer-Moore string matching algorithm. SIAM Journal on Computing, 23(5):1075-1091, October 1994.
- Maxime Crochemore and Dominique Perrin. Two-way string-matching. Journal of the ACM, 38(3):651-675, July 1991.