TY - JOUR
T1 - A tradeoff between search and update time for the implicit dictionary problem
AU - Borodin, Allan
AU - Fich, Faith E.
AU - Meyer Auf Der Heide, Friedhelm
AU - Upfal, Eli
AU - Wigderson, Avi
PY - 1988/6
Y1 - 1988/6
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0024019806&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(88)90018-7
DO - 10.1016/0304-3975(88)90018-7
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0024019806
SN - 0304-3975
VL - 58
SP - 57
EP - 68
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-3
ER -