A tradeoff between search and update in dictionaries
β Scribed by Jaikumar Radhakrishnan; Venkatesh Raman
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 64 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
Borodin, Fich, Meyer auf der Heide, Upfal and Wigderson [Theoret. Comput. Sci. 58 (1998) 57-68] showed lower bounds for search time in implicit dictionaries with bounded update time. In particular, their result implies a lower bound of (n Ξ΅ ) for search time in an implicit dictionary whenever the update time is bounded by a constant. They ask whether a similar result is true for dictionaries with explicit pointers. We answer their question in the affirmative by observing that stronger results follow easily from an earlier result of Borodin, Guibas, Lynch and Yao [Inform. Process. Lett. 12 (1981) 71-75]. In particular, a lower bound of (n) for search time holds whenever the update time is bounded by a constant. Our results hold even if the dictionary uses randomization and the update time is amortized.
π SIMILAR VOLUMES
We determined the relationship between plant height and whole-plant relative growth rate (g g day) for ten genotypes of Sporobolus kentrophyllus collected from an intensively grazed site on the Serengeti Plains, Tanzania. Plants were grown for 7 weeks in a greenhouse in Syracuse, N.Y., and harvested
For a fixed number of customers in an insurance market, changing the number of insurance firms creates both scale effects on the individual firms (as the number of customers per firm is altered), and an oligopolistic effect on market supply. The most prominent effect of scale is the impact on solven
## Abstract The present effort was intended to assess how situational variables influence the relative performance of groups and individuals on creative problemβsolving tasks. More specifically, a priming manipulation was used to increase the number of alternatives available for problem solving whi