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