Author:
Achlioptas Dimitris,Chrobak Marek,Noga John
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. In Proc. 23rd ACM Symposium on Theory of Computing, pages 249–259, 1991. To appear in Journal of Computer and System Sciences.
2. M. Chrobak and L. L. Larmore. An optimal online algorithm for k servers on trees. SIAM Journal on Computing, 20:144–148, 1991.
3. M. Chrobak and L. L. Larmore. Metrical service systems: Randomized strategies. manuscript, 1992.
4. M. Chrobak and L. L. Larmore. Generosity helps or an 11-competitive algorithm for three servers. Journal of Algorithms, 16:234–263, 1994. Also in Proceedings of ACM/SIAM Symposium on Discrete Algorithms, 1992, 196–202.
5. M. Chrobak, L. L. Larmore, N. Reingold, and J. Westbrook. Page migration algorithms using work functions. Technical Report YALE/DCS/RR-910, Department of Yale University, 1992. Submitted for journal publication.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Asymptotically optimal algorithm for online reconfiguration of edge-clouds;Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing;2016-07-05
2. The Worst Page-Replacement Policy;Theory of Computing Systems;2008-05-13
3. The Worst Page-Replacement Policy;Lecture Notes in Computer Science;2007
4. Online Occlusion Culling;Algorithms – ESA 2005;2005
5. Connection caching: model and algorithms;Journal of Computer and System Sciences;2003-08