O. Bahat and A. M. Makowski, Optimal replacement policies for non-uniform cache objects with optional eviction, Proceedings of Infocom 2003, 2003.

E. Cinlar, Introduction to Stochastic Processes, 1975.

J. A. Fill and L. Holst, On the distribution of search cost for the move-to-front rule. Random Structures and Algorithms, p.179, 1996.

P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

G. H. Gonnet, J. I. Munro, and H. Suwanda, Exegesis of Self-Organizing Linear Search, SIAM Journal on Computing, vol.10, issue.3, pp.613-637, 1981.
DOI : 10.1137/0210046

P. R. Jelenkovi´cjelenkovi´c, Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities, Annals of Applied Probability, vol.9, issue.2, pp.430-464, 1999.

P. R. Jelenkovi´cjelenkovi´c, Least-Recently-Used Caching with Zipf's Law Requests, The Sixth INFORMS Telecommunications Conference, 2002.

P. R. Jelenkovi´cjelenkovi´c and A. Radovanovi´cradovanovi´c, Least-recently-used caching with dependent requests, Theoretical Computer Science, vol.326, issue.1-3, pp.293-327, 2004.
DOI : 10.1016/j.tcs.2004.07.029

P. R. Jelenkovi´cjelenkovi´c and A. Radovanovi´cradovanovi´c, Optimizing LRU for variable document sizes, Combinatorics, Probability & Computing, vol.13, pp.1-17, 2004.

P. R. Jelenkovi´cjelenkovi´c and A. Radovanovi´cradovanovi´c, The Persistent-Access-Caching Algorithm, 2004.

Y. C. Kan and S. M. Ross, Optimal list order under partial memory constraints, Journal of Applied Probability, vol.31, issue.04, pp.1004-1015, 1980.
DOI : 10.1017/S0021900200118595

E. J. O-'neil, P. E. Neil, and G. Weikum, An optimality proof of the LRU-K page replacement algorithm, Journal of the ACM, vol.46, issue.1, pp.92-112, 1999.
DOI : 10.1145/300515.300518