S. Albers, On the Influence of Lookahead in Competitive Paging Algorithms, Algorithmica, vol.18, issue.3, pp.283-305, 1997.

S. Albers, Improved Randomized On-Line Algorithms for the List Update Problem, SIAM Journal on Computing, vol.27, issue.3, pp.682-693, 1998.

S. Albers, L. M. Favrholdt, and O. Giel, On paging with locality of reference, Journal of Computer and System Sciences, vol.70, issue.2, pp.145-175, 2005.

S. Albers and S. Lauer, On list update with locality of reference, Journal of Computer and System Sciences, vol.82, issue.5, pp.627-653, 2016.

S. Albers and M. Mitzenmacher, Average Case Analyses of List Update Algorithms, with Applications to Data Compression, Algorithmica, vol.21, issue.3, pp.312-329, 1998.

S. Albers, B. Von-stengel, and R. Werchner, A combined BIT and TIMESTAMP algorithm for the list update problem, Information Processing Letters, vol.56, issue.3, pp.135-139, 1995.

S. Albers and J. Westbrook, Self-organizing data structures, Online Algorithms, vol.1442, pp.13-51, 1998.

C. Ambühl, B. Gärtner, and B. V. Stengel, Optimal lower bounds for projective list update algorithms, ACM Transactions on Algorithms, vol.9, issue.4, pp.1-18, 2013.

S. Angelopoulos, Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems, Theory of Computing Systems, vol.63, issue.6, pp.1413-1447, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02370843

S. Angelopoulos, R. Dorrigiv, and A. López-ortiz, List Update with Locality of Reference, Lecture Notes in Computer Science, pp.399-410

S. Angelopoulos, M. P. Renault, and P. Schweitzer, Stochastic Dominance and the Bijective Ratio of Online Algorithms, Algorithmica, vol.82, issue.5, pp.1101-1135, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02374526

S. Angelopoulos and P. Schweitzer, Paging and list update under bijective analysis, Journal of the ACM, vol.60, issue.2, pp.1-18, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01185285

. Bachrach, . El-yaniv, and . Reinstädtler, On the Competitive Theory and Practice of Online List Accessing Algorithms, Algorithmica, vol.32, issue.2, pp.201-245, 2002.

L. Becchetti, Modeling Locality: A Probabilistic Analysis of LRU and FWF, Algorithms ? ESA 2004, vol.3221, pp.98-109, 2004.

S. Ben-david and A. Borodin, A new measure for the study of on-line algorithms, Algorithmica, vol.11, issue.1, pp.73-91, 1994.

A. Borodin and R. El-yaniv, On randomization in online computation, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference

A. Borodin, S. Irani, P. Raghavan, and B. Schieber, Competitive Paging with Locality of Reference, Journal of Computer and System Sciences, vol.50, issue.2, pp.244-258, 1995.

J. Boyar, M. R. Ehmsen, J. S. Kohrt, and K. S. Larsen, A theoretical comparison of LRU and LRU-K, Acta Informatica, vol.47, issue.7-8, pp.359-374, 2010.

J. Boyar and L. M. Favrholdt, The relative worst order ratio for online algorithms, ACM Transactions on Algorithms, vol.3, issue.2, p.22, 2007.

J. Boyar, L. M. Favrholdt, and K. S. Larsen, The relative worst-order ratio applied to paging, Journal of Computer and System Sciences, vol.73, issue.5, pp.818-843, 2007.

J. Boyar, S. Gupta, and K. S. Larsen, Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis, Algorithm Theory ? SWAT 2012, pp.328-339, 2012.

J. Boyar, S. Gupta, and K. S. Larsen, Relative interval analysis of paging algorithms on access graphs, Theoretical Computer Science, vol.568, pp.28-48, 2015.

J. Boyar, S. Irani, and K. S. Larsen, A Comparison of Performance Measures for Online Algorithms, Algorithmica, vol.72, issue.4, pp.969-994, 2014.

J. Boyar, K. S. Larsen, and A. Maiti, A comparison of performance measures via online search, Theoretical Computer Science, vol.532, pp.2-13, 2014.

J. Boyar and P. Medvedev, The relative worst order ratio applied to seat reservation, ACM Transactions on Algorithms, vol.4, issue.4, pp.1-22, 2008.

W. R. Burley and S. Irani, On Algorithm Design for Metrical Task Systems, Algorithmica, vol.18, issue.4, pp.461-485, 1997.

M. Burrows and D. J. Wheeler, A block-sorting lossless data compression algorithm, 1994.

M. Chrobak and J. Noga, LRU Is Better than FIFO, Algorithmica, vol.23, issue.2, pp.180-185, 1999.

P. J. Denning, The working set model for program behavior, Communications of the ACM, vol.11, issue.5, pp.323-333, 1968.

R. Dorrigiv, A. A. López-ortiz, and J. I. Munro, On the relative dominance of paging algorithms, Theoretical Computer Science, vol.410, issue.38-40, pp.3694-3701, 2009.

R. Dorrigiv, M. R. Ehmsen, and A. López-ortiz, Parameterized Analysis of Paging and List Update Algorithms, Algorithmica, vol.71, issue.2, pp.330-353, 2013.

R. Dorrigiv and A. López-ortiz, On Developing New Models, with Paging as a Case Study, ACM SIGACT News, vol.40, issue.4, pp.98-123, 2010.

R. Dorrigiv and A. López-ortiz, List update with probabilistic locality of reference, Information Processing Letters, vol.112, issue.13, pp.540-543, 2012.

R. El-yaniv, There are infinitely many competitive-optimal online list accessing algorithms. Discussion paper

J. H. Hester and D. S. Hirschberg, Self-organizing linear search, ACM Computing Surveys, vol.17, issue.3, pp.295-311, 1985.

S. Irani, Two results on the list update problem, Information Processing Letters, vol.38, issue.6, pp.301-306, 1991.

S. Irani, A. R. Karlin, and S. Phillips, Strongly Competitive Algorithms for Paging with Locality of Reference, SIAM Journal on Computing, vol.25, issue.3, pp.477-497, 1996.

S. Kamali and A. López-ortiz, A Survey of Algorithms and Models for List Update, Lecture Notes in Computer Science, pp.251-266, 2013.

H. Kaplan, S. Landau, and E. Verbin, A simpler analysis of Burrows?Wheeler-based compression, Theoretical Computer Science, vol.387, issue.3, pp.220-235, 2007.

A. R. Karlin, S. J. Phillips, and P. Raghavan, Markov Paging, SIAM Journal on Computing, vol.30, issue.3, pp.906-922, 2000.

C. Kenyon and M. Mitzenmacher, Linear waste of best fit bin packing on skewed distributions, Random Structures and Algorithms, vol.20, issue.3, pp.441-464, 2002.

E. Koutsoupias and C. H. Papadimitriou, Beyond Competitive Analysis, SIAM Journal on Computing, vol.30, issue.1, pp.300-317, 2000.

C. Mart??nez and S. Roura, On the competitiveness of the move-to-front rule, Theoretical Computer Science, vol.242, issue.1-2, pp.313-325, 2000.

N. Megiddo and D. S. Modha, Outperforming LRU with an adaptive replacement cache algorithm, Computer, vol.37, issue.4, pp.58-65, 2004.

J. I. Munro, On the Competitiveness of Linear Search, Algorithms - ESA 2000, vol.1879, pp.338-345, 2000.

E. J. O'neil, P. E. O'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.

K. Panagiotou and A. Souza, On adequate performance measures for paging, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06, pp.487-496, 2006.

N. Reingold, J. Westbrook, and D. D. Sleator, Randomized competitive algorithms for the list update problem, Algorithmica, vol.11, issue.1, pp.15-32, 1994.

F. Schulz, Two New Families of List Update Algorithms, Algorithms and Computation, vol.1533, pp.100-109, 1998.

A. Silberschatz, P. B. Galvin, and G. Gagne, Wiley Encyclopedia of Molecular Medicine, 2002.

D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, vol.28, issue.2, pp.202-208, 1985.

E. Torng, A Unified Analysis of Paging and Caching, Algorithmica, vol.20, issue.2, pp.175-200, 1998.

I. H. Witten, T. C. Bell, and C. G. Nevill, Models for compression in full-text retrieval systems, [1991] Proceedings. Data Compression Conference

N. E. Young, Thek-server dual and loose competitiveness for paging, Algorithmica, vol.11, issue.6, pp.525-541, 1994.

N. E. Young, Bounding the diffuse adversary, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA '98), pp.420-425, 1998.

N. E. Young, On-Line Paging Against Adversarially Biased Random Inputs, Journal of Algorithms, vol.37, issue.1, pp.218-235, 2000.

N. E. Young, On-Line File Caching, Algorithmica, vol.33, issue.3, pp.371-383, 2002.