Bounds for optimalα-β binary trees-Reference-Cited by-同舟云学术

Bounds for optimalα-β binary trees

Published:1977-03 Issue:1 Volume:17 Page:1-15
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Choy David M.,Wong C. K.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01932395.pdf

Reference7 articles.

1. N. Cot,A Linear-Time Ordering Procedure with Applications to Variable-Length Encoding, Proc. 8th Annual Princeton Conf. on Information Sciences and Systems, 1974, 460–463.

2. N. Cot,Complexity of the Variable-Length Encoding Problem, Proc. 6th Southeastern Conf. on Combinatorics, Graph Theory and Computing, 1975, Utilitas Mathematica Publ., Winnipeg, 211–224.

3. D. E. Knuth,The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass., 1968.

4. J. Nievergelt and C. K. Wong,Upper Bounds for the Total Path Length of Binary Trees. J. ACM, Vol. 20, No. 1, Jan. 1973, pp. 1–6.

5. J. Nievergelt and C. K. Wong,On Binary Search Trees. Information Processing 71, North-Holland Publishing Co. 1972, pp. 91–98.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Operations research applications of dichotomous search;European Journal of Operational Research;2018-03

2. Coding with digits of unequal cost;IEEE Transactions on Information Theory;1995-03

3. A compendium of key search references;ACM SIGIR Forum;1990-11

4. Optimum lopsided binary trees;Journal of the ACM;1989-07

5. Optimal binary search trees;International Journal of Computer Mathematics;1986-01