Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. G. M. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):1259–1262, 1962.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, Massachusetts, 1983. ISBN 0-201-00023-7.
3. A. Andersson. A note on searching in a binary search tree. Software-Practice and Experience, 21(10):1125–1128, 1991.
4. A. Andersson, Ch. Icking, R. Klein, and Th. Ottmann. Binary search trees of almost optimal height. Acta Inormatica, 28:165–178, 1990.
5. R. Bayer. Binary B-trees for virtual memory. In Proc. ACM SIGIFIDET Workshop on Data Description, Access and control, pages 219–235, 1971.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献