A tradeoff between search and update in
β
Jaikumar Radhakrishnan; Venkatesh Raman
π
Article
π
2001
π
Elsevier Science
π
English
β 64 KB
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 up