Chapter PDF
Keywords
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
Allan, Munro: Self-Organizing Binary Search, Proc. 17 th Symposium on Foundations of Computer Science, 1976.
Bayer, P.: Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees, MIT, 1975.
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.
Gilbert, E.N. and Moore, E.F.: Variable length binary encodings, Bell Systems Techn. J. 38 (1959).
Gotlieb, CC. and Walker, W.A.: A Top-Down Algorithms for Constructing Nearly Optimal Lexicographical Trees, Graph Theory and Computing, Academic Press, 1972.
Güttler, Mehlhorn, Schneider, Wernet: Binary Search Trees: Average and Worst Case Behaviour, GI Jahrestagung 1976, Informatik Fachberichte Nr. 5, Springer-Verlag.
Hotz, G.: Schranken für die mittlere Suchzeit bei ausgewogenen Verteilungen, Theoretical Computer Science, 1976.
Hu, T.C. and Tucker, A.C.: Optimal Computer Search Trees and Variable Length Alphabetic Codes, Siam J. Applied Math., 21, 1971.
Knuth, D.E. 71: Optimum Binary Search Trees, Acta Informatica I, 1971.
Knuth, D.E. 73: The Art of Computer Programming, Vol. III, Addison-Wesley, 1973.
van Leeuwen, J.: On the construction of Wuffmann Trees, Proc. 3rd Coll. on Automata, Languages and Programming, 1976, Edinburgh, University Press, Ed. S. Michaelson.
Mehlhorn, K.: Nearly Optimal Binary Search Trees, Acta Informatica, 5, 1975.
Mehlhorn, K.: Dynamic Binary Search, Techn. Bericht, FB 10, Nr. 11, Universität des Saarlandes, 1976.
Mehlhorn, K.: Best Possible Bounds on the Weighted Path Length of Optimum Binary Search Trees, SIAM J. of Computing, 1977.
Mehlhorn, K.: Effiziente Algorithmen, Teubner-Verlag, 1977.
Nievergelt, Reingold: Binary Search Trees of Bounded Balance, SIAM J. of Computing, Vol. 2, Nr. 1, March, 1973.
Rissanen, J.: Bounds for weighted balanced trees, IBM J. of Res. and Develop., March, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehlhorn, K. (1977). Dynamic binary search. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive