Author:
Chrobak Marek,Sgall Jiřı́
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Competitive analysis of randomized paging algorithms;Achlioptas;Theoret. Comput. Sci.,2000
2. Searching in the plane;Baeza-Yates;Inform. and Comput.,1993
3. Y. Bartal, A. Blum, C. Burch, A. Tomkins, A polylog(n)-competitive algorithm for metrical task systems, in: Proc. 29th Symp. Theory of Computing (STOC), ACM, New York, 1997, pp. 711–719.
4. A randomized algorithm for two servers on the line;Bartal;Inform. and Comput.,2000
5. The harmonic k-server algorithm is competitive;Bartal;J. ACM,2000
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献