Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. R. Bayer, E. M. McCreight, Organization and Maintenance of Large Ordered Indexes, Acta Informatica, Vol. 1, 173–189, 1972
2. P. Becker, A New Algorithm for the Construction of Optimal B-Trees, Nordic Journal of Computing, Vol. 1, No. 4, 389–401, 1994
3. L. Gotlieb, Optimal Multi-Way Search Trees, SIAM Journal of Computing, Vol. 10, No. 3, 422–433, 1981
4. D. S. Hirschberg, L. L. Larmore, The Least Weight Subsequence Problem, SIAM Journal on Computing, Vol. 16, No. 4, 628–638, 1987
5. D. E. Knuth, Optimum Binary Search Trees, Acta Informatica, Vol. 1, 14–25, 1971
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献