Unfair Problems and Randomized Algorithms for Metrical Task Systems

Information and Computation

Volumn 148, Issue 2, 1999, Pages 219-240

  Seiden, Steve ^a,b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000368692     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2744     Document Type: Article

References (18)

1. Bartal, Y. (1996), Probabalistic approximation of metric space and its algorithmic applications, in "Proc. 37th IEEE Symposium on Foundations of Computer Science," pp. 183-193.
2. Bartal, Y., Blum, A, Burch, C., and Tomkins, A., A polylog(n)-competitive algorithm for metrical task systems, in "Proc. 29th ACM Symposium on Theory of Computing," pp. 711-719.
3. Ben-David, S., Borodin, A., Karp, R., Tardos, G., and Wigderson, A. (1990), On the power of randomization in online algorithms, in "Proc. 22nd ACM Symposium on Theory of Computing," pp. 379-386.
4. Blum, A., Furst, M., and Tomkins, A., What to do with your free time: On-line algorithms for infrequent request, unpublished manuscript.
5. Blum, A., Karloff, H., Rabani, Y., and Saks, M., (1992), A decomposition theorem and bounds for randomized server problems, in "Proc. 33rd Symposium on Foundations of Computer Science," pp. 197-207.
6. Blum, A., Raghavan, P., and Schieber, B. (1991), Navigating in unfamiliar geometric terrain, in "Proc. 23th ACM Symposium on Theory of Computing," pp. 494-504.
7. Borodin, A., Linial, N., and Saks, M. (1992), An optimal online algorithm for metrical task system, J. Assoc. Comput. Mach. 39(4), 745-763.
8. Chrobak, M., and Larmore, L. L. (1991), Server problems and on-line games, in "Proc. DIMACS Workshop on On-Line Algorithms," pp. 11-64.
9. Chrobak, M., and Noga, J., unpublished manuscript.
10. Irani, S., and Seiden, S. S., Randomized algorithms for metrical task systems, Theoret. Comput. Sci. 194(1-2), 163-182.
11. Irani, S., and Seiden, S. S. (1995), Randomized algorithms for metrical task systems, in "Proc. 4th Workshop on Algorithms and Data Structures," pp. 159-170.
12. Karlin, A., Manasse, M., McGeoch, L., and Owicki, S. (1994), Competitive randomized algorithms for nonuniform problems, Algorithmica 11(6), 542-571.
13. Karlin, A., Manasse, M., Rudolph, L., and Sleator, D. (1988), Competitive snoopy caching, Algorithmica 3(1), 79-119.
14. Lund, C., and Reingold, N., (1994), Linear programs for randomized on-line algorithms, in "Proc. 5th ACM-SIAM Symposium on Discrete Algorithms," pp. 382-391.
15. Manasse, M., McGeoch, L., and Sleator, D., (1990), Competitive algorithms for server problems, J. Algorithms 11(2), 208-230.
16. Sleator, D., and Tarjan, R. (1985), Amortized efficiency of list update and paging rules, Com. ACM 28(2), 202-208.
17. Sleator, D., and Tarjan, R. (1985), Self adjusting binary search trees, J. Assoc. Comput. Mach. 32(3), 652-686.
18. Westbrook, J., (1992), Randomized algorithms for multiprocessor page migration, in "Proc. DIMACS Workshop on On-line Algorithms," pp. 135-149.