Optimal alphabetic search trees with restricted maximal height
Author:
- Russell L. WessnerRWRussell L. Wessner
- 1 January 1976
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 4 (4) , 90-94
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Optimal Binary Search Trees with Restricted Maximal DepthSIAM Journal on Computing, 1974
- Constructing codes with bounded codeword lengths (Corresp.)IEEE Transactions on Information Theory, 1974
- Optimum binary search treesActa Informatica, 1971