Author:
Bein Wolfgang W.,Chrobak Marek,Larmore Lawrence L.
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Online Computation and Competitive Analysis;Borodin,1998
2. Traversing layered graphs using the work function algorithm;Burley;J. Algorithms,1996
3. New results on server problems;Chrobak;SIAM J. Discrete Math.,1991
4. An optimal online algorithm for k servers on trees;Chrobak;SIAM J. Comput.,1991
5. M. Chrobak, L.L. Larmore, The server problem and on-line games, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 7, 1992, pp. 11–64.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials;Theoretical Computer Science;2024-09
2. Breaking the 2-competitiveness barrier for two servers in a tree;Theoretical Computer Science;2023-10
3. The Randomized -Server Conjecture Is False!;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Online facility assignment;Theoretical Computer Science;2020-02
5. The Mobile Server Problem;ACM Transactions on Parallel Computing;2019-12-05