Tight comparison bounds for the string prefix-matching problem

Additional Metadata
Publisher	CWI
Series	Department of Computer Science [CS]
Organisation	Computer Systems & Telematics
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. (1992). Tight comparison bounds for the string prefix-matching problem. In Department of Computer Science [CS] (R 9250). CWI.

Publication