More on randomized on-line algorithms for caching-Reference-Cited by-同舟云学术

More on randomized on-line algorithms for caching

Published:2003-01 Issue:3 Volume:290 Page:1997-2008
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chrobak Marek,Koutsoupias Elias,Noga John

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. Competitive analysis of randomized paging algorithms;Achlioptas;Theoret. Comput. Sci.,2000

2. Limited bookmark randomized online algorithms for the paging problem;Bein;Inform. Process. Lett.,2000

3. Trackless online algorithms for the server problem;Bein;Inform. Process. Lett.,2000

4. Online Computation and Competitive Analysis;Borodin,1998

5. M. Chrobak, E. Koutsoupias, J. Noga, More on randomized on-line algorithms for caching: simplicity vs competitiveness, Technical Report UCR-CSE-01-02, Department of Computer Science and Engineering, University of California, Riverside, 2001.

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

1. Distributed Online Algorithms for the Agent Migration Problem in WSNs;Mobile Networks and Applications;2013-07-14

2. Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms;Automata, Languages, and Programming;2013

3. OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm;Theory of Computing Systems;2012-10-17

4. OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm;Approximation and Online Algorithms;2012

5. Knowledge State Algorithms;Algorithmica;2009-10-17