Online algorithms.
52156499
Optimal binary trees in online algorithms
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."
2002
en
Data structures (Computer science)
Sleator
Daniel D.
Sleator, Daniel D. (Daniel Dominic), 1953-
1953
Binary control systems.
pau
2002
Talupur
M.
Talupur, M.
[Research paper] / Carnegie Mellon University. School of Computer Science ;
School of Computer Science, Carnegie Mellon University
Pittsburgh, Pa.