MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the Comparison Complexity of the String Prefix-Matching Problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

On the Comparison Complexity of the String Prefix-Matching Problem
by Dany Breslauer, Dany Breslauer, Livio Colussi, Livio Colussi, Laura Toniolo, Laura Toniolo — 1995 — In Proc. 2nd European Symposium on Algorithms, number 855 in Lecture Notes in Computer Science
… Abstract In this paper we study the exact comparison complexity of the string prefix-matching problem…
Cited by 5 (0 self) – Add To MetaCart

Tight Comparison Bounds for the String Prefix-Matching Problem
by Dany Breslauer, Livio Colussi, Laura Toniolo, Universit'a Di Padova — 1993
… the exact complexity of the string prefix-matching problem in the deterministic sequential comparison model…
Cited by 11 (3 self) – Add To MetaCart

Automata to Logic - and
by Back January Pp, Gudmund Skovbjerg Fr, Thore Husfeldt, Peter Bro Miltersen
…. Dany Breslauer, Livio Colussi, and Laura Toniolo. On the Comparison Complexity of the String Prefix-Matching…
Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB