On the Comparison Complexity of the String Prefix-Matching Problem (1995)

Cached

Download Links

by Dany Breslauer , Dany Breslauer , Livio Colussi , Livio Colussi , Laura Toniolo , Laura Toniolo
Venue:In Proc. 2nd European Symposium on Algorithms, number 855 in Lecture Notes in Computer Science
Citations:6 - 0 self

Document Versions

On the Comparison Complexity of the String Prefix-Matching Problem –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
On the comparison complexity of the string prefix-matching problem –Dany Breslauer, Dany Breslauer, Livio Colussi, Livio Colussi, Laura Toniolo, Laura Toniolo — 1998 — In Proc. 2nd European Symposium on Algorithms, number 855 in Lecture Notes in Computer Science