On page migration and other relaxed task systems-Reference-Cited by-同舟云学术

On page migration and other relaxed task systems

Published:2001-10 Issue:1 Volume:268 Page:43-66
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bartal Yair,Charikar Moses,Indyk Piotr

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. S. Albers, H. Koga, Page migration with limited local memory capacity, Proc. 4th Workshop on Algorithms and Data Structures, August 1995.

2. B. Awerbuch, Y. Azar, Y. Bartal, On-line generalized Steiner problem, Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, January 1996, pp. 68–74.

3. B. Awerbuch, Y. Bartal, A. Fiat, Competitive distributed file allocation, Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 164–173.

4. B. Awerbuch, Y. Bartal, A. Fiat, Heat & Dump: randomized competitive distributed paging, Proc. 34th IEEE Symp. on Foundations of Computer Science, IEEE, New York, November 1993, pp. 22–31.

5. Distributed paging for general networks;Awerbuch;J. Algorithms,1998

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

1. Toward Online Mobile Facility Location on General Metrics;Theory of Computing Systems;2023-10-06

2. Managing Multiple Mobile Resources;Theory of Computing Systems;2021-01-11

3. Similarity Caching: Theory and Algorithms;IEEE/ACM Transactions on Networking;2021

4. Similarity Caching: Theory and Algorithms;IEEE INFOCOM 2020 - IEEE Conference on Computer Communications;2020-07

5. A $$3+\varOmega (1)$$ Lower Bound for Page Migration;Algorithmica;2020-03-23