Daniel D Sleator; M Talupur
|描述：||7 p. ; 28 cm.|
|叢書名：||Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.|
|責任：||D. Sleator and M. Talupur.|
Abstract: "Some binary search tree algorithms, such as splay trees, structure the tree in a way that depends on the history of accesses. In this paper we consider what happens if at each point in time the optimal binary search tree (for the access frequencies seen so far) is maintained. We prove lower and upper bounds on the competitive ratio (with respect to the final optimal tree) of such an algorithm."