1. S. Albers, H. Koga, New on-line algorithms for the page replication problem, J. Algorithms 27(1) (1998) 75–96. A preliminary version was published in Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT’94), Lecture Notes in Computer Science, vol. 824, Springer, Berlin, 1994, pp. 25–36.
2. Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi, A. Rosén, On capital investment, Proc. 23rd Internat. Colloquium on Automata, Languages and Programming (ICALP’96), Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 429–441.
3. On the power of randomization in on-line algorithms;Ben-David;Algorithmica,1994
4. D.L. Black, D.D. Sleator, Competitive algorithms for replication and migration problems, Tech. Rep. CMU-CS-89-201, Carnegie Mellon University, 1989.
5. Worst-case performance bounds for simple one-dimensional packing algorithms;Johnson;SIAM J. Comput.,1974