Beyond competitive analysis

SIAM Journal on Computing

Volumn 30, Issue 1, 2000, Pages 300-317

  Koutsoupias, E ^a   Papadimitriou, C H ^a  

^a University of California   (United States)

Author keywords

Competitive analysis; Metrical task systems; Online algorithms; Paging problem

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL COMPLEXITY; DECISION MAKING; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; ONLINE SYSTEMS;

METRICAL TASK SYSTEMS; ONLINE ALGORITHMS; PAGING PROBLEM;

ALGORITHMS;

EID: 0034455386     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796299540     Document Type: Article

References (16)

1. A new measure for the study of on-line algorithms
2. Competitive paging with locality of reference
3. An optimal on-line algorithm for metrical task systems
4. The server problem and on-line games
5. Competitive paging algorithms
6. Strongly competitive algorithms for paging with locality of reference
7. Markov paging
8. Beyond competitive analysis
9. On the k-server conjecture
10. Competitive algorithms for on-line problems
11. A strongly competitive randomized paging algorithm
12. A statistical adversary for on-line algorithms
13. Memory versus randomization in on-line algorithms
14. Amortized efficiency of list update and paging rules
15. The k-server dual and loose competitiveness for paging
16. Bounding the diffuse adversary