Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 226))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Alt and K. Mehlhorn, Searching Semisorted Tables, SICOMP, vol. 14 no. 4, 1985, pages 840–848.

    Google Scholar 

  2. H. Alt, K. Mehlhorn, and J.I. Munro, Partial Match Retrieval in Implicit Data Structures, Information Processing Letters, vol. 19 no. 2, 1984, pages 61–65.

    Google Scholar 

  3. A. Borodin, L. Guibas, N. Lynch, and A. Yao, Efficient Searching Using Partial Ordering, Information Processing Letters, vol. 12 no. 2, 1981, pages 71–75.

    Google Scholar 

  4. S. Cook, personal communication.

    Google Scholar 

  5. P. Feldman, personal communication.

    Google Scholar 

  6. G.N. Frederickson, Implicit Data Structures for the Dictionary Problem, J. ACM, vol. 30 no. 1, 1983, pages 80–94.

    Google Scholar 

  7. N. Linial and M. Saks, Information Bounds are Good for Search Problems on Ordered Data Structures, 24th Annual Symposium on Foundations of Computer Science, 1983, pages 473–475.

    Google Scholar 

  8. H. Mairson, Average Case Lower Bounds on the Construction and Searching of Partial Orders, 26th Annual Symposium on Foundations of Computer Science, 1985, pages 303–311.

    Google Scholar 

  9. Munro, J.I., An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time, 25th Annual Symposium on Foundations of Computer Science, 1984, pages 369–374.

    Google Scholar 

  10. Munro, J.I., An Implicit Data Structure Supporting Insertion, Deletion and Search in O (log2 n) Time, manuscript, University of Waterloo, 1985.

    Google Scholar 

  11. J.I. Munro and H. Suwanda, Implicit Data Structures, JCSS, vol. 21, 1980, pages 236–250.

    Google Scholar 

  12. A.C. Yao, Should Tables be Sorted?, J.ACM vol. 3, 1981, pages 615–628.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Toronto, Toronto, Canada

    Allan Borodin

  2. University of Washington, Seattle, USA

    Faith E. Fich

  3. Johann Wolfgang Goethe Universität, Frankfurt, West Germany

    Friedhelm Meyer auf der Heide

  4. IBM Almaden Research Center, San Jose, USA

    Eli Upfal

  5. Mathematical Science Research Institute, Berkeley, USA

    Avi Wigderson

Authors
  1. Allan Borodin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Faith E. Fich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eli Upfal
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Avi Wigderson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation