A randomized algorithm for two servers on the line

Authors:
Yair Bartal;Marek Chrobak;Lawrence L. Larmore
Affiliations:
Bell-Labs, Murray Hill, NJ;Univ. of California, Riverside, CA;Univ. of Nevada, Las Vegas, Nevada
Venue:
Information and Computation
Year:
2000

A general decomposition theorem for the k-server problem

Information and Computation
A General Decomposition Theorem for the k-Server Problem

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Randomized k-server algorithms for growth-rate bounded graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Barely random algorithms for multiprocessor scheduling

Journal of Scheduling - Special issue: On-line scheduling
The weighted 2-server problem

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Randomized k-server algorithms for growth-rate bounded graphs

Journal of Algorithms

Hi-index	0.00