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

doi:10.1016/0304-3975(88)90018-7

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

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	57-68
Number of pages	12
Journal	Theoretical Computer Science
Volume	58
Issue number	1-3
DOIs	https://doi.org/10.1016/0304-3975(88)90018-7
State	Published - Jun 1988

Access to Document

10.1016/0304-3975(88)90018-7

Cite this

@article{b961fdf9c4c0415f8d681ffdb15a2f58,

title = "A tradeoff between search and update time for the implicit dictionary problem",

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.",

author = "Allan Borodin and Fich, \{Faith E.\} and \{Meyer Auf Der Heide\}, Friedhelm and Eli Upfal and Avi Wigderson",

year = "1988",

month = jun,

doi = "10.1016/0304-3975(88)90018-7",

language = "אנגלית",

volume = "58",

pages = "57--68",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-3",

}

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 - https://www.scopus.com/pages/publications/0024019806

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 -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this