Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. New on-line algorithms for the page replication problem;Albers;J. Algorithms,1998
2. B. Awerbuch, Y. Bartal, A. Fiat, Competitive distributed file alocation. Proc. 25th Ann. ACM Symp. on Theory of Computing, 1993, pp. 164–173.
3. Y. Bartal, A. Fiat, Y. Rabani, Competitive algorithms for distributed data management. Proc. 24th Ann. ACM Symp. on Theory of Computing, 1992, pp. 39–50.
4. On the power of randomization in online algorithms;Ben-David;Algorithmica,1991
5. D.L. Black, D.D. Sleator, Competitive algorithms for replication and migration problems. Tech. Rep. CMU-CS-89-201 Carnegie Mellon University, 1989.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Migrating and replicating data in networks;Computer Science - Research and Development;2011-04-12
2. Optimal algorithms for page migration in dynamic networks;Journal of Discrete Algorithms;2009-12
3. New results for online page replication;Theoretical Computer Science;2004-09