Dynamic binary search

  • Kurt Mehlhorn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


Tree Structure Search Time Minimal Depth Interior Node Binary Search Tree 
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.

VI. References

  1. [0]
    Allan, Munro: Self-Organizing Binary Search, Proc. 17 th Symposium on Foundations of Computer Science, 1976.Google Scholar
  2. [1]
    Bayer, P.: Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees, MIT, 1975.Google Scholar
  3. [2]
    Fredman, M.L.: Two Applications of a Probalistic Search Technique: Sorting X Y and Building Balanced Search Trees, Proc. 7th Annual ACM Symp. on Theory of Computing, 1975.Google Scholar
  4. [3]
    Gilbert, E.N. and Moore, E.F.: Variable length binary encodings, Bell Systems Techn. J. 38 (1959).Google Scholar
  5. [4]
    Gotlieb, CC. and Walker, W.A.: A Top-Down Algorithms for Constructing Nearly Optimal Lexicographical Trees, Graph Theory and Computing, Academic Press, 1972.Google Scholar
  6. [5]
    Güttler, Mehlhorn, Schneider, Wernet: Binary Search Trees: Average and Worst Case Behaviour, GI Jahrestagung 1976, Informatik Fachberichte Nr. 5, Springer-Verlag.Google Scholar
  7. [6]
    Hotz, G.: Schranken für die mittlere Suchzeit bei ausgewogenen Verteilungen, Theoretical Computer Science, 1976.Google Scholar
  8. [7]
    Hu, T.C. and Tucker, A.C.: Optimal Computer Search Trees and Variable Length Alphabetic Codes, Siam J. Applied Math., 21, 1971.Google Scholar
  9. [8]
    Knuth, D.E. 71: Optimum Binary Search Trees, Acta Informatica I, 1971.Google Scholar
  10. [9]
    Knuth, D.E. 73: The Art of Computer Programming, Vol. III, Addison-Wesley, 1973.Google Scholar
  11. [10]
    van Leeuwen, J.: On the construction of Wuffmann Trees, Proc. 3rd Coll. on Automata, Languages and Programming, 1976, Edinburgh, University Press, Ed. S. Michaelson.Google Scholar
  12. [11]
    Mehlhorn, K.: Nearly Optimal Binary Search Trees, Acta Informatica, 5, 1975.Google Scholar
  13. [12]
    Mehlhorn, K.: Dynamic Binary Search, Techn. Bericht, FB 10, Nr. 11, Universität des Saarlandes, 1976.Google Scholar
  14. [13]
    Mehlhorn, K.: Best Possible Bounds on the Weighted Path Length of Optimum Binary Search Trees, SIAM J. of Computing, 1977.Google Scholar
  15. [14]
    Mehlhorn, K.: Effiziente Algorithmen, Teubner-Verlag, 1977.Google Scholar
  16. [15]
    Nievergelt, Reingold: Binary Search Trees of Bounded Balance, SIAM J. of Computing, Vol. 2, Nr. 1, March, 1973.Google Scholar
  17. [16]
    Rissanen, J.: Bounds for weighted balanced trees, IBM J. of Res. and Develop., March, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  1. 1.Fachbereich 10Universität des SaarlandesWest - Germany

Personalised recommendations