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.1007/3-540-16761-7_54

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 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
Title of host publication	Automata, Languages and Programming - 13th International Colloquium, Proceedings
Editors	Laurent Kott
Publisher	Springer Verlag
Pages	50-59
Number of pages	10
ISBN (Print)	9783540167617
DOIs	https://doi.org/10.1007/3-540-16761-7_54
State	Published - 1986
Externally published	Yes
Event	13th International Colloquium on Automata, Languages and Programming, ICALP 1986 - Rennes, France Duration: 15 Jul 1986 → 19 Jul 1986

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	226 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Colloquium on Automata, Languages and Programming, ICALP 1986
Country/Territory	France
City	Rennes
Period	15/07/86 → 19/07/86

Bibliographical note

Publisher Copyright:
© 1986, Springer-Verlag.

Access to Document

10.1007/3-540-16761-7_54

Cite this

Borodin, A., Fich, F. E., auf der Heide, F. M., Upfal, E., & Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In L. Kott (Ed.), Automata, Languages and Programming - 13th International Colloquium, Proceedings (pp. 50-59). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 226 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-16761-7_54

Borodin, Allan ; Fich, Faith E. ; auf der Heide, Friedhelm Meyer et al. / A tradeoff between search and update time for the implicit dictionary problem. Automata, Languages and Programming - 13th International Colloquium, Proceedings. editor / Laurent Kott. Springer Verlag, 1986. pp. 50-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2c7fb2e1761a487a8d445177148d7a61,

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 {auf der Heide}, {Friedhelm Meyer} and Eli Upfal and Avi Wigderson",

note = "Publisher Copyright: {\textcopyright} 1986, Springer-Verlag.; 13th International Colloquium on Automata, Languages and Programming, ICALP 1986 ; Conference date: 15-07-1986 Through 19-07-1986",

year = "1986",

doi = "10.1007/3-540-16761-7_54",

language = "אנגלית",

isbn = "9783540167617",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "50--59",

editor = "Laurent Kott",

booktitle = "Automata, Languages and Programming - 13th International Colloquium, Proceedings",

address = "גרמניה",

}

Borodin, A, Fich, FE, auf der Heide, FM, Upfal, E & Wigderson, A 1986, A tradeoff between search and update time for the implicit dictionary problem. in L Kott (ed.), Automata, Languages and Programming - 13th International Colloquium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 226 LNCS, Springer Verlag, pp. 50-59, 13th International Colloquium on Automata, Languages and Programming, ICALP 1986, Rennes, France, 15/07/86. https://doi.org/10.1007/3-540-16761-7_54

A tradeoff between search and update time for the implicit dictionary problem. / Borodin, Allan; Fich, Faith E.; auf der Heide, Friedhelm Meyer et al.
Automata, Languages and Programming - 13th International Colloquium, Proceedings. ed. / Laurent Kott. Springer Verlag, 1986. p. 50-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 226 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Borodin, Allan

AU - Fich, Faith E.

AU - auf der Heide, Friedhelm Meyer

AU - Upfal, Eli

AU - Wigderson, Avi

PY - 1986

Y1 - 1986

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=84976669596&partnerID=8YFLogxK

U2 - 10.1007/3-540-16761-7_54

DO - 10.1007/3-540-16761-7_54

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84976669596

SN - 9783540167617

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 50

EP - 59

BT - Automata, Languages and Programming - 13th International Colloquium, Proceedings

A2 - Kott, Laurent

PB - Springer Verlag

T2 - 13th International Colloquium on Automata, Languages and Programming, ICALP 1986

Y2 - 15 July 1986 through 19 July 1986

ER -

Borodin A, Fich FE, auf der Heide FM, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. In Kott L, editor, Automata, Languages and Programming - 13th International Colloquium, Proceedings. Springer Verlag. 1986. p. 50-59. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-16761-7_54

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

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this