Optimal Binary Search Trees with Restricted Maximal Depth
- 1 June 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 3 (2) , 101-110
- https://doi.org/10.1137/0203008
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Path Length of Binary Search TreesSIAM Journal on Applied Mathematics, 1972
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- Codes based on inaccurate source probabilitiesIEEE Transactions on Information Theory, 1971
- Optimum binary search treesActa Informatica, 1971
- Generating a canonical prefix encodingCommunications of the ACM, 1964
- Minimum-redundancy coding for the discrete noiseless channelIEEE Transactions on Information Theory, 1961
- Variable-Length Binary EncodingsBell System Technical Journal, 1959