Static Optimality and Dynamic Search-Optimality in Lists and Trees (2002)
Cached
Download Links
- [www.aladdin.cs.cmu.edu]
- [www.cs.cmu.edu]
- [pecan.srv.cs.cmu.edu]
- [www.cc.gatech.edu]
- [people.cs.uchicago.edu]
- [ttic.uchicago.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 18 - 3 self |
BibTeX
@MISC{Blum02staticoptimality,
author = {Avrim Blum and Shuchi Chawla and Adam Kalai},
title = {Static Optimality and Dynamic Search-Optimality in Lists and Trees},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Adaptive data structures form a central topic of online algorithms research, beginning with the results of Sleator and Tarjan showing that splay trees achieve static optimality for search trees, and that Move-toFront is constant competitive for the list update prob- lem [ST85a, ST85b]. This paper is inspired by the observation that one can in fact achieve a 1 + e ra- tio against the best static object in hindsight for a wide range of data structure problems via "weighted experts" techniques from Machine Learning, if computational decision-making costs are not considered.
