Static optimality and dynamic search-optimality in lists and trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 1-8

  Blum, Avrim ^a   Chawla, Shuchi ^a   Kalai, Adam ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; C (PROGRAMMING LANGUAGE); DATA STRUCTURES; DECISION MAKING; FORESTRY; LEARNING SYSTEMS; TREES (MATHEMATICS);

DYNAMIC OPTIMALITY; DYNAMIC SEARCH; FREE ROTATION; MOVE-TO-FRONT; ON-LINE ALGORITHMS; SEARCH TREES; SPLAY TREES; STATIC OBJECTS;

ALGORITHMS;

EID: 84968782882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. [ACBFS95] P. Auer, N. Cesa-Bianchi, Y. Preund, and R. Schapire Gambling in a rigged casino: The adversarial multiarmed bandit problem In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 322-331, November 1995.
2. [AvW95] Susanne Albers, Bernhard von Stengel, and Ralph Werchner, A combined bit and timestamp algorithm for the list update problem. Information Processing Letters, 56:135-139, 1995.
3. [BurOO] C. Burch. Machine learning in metrical task systems and other on-line problems. CM U Tech Report CMU-CS-00-135, May 2000.
4. [BB00] A. Blum and C. Burch. On-line learning and the metrical task system problem. Machine Learning, 39(1):35-58, April 2000.
5. [BEY98] Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998. http://wire.cup.org/Titles/56/0521563925.html.
6. [CLS01] Deepak Chawla, Lin Li, and Stephen Scott. Efficiently approximating weighted sums with exponentially many terms. In Proceedings of the Fourteenth Annual Conference on Computational Learning Theory, July 2001.
7. [FS96] Yoav Freund and Robert Schapire. Game theory, on-line prediction and boosting. In Proc. 9th Conf. on Computational Learning Theory, pages 325-332, 1996.
8. [KVOO] Adam Kalai and Santosh Vempala. Efficient algorithms for universal portfolios. In Proceedings of the 41st Annual Symposium on the Foundations of Computer Science, November 2000.
9. [Luc88] Joan M. Lucas. Canonical forms for competitive binary search tree algorithms. Technical Report DCS-TR-250, Rutgers University, 1988.
10. [LW94] N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
11. [ST85a] Daniel Sleator and Robert E. Tar Jan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
12. [ST85b] Daniel D. Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652-686, 1985.
13. [Tei93] Boris Teia. A lower bound for randomized list update algorithms. Information Processing Letters, 47:5-9, 1993.
14. [Wil89] Robert Wilber. Lower bounds for accessing binary search trees with rotations. SI A M Journal on Computing, 18:56-67, 1989.