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
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


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.


Partial Order Search Time Extra Space Array Location Mathematical Science Research Institute 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AM]
    H. Alt and K. Mehlhorn, Searching Semisorted Tables, SICOMP, vol. 14 no. 4, 1985, pages 840–848.Google Scholar
  2. [AMM]
    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. [BGLY]
    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. [C]
    S. Cook, personal communication.Google Scholar
  5. [Fe]
    P. Feldman, personal communication.Google Scholar
  6. [Fr]
    G.N. Frederickson, Implicit Data Structures for the Dictionary Problem, J. ACM, vol. 30 no. 1, 1983, pages 80–94.Google Scholar
  7. [LS]
    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. [Ma]
    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. [M1]
    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. [M2]
    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. [MS]
    J.I. Munro and H. Suwanda, Implicit Data Structures, JCSS, vol. 21, 1980, pages 236–250.Google Scholar
  12. [Y]
    A.C. Yao, Should Tables be Sorted?, J.ACM vol. 3, 1981, pages 615–628.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Allan Borodin
    • 1
  • Faith E. Fich
    • 2
  • Friedhelm Meyer auf der Heide
    • 3
  • Eli Upfal
    • 4
  • Avi Wigderson
    • 5
  1. 1.University of TorontoTorontoCanada
  2. 2.University of WashingtonSeattleUSA
  3. 3.Johann Wolfgang Goethe UniversitätFrankfurtWest Germany
  4. 4.IBM Almaden Research CenterSan JoseUSA
  5. 5.Mathematical Science Research InstituteBerkeleyUSA

Personalised recommendations