1. H. Alborzi, E. Torng, P. Uthaisombut, S. Wagner, The k-client problem, in: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997, pp. 73–82.
2. Sequoia: a fault-tolerant tightly coupled multiprocessor for transaction processing;Bernstein;Computer,1988
3. R. Bhatia, S. Khuller, J. Naor, The loading time scheduling problem, in: Proceedings of the 36th IEEE Conference on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 72–81.
4. A. Borodin, R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, 1998.
5. A theory of plan merging;Foulser;Artif. Intell.,1992