Author:
Albers Susanne,Koga Hisashi
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. B. Awerbuch, Y. Bartal and A. Fiat. Competitive distributed file allocation. In Proc. 25th Annual ACM Symposium on Theory of Computing, pages 164–173, 1993.
2. Y. Bartal, A. Fiat and Y. Rabani. Competitive algorithms for distributed data management. In Proc. 24th Annual ACM Symposium on Theory of Computing, pages 39–50, 1992.
3. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, special issue on on-line algorithms, 11(1):2–14, 1994.
4. D.L. Black and D.D. Sleator. Competitive algorithms for replication and migration problems. Technical Report Carnegie Mellon University, CMU-CS-89-201, 1989.
5. M. Chrobak, L.L. Larmore, N. Reingold and J. Westbrook. Page migration algorithms using work functions. In Proc. 4th International Annual Symposium on Algorithms and Complexity, Springer LNCS Vol. 762, pages 406–415, 1993.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distributed paging;Online Algorithms;1998
2. On the Bahncard Problem;Lecture Notes in Computer Science;1998
3. Page migration with limited local memory capacity;Lecture Notes in Computer Science;1995
4. On-line distributed data management;Algorithms — ESA '94;1994