Author:
Chrobak Marek,Larmore Lawrence L.
Subject
General Computer Science,Theoretical Computer Science
Reference9 articles.
1. A competitive algorithm for three servers;Berman;Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms,1990
2. M. Chrobak and L. Larmore, A new approach to the server problem, SIAM J. Comput., to appear. pear.
3. M. Chrobak and L. Larmore, Fast algorithms for two servers, J. Algorithms, to appear.
4. Random walks on weighted graphs and applications to on-line algorithms;Coppersmith;Proc. 22nd Annual ACM Symp. on Theory of Computing,1990
5. Competitive k-server algorithms;Fiat;Proc. 31st Annual Symp. on Foundations of Computer Science,1990
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The -server problem;Computer Science Review;2009-05
2. Randomized k-server on hierarchical binary trees;Proceedings of the fortieth annual ACM symposium on Theory of computing;2008-05-17
3. Online Distributed Object Migration;Approximation and Online Algorithms;2007
4. SIGACT news online algorithms column 2;ACM SIGACT News;2004-03
5. Online algorithms: a survey;Mathematical Programming;2003-07