Author:
Haeupler Bernhard,Sen Siddhartha,Tarjan Robert E.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Adel’son-Vel’skii, G.M., Landis, E.M.: An algorithm for the organization of information. Sov. Math. Dokl. 3, 1259–1262 (1962)
2. Lecture Notes in Computer Science;A. Andersson,1993
3. Bayer, R.: Binary B-trees for virtual memory. In: SIGFIDET, pp. 219–235 (1971)
4. Bayer, R.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Inf. 1, 290–306 (1972)
5. Brown, M.R.: A storage scheme for height-balanced trees. Inf. Proc. Lett., 231–232 (1978)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scaling Up Transactions with Slower Clocks;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20
2. Joinable Parallel Balanced Binary Trees;ACM Transactions on Parallel Computing;2022-04-11
3. Practical adaptive search trees with performance bounds;Proceedings of the Australasian Computer Science Week Multiconference;2017-01-31
4. Deletion Without Rebalancing in Binary Search Trees;ACM Transactions on Algorithms;2016-09-02
5. Cache-Sensitive Memory Layout for Dynamic Binary Trees;The Computer Journal;2015-11-04