Tight bounds on the complexity of the Boyer-Moore string matching algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationSecond Annual ACM Symposium on Discrete Algorithms
Pages224-233
StatePublished - 1991

Cite this

Cole, R. (1991). Tight bounds on the complexity of the Boyer-Moore string matching algorithm. In Second Annual ACM Symposium on Discrete Algorithms (pp. 224-233)