Author:
Bose Prosenjit,Howat John,Morin Pat
Publisher
Springer Berlin Heidelberg
Reference48 articles.
1. Knuth, D.: Optimum binary search trees. Acta Informatica 1, 14–25 (1971)
2. Mehlhorn, K.: Nearly optimal binary search trees. Acta Inf. 5, 287–295 (1975)
3. Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM J. Comput. 6(2), 235–239 (1977)
4. Bayer, P.: Improved bounds on the cost of optimal and balanced binary search trees. Master’s thesis, MIT (1975)
5. Fredman, M.L.: Two applications of a probabilistic search technique: Sorting x + y and building balanced search trees. In: STOC, pp. 240–244 (1975)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hopcroft’s Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees;ACM Transactions on Algorithms;2023-04-11
2. Belga B-Trees;Theory of Computing Systems;2020-06-27
3. Belga B-Trees;Computer Science – Theory and Applications;2019