1. A polylog(n)-competitive algorithm for metrical task systems;Bartal,1997
2. On-line learning and the metrical task system problem;Blum,1997
3. A. Blum, H.J. Karloff, Y. Rabani, M.E. Saks, A decomposition theorem and bounds for randomized server problems, in: FOCS, 1992, pp. 197–207
4. Online Computation and Competitive Analysis;Borodin,1998
5. An optimal online algorithm for metrical task systems;Borodin,1987