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