3 Competitive Dynamic BSTs


In their original paper on splay trees [], Danny Sleator and Bob Tarjan conjectured that the cost of sequence of searches in a splay tree is within a constant factor of the cost of the same sequence of searches in any dynamic binary search tree, even if the competing search algorithm knows the entire sequence in advance. Equivalently, in the language of… (More)


5 Figures and Tables

Cite this paper

@inproceedings{Blum3CD, title={3 Competitive Dynamic BSTs}, author={B. Blum and Chawla and Kalai} }