Competitive analysis of randomized paging algorithms-Reference-Cited by-同舟云学术

Competitive analysis of randomized paging algorithms

Published:2000-03 Issue:1-2 Volume:234 Page:203-218
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Achlioptas Dimitris,Chrobak Marek,Noga John

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. A. Borodin, S. Irani, P. Raghavan, B. Schieber, Competitive paging with locality of reference, in: Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 249–259.

2. Competitive paging with locality of reference;Borodin;J. Comput. System Sci.,1995

3. An optimal online algorithm for k servers on trees;Chrobak;SIAM J. Comput.,1991

4. M. Chrobak, L.L. Larmore, Metrical service systems: randomized strategies. manuscript, 1992a.

5. M. Chrobak, L.L. Larmore, Generosity helps or an 11-competitive algorithm for three servers, J. Algorithms 16 (1994) 234–263; also in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1992b, pp. 196–202.

Cited by 81 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11

2. Competitive Algorithms for Generalized k -Server in Uniform Metrics;ACM Transactions on Algorithms;2023-01-31

3. JEDI;Proceedings of the 22nd ACM Internet Measurement Conference;2022-10-25

4. Competitive Algorithms for Block-Aware Caching;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

5. Randomized Online Computation with High Probability Guarantees;Algorithmica;2022-01-30