Publisher
Springer Berlin Heidelberg
Reference11 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. J-L. Baer and B. Schwab. A comparison of tree-balancing algorithms. Communications of the ACM, 20(5), 1977.
3. R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4), 1972.
4. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 1975.
5. M. R. Brown. Addentum to a storage scheme for height-balanced trees. Information Processing Letters, 8(3), 1979.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Layered List Labeling;Proceedings of the ACM on Management of Data;2024-05-10
2. Shuffle Tree: A Randomized Self-Adjusting Binary Search Tree;2023-07-11
3. Fast Algorithms via Dynamic-Oracle Matroids;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Online List Labeling: Breaking the log2n Barrier;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Geometrische Datenstrukturen;Algorithmische Geometrie;2022