Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. G. M. Adelson-Velski and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2), 162.
2. A. Andersson. Binary search trees of almost optimal height. tech. report, Department of Computer Science, Lund University, 1988.
3. R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4), 1972.
4. H. A. Mauer, Th. Ottman, and H. W. Six. Implementing dictionaries using binary trees of very small height. Information Processing Letters, 5(1), 1976.
5. J. Nievergelt and E. M. Reingold. Binary trees of bounded balance. SIAM Journal on Computing, 2(1), 1973.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献