๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity aspects of guessing prefix codes

โœ Scribed by A. S. Fraenkel; S. T. Klein

Publisher
Springer
Year
1994
Tongue
English
Weight
664 KB
Volume
12
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Comparison Complexity of the Stri
On the Comparison Complexity of the String Prefix-Matching Problem
โœ Dany Breslauer; Livio Colussi; Laura Toniolo ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 525 KB

In this paper we study the exact comparison complexity of the string prefixmatching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching al