Java Reference
In-Depth Information
J. Bell and G. Gupta, “An Evaluation of Self-Adjusting Binary Search
Tree Techniques,”
Software-Practice and Experience
23
(1993), 369-382.
1.
D. W. Jones, “An Empirical Comparison of Priority-Queue and Event-Set
Implementations,”
Communications of the ACM
29
(1986), 300-311.
2.
D. D. Sleator and R. E. Tarjan, “Self-adjusting Binary Search Trees,”
Journal of the ACM
32
(1985), 652-686.
3.
R. E. Tarjan, “Amortized Computational Complexity,”
SIAM Journal on
Algebraic and Discrete Methods
6
(1985), 306-318.
4.
M. A. Weiss,
Data Structures and Algorithm Analysis in Java
, 2nd ed.,
Addison-Wesley, Reading, MA, 2007.
5.
Search WWH ::
Custom Search