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)

Tight bounds on the complexity of the Boyer-Moore string matching algorithm. / Cole, Richard.

Second Annual ACM Symposium on Discrete Algorithms. 1991. p. 224-233.

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

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.
Cole R. Tight bounds on the complexity of the Boyer-Moore string matching algorithm. In Second Annual ACM Symposium on Discrete Algorithms. 1991. p. 224-233
Cole, Richard. / Tight bounds on the complexity of the Boyer-Moore string matching algorithm. Second Annual ACM Symposium on Discrete Algorithms. 1991. pp. 224-233
@inproceedings{64cc6ba6954e4bc880454bf9436e11cc,
title = "Tight bounds on the complexity of the Boyer-Moore string matching algorithm",
author = "Richard Cole",
year = "1991",
language = "English (US)",
pages = "224--233",
booktitle = "Second Annual ACM Symposium on Discrete Algorithms",

}

TY - GEN

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

AU - Cole, Richard

PY - 1991

Y1 - 1991

M3 - Conference contribution

SP - 224

EP - 233

BT - Second Annual ACM Symposium on Discrete Algorithms

ER -