A tradeoff between search and update time for the implicit dictionary problem

Allan Borodin*, Faith E. Fich, Friedhelm Meyer Auf Der Heide, Eli Upfal, Avi Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

This paper proves a tradeoff between the time it takes to search for elements in an implicit dictionary and the time it takes to update the value of elements in specified locations of the dictionary. It essentially shows that if the update time is constant, then the search time is Ω(nε) for some constant ε>0.

Original languageEnglish
Pages (from-to)57-68
Number of pages12
JournalTheoretical Computer Science
Volume58
Issue number1-3
DOIs
StatePublished - Jun 1988

Fingerprint

Dive into the research topics of 'A tradeoff between search and update time for the implicit dictionary problem'. Together they form a unique fingerprint.

Cite this