A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir, A model for hierarchical memory, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.305-314, 1987.
DOI : 10.1145/28395.28428

B. Awerbuch, Y. Bartal, and A. Fiat, Competitive distributed file allocation, Information and Computation, vol.185, issue.1, pp.1-40, 2003.
DOI : 10.1016/S0890-5401(03)00055-5

Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi et al., On Capital Investment, Algorithmica, vol.25, issue.1, pp.22-36, 1999.
DOI : 10.1007/PL00009281

A. Borodin and R. El-yaniv, Online Computation and Competitive Analysis, 1998.

B. Grant, M. Mock, M. Philipose, C. Chambers, and S. J. Eggers, The benefits and costs of DyC's run-time optimizations, ACM Transactions on Programming Languages and Systems, vol.22, issue.5, pp.932-972, 2000.
DOI : 10.1145/365151.367161

S. Irani, G. Singh, S. Shukla, and R. Gupta, An overview of the competitive and adversarial approaches to designing dynamic power management strategies, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp.1349-61, 2005.
DOI : 10.1109/TVLSI.2005.862725

A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator, Competitive snoopy caching, Algorithmica, vol.28, issue.2, pp.79-119, 1988.
DOI : 10.1007/BF01762111