Find file
Fetching contributors…
Cannot retrieve contributors at this time
31 lines (20 sloc) 1.16 KB
Aragon and Seidel, "Randomized Search Trees," Algorithmica 16:464-497, 1996
Cormen, Leiserson and Rivest, _Introduction to Algorithms_, MIT Press, 1990
Gonnet, "Balancing Binary Trees by Internal Path Reduction", Communications of
the ACM 26(12):1074-1081, 1983
Gonnet, _Handbook of Algorithms and Data Structures_, Addison-Wesley, 1984
Guibas and Sedgewick, "A Dichromatic Framework for Balanced Trees,"
Proceedings of the 19th Annual Symposium on Foundations of Computer Science
(FOCS) 19:8-21, IEEE Computer Science Society, 1978
Knuth, _The Art of Computer Programming, Volume 3: Sorting and Searching_,
2nd Edition, Addison-Wesley, 1998
Nievergelt and Reingold, "Binary Search Trees of Bounded Balance," SIAM Journal
of Computing 2 1:33-43, 1973
Pugh, "Skip lists: a probabilistic alternative to balanced trees,"
Communications of the ACM 33:668-676, 1990
Sleator and Tarjan, "Self-Adjusting Binary Search Trees," Journal of the ACM
32(3):652-686, 1985
Tarjan, "Amortized Computational Complexity," SIAM Journal on Algebraic and
Discrete Methods, 6(2):306-318, 1985
Tarjan, _Data Structures and Network Algorithms_, Society of Industrial and
Applied Mathematics (SIAM), 1983