Tighter bounds on the comparison complexity of string matching

Richard Cole, Ramesh Hariharan

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

Original languageEnglish (US)
Title of host publicationThirty Third Annual Symposium on the Foundations of Computer Science
Pages600-609
StatePublished - 1992

Cite this

Cole, R., & Hariharan, R. (1992). Tighter bounds on the comparison complexity of string matching. In Thirty Third Annual Symposium on the Foundations of Computer Science (pp. 600-609)

Tighter bounds on the comparison complexity of string matching. / Cole, Richard; Hariharan, Ramesh.

Thirty Third Annual Symposium on the Foundations of Computer Science. 1992. p. 600-609.

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

Cole, R & Hariharan, R 1992, Tighter bounds on the comparison complexity of string matching. in Thirty Third Annual Symposium on the Foundations of Computer Science. pp. 600-609.
Cole R, Hariharan R. Tighter bounds on the comparison complexity of string matching. In Thirty Third Annual Symposium on the Foundations of Computer Science. 1992. p. 600-609
Cole, Richard ; Hariharan, Ramesh. / Tighter bounds on the comparison complexity of string matching. Thirty Third Annual Symposium on the Foundations of Computer Science. 1992. pp. 600-609
@inproceedings{9ab4a813cd5d4fb5b66b952c15e47ea2,
title = "Tighter bounds on the comparison complexity of string matching",
author = "Richard Cole and Ramesh Hariharan",
year = "1992",
language = "English (US)",
pages = "600--609",
booktitle = "Thirty Third Annual Symposium on the Foundations of Computer Science",

}

TY - GEN

T1 - Tighter bounds on the comparison complexity of string matching

AU - Cole, Richard

AU - Hariharan, Ramesh

PY - 1992

Y1 - 1992

M3 - Conference contribution

SP - 600

EP - 609

BT - Thirty Third Annual Symposium on the Foundations of Computer Science

ER -