𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Parallel Prefix Problems on Small Domains

✍ Scribed by Shiva P. Chaudhuri; Jaikumar Radhakrishnan

Book ID
112252295
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
401 KB
Volume
138
Category
Article
ISSN
0890-5401

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