Randomized algorithms for metrical task systems

Theoretical Computer Science

Volumn 194, Issue 1-2, 1998, Pages 163-182

  Irani, Sandy ^a   Seiden, Steve ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0342581046     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00006-6     Document Type: Article

References (14)

1. S. Ben-David, A. Borodin, R. Karp. G. Tardos et al., On the power of randomization in on-line algorithms, Algorithmica 11 (1994) 2-14.
2. A. Blum, H. Karloff, Y. Rabani and M. Saks, A decomposition theorem and bounds for randomized server problems, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science (FOCS) (1992) 197-207.
3. A. Borodin, N. Linial and M.E. Saks, An optimal on-line algorithm for metrical task systems, J. ACM 39 (1992) 745-763.
4. W.R. Burley, Traversing layered graphs using the work function algorithm, Tech. Report CS93-319, University of California, San Diego, 1993.
5. W. Burley and S. Irani, On algorithm design for metrical task systems, in: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (1995) 420-429. Algorithmica, to appear.
6. W. Burley and S. Irani, On algorithm design for metrical task systems, in: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (1995) 420-429. Algorithmica, to appear.
7. M. Chrobak and L.L. Larmore, Server problems and on-line games, in: Proc. DIMACS Workshop on On-line Algorithms (1991) 11-64.
8. M. Chrobak and J. Noga, unpublished manuscript.
9. S. Irani and S.S. Seiden, Randomized algorithms for metrical task systems, in: Proc. 4th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 955 (Springer, Berlin, 1995) 159-170.
10. A.R. Karlin, M.S. Manasse, L.A. McGeoch and S. Owicki, Competitive randomized algorithms for non-uniform problems, Algorithmica 11 (1994) 542-571.
11. M.S. Manasse, L.A. McGeoch and D.D. Sleator, Competitive algorithms for server problems, J. Algorithms 11 (1990) 208-230.
12. D.D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28 (1985) 202-208.
13. D.D. Sleator and R.E. Tarjan, Self adjusting binary search trees, J. ACM 32 (1985) 652-686.
14. J. Westbrook, Randomized algorithms for multiprocessor page migration, in: Proc. DIMACS Workshop on On-line Algorithms, 1992.