Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. G.M. Adel’son-Vel’skii and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):263–266, 1962. English translation in Soviet Math. Doklay 3, 1259-1263, 1962.
2. A. Andersson. General balanced trees. Journal of Algorithms, 30:1–18, 1999.
3. N. Blum and K. Mehlhorn. On the average number of rebalancing operations in weight-balanced trees. TCS: Theoretical Computer Science, 11:303–320, 1980.
4. L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 8–21, October 1978.
5. D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, MA, 2nd edition, 1998.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balancing weight-balanced trees;Journal of Functional Programming;2011-05
2. Rank Selection in Multidimensional Data;LATIN 2010: Theoretical Informatics;2010
3. Towards Optimal Range Medians;Automata, Languages and Programming;2009
4. Associative-Commutative Rewriting on Large Terms;Rewriting Techniques and Applications;2003