This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Booth, A. D., Colin, A. J. T.: On the efficiency of a new method of dictionary construction. Information and Control3, 327–334 (1960).
Brooks, Frederick P., Jr., Iverson, Kenneth E.: Automatic data processing, System/360 edition. Wiley 1969.
Douglas, A. S.: Techniques for the recording of, and reference to data in a computer. The Computer Journal2, 1–9 (1959).
Earley, Jay: An efficient context-free parsing algorithm. Communications of the ACM13, 94–102 (1970).
Gilbert, E. N., Moore, E. F.: Variable-length binary encodings. The Bell System Technical Journal38, 933–968 (1959).
Helbich, Jan: Direct selection of keywords for the KWIC index. Information Storage and Retrieval5, 123–128 (1969).
Hibbard, Thomas N.: Some combinatorial properties of certain trees with applications to searching and sorting. Journal of the ACM9, 13–28 (1962).
Iverson, Kenneth E.: A programming language. Wiley 1962.
Knuth, Donald E.: The art of computer programming,1: Fundamental algorithms. Addison-Wesley 1968.
Windley, P. F.: Trees, forests and rearranging. The Computer Journal3, 84–88, 174, 184 (1960).
Wirth, Niklaus, Hoare, C. A. R.: A contribution to the development ofAlgol. Communications of the ACM9, 413–431 (1966).
Wong, Eugene: A linear search problem. SIAM Review6, 168–174 (1964).
The research reported here was supported by IBM Corporation.
Rights and permissions
About this article
Cite this article
Knuth, D.E. Optimum binary search trees. Acta Informatica 1, 14–25 (1971). https://doi.org/10.1007/BF00264289
- Information System
- Operating System
- Data Structure
- Communication Network
- Information Theory