Author:
Lund Carsten,Reingold Nick,Westbrook Jeffery,Yan Dicky
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. S. Albers and H. Koga. New On-Line Algorithms for the Page Replication Problem. In Proceedings of the Fourth Scandinavian Workshop on Algorithmic Theory, Aarhus, Denmark, July 1994.
2. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive Distributed File Allocation. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 164–173, 1993.
3. Y. Bartal, A. Fiat, and Y. Rabani. Competitive Algorithms for Distributed Data Management. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 39–50, 1992.
4. S. Ben David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the Power of Randomization in Online Algorithms. In Proceedings of the 22nd ACM Symposium on Theory of Computing, pages 379–386, 1990.
5. D. L. Black and D. D. Sleator. Competitive Algorithms for Replication and Migration Problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie Mellon University, 1989.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New results for online page replication;Theoretical Computer Science;2004-09
2. Competitive distributed file allocation;Information and Computation;2003-08
3. On the Bahncard problem;Theoretical Computer Science;2001-10
4. On page migration and other relaxed task systems;Theoretical Computer Science;2001-10
5. Online algorithms for page replication in rings;Theoretical Computer Science;2001-10