Competitive randomized algorithms for nonuniform problems

Algorithmica

Volumn 11, Issue 6, 1994, Pages 542-571

  Karlin, A R ^a   Manasse, M S ^a   McGeoch, L A ^b   Owicki, S ^a  

^a HEWLETT PACKARD COMPANY   (United States)

^b AMHERST COLLEGE   (United States)

Author keywords

Competitive analysis; On line algorithms; Randomized algorithms

Indexed keywords

GEOMETRY; ONLINE SYSTEMS; PROBABILITY; RANDOM PROCESSES;

COMPETITIVE RATIOS; DETERMINISTIC ALGORITHMS; PROBABILITY DISTRIBUTION; RANDOMIZED ALGORITHMS; REQUEST SEQUENCES; SNOOPY CACHING; SPIN BLOCK PROBLEM; TRIANGLES;

ALGORITHMS;

EID: 0028452732     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01189993     Document Type: Article

References (20)

1. On the power of randomization in on-line algorithms
2. An optimal on-line algorithm for metrical task systems
3. New results on server problems
4. A new approach to the server problem
5. An optimal on-line algorithm for k servers on trees
6. Random Walks on Weighted Graphs, and Applications to On-Line Algorithms
7. Competitive paging algorithms
8. A competitive 2-server algorithm
9. Competitive snoopy caching
10. Competitive algorithms for server problems
11. A strongly competitive randomized paging algorithm