Tight comparison bounds for the string prefix-matching problem

1993

Presented at the Annual Symposium on Combinatorial Pattern Matching, Padova

Additional Metadata
MSC	Theory of computing (msc 68Qxx), Text processing; mathematical typography (msc 68U15)
Publisher	Springer
Conference	Annual Symposium on Combinatorial Pattern Matching
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Breslauer, D., Colussi, L.& Toniolo, L. (1993). Tight comparison bounds for the string prefix-matching problem. Lecture Notes in Computer Science, 11–19.

Publication