On-line Algorithms

• S. Albers and H. Koga: New On-Line Algorithms for the Page Replication Problem, in Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), Lecture Notes in Computer Science, Vol. 824, pp. 27-36, 1994. Abstract Paper(dvi.gz) Paper(ps.gz)
• S. Albers and H. Koga: A New Framework on the Constrained Migration Problem, IPSJ SIG Notes 94-AL-42-5, IPSJ, 1994.
• S. Albers and H. Koga: Direct-mapped Constrained Migration Problem, Technical Report 94-13, Department of Information Science, University of Tokyo, 1994. Abstract Paper(ps.gz)
• S. Albers and H. Koga: Page Migration with Limited Local Memory Capacity, in Proceedings of the 4th International Workshop on Algorithms and Data Structure (WADS'95), Lecture Notes in Computer Science, Vol. 955, pp. 147-158, 1995. Abstract Paper(ps)
• Y. Dai, H. Imai, K. Iwano, and N. Katoh: A New Approach to Semi-Online Problems, IPSJ SIG Notes 92-AL-29-6, IPSJ, 1992, (in Japanese).
• Y. Dai, H. Imai, K. Iwano, and N. Katoh: How to Treat Delete Requests in Semi-Online Problems, in Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93), Lecture Notes in Computer Science, Vol. 762, pp. 48-57, 1993.
• H. Koga: Randomized On-Line Algorithms for the Page Replication Problem, in Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93), Lecture Notes in Computer Science, Vol. 762, pp. 436-445, 1993. Abstract Paper(ps.gz)
• H. Koga: On-Line Algorithms for Distributed Shared Memory, IPSJ SIG Notes 93-AL-33-7, IPSJ, 1993, (in Japanese).
• H. Koga: Randomized On-Line Algorithms for the Page Replication Problem, Technical Report 94-8, Department of Information Science, University of Tokyo, 1994. Abstract Paper(ps)
• T. Matsumoto: Competitive Analysis of the Round Robin Algorithms, in Proceedings of the 3rd International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 650, pp. 71-77, 1992.