Author:
Chrobak Marek,Golin Mordecai,Munro J. Ian,Young Neal E.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Anderson, R., Kannan, S., Karloff, H., Ladner, R.E.: Thresholds and optimal binary comparison search trees. J. Algorithms 44, 338–358 (2002)
2. Chrobak, M., Golin, M., Munro, J.I., Young, N.E.: Optimal search trees with 2-way comparisons. CoRR,
arXiv:1505.00357v4
[cs.DS] (2015).
http://arxiv.org/abs/1505.00357v4
3. Comer, D.: A note on median split trees. ACM Trans. Program. Lang. Syst. 2(1), 129–133 (1980)
4. Garsia, A.M., Wachs, M.L.: A new algorithm for minimum cost binary trees. SIAM J. Comput. 6(4), 622–642 (1977)
5. Gilbert, E., Moore, E.: Variable-length binary encodings. Bell Syst. Tech. J. 38(4), 933–967 (1959)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献