On the Influence of Lookahead in Competitive Paging Algorithms, Algorithmica, vol.18, issue.3, pp.283-305, 1997. ,
Improved Randomized On-Line Algorithms for the List Update Problem, SIAM Journal on Computing, vol.27, issue.3, pp.682-693, 1998. ,
On paging with locality of reference, Journal of Computer and System Sciences, vol.70, issue.2, pp.145-175, 2005. ,
On list update with locality of reference, Journal of Computer and System Sciences, vol.82, issue.5, pp.627-653, 2016. ,
Average Case Analyses of List Update Algorithms, with Applications to Data Compression, Algorithmica, vol.21, issue.3, pp.312-329, 1998. ,
A combined BIT and TIMESTAMP algorithm for the list update problem, Information Processing Letters, vol.56, issue.3, pp.135-139, 1995. ,
Self-organizing data structures, Online Algorithms, vol.1442, pp.13-51, 1998. ,
Optimal lower bounds for projective list update algorithms, ACM Transactions on Algorithms, vol.9, issue.4, pp.1-18, 2013. ,
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
List Update with Locality of Reference, Lecture Notes in Computer Science, pp.399-410 ,
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
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
On the Competitive Theory and Practice of Online List Accessing Algorithms, Algorithmica, vol.32, issue.2, pp.201-245, 2002. ,
Modeling Locality: A Probabilistic Analysis of LRU and FWF, Algorithms ? ESA 2004, vol.3221, pp.98-109, 2004. ,
A new measure for the study of on-line algorithms, Algorithmica, vol.11, issue.1, pp.73-91, 1994. ,
On randomization in online computation, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference ,
Competitive Paging with Locality of Reference, Journal of Computer and System Sciences, vol.50, issue.2, pp.244-258, 1995. ,
A theoretical comparison of LRU and LRU-K, Acta Informatica, vol.47, issue.7-8, pp.359-374, 2010. ,
The relative worst order ratio for online algorithms, ACM Transactions on Algorithms, vol.3, issue.2, p.22, 2007. ,
The relative worst-order ratio applied to paging, Journal of Computer and System Sciences, vol.73, issue.5, pp.818-843, 2007. ,
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis, Algorithm Theory ? SWAT 2012, pp.328-339, 2012. ,
Relative interval analysis of paging algorithms on access graphs, Theoretical Computer Science, vol.568, pp.28-48, 2015. ,
A Comparison of Performance Measures for Online Algorithms, Algorithmica, vol.72, issue.4, pp.969-994, 2014. ,
A comparison of performance measures via online search, Theoretical Computer Science, vol.532, pp.2-13, 2014. ,
The relative worst order ratio applied to seat reservation, ACM Transactions on Algorithms, vol.4, issue.4, pp.1-22, 2008. ,
On Algorithm Design for Metrical Task Systems, Algorithmica, vol.18, issue.4, pp.461-485, 1997. ,
A block-sorting lossless data compression algorithm, 1994. ,
LRU Is Better than FIFO, Algorithmica, vol.23, issue.2, pp.180-185, 1999. ,
The working set model for program behavior, Communications of the ACM, vol.11, issue.5, pp.323-333, 1968. ,
On the relative dominance of paging algorithms, Theoretical Computer Science, vol.410, issue.38-40, pp.3694-3701, 2009. ,
Parameterized Analysis of Paging and List Update Algorithms, Algorithmica, vol.71, issue.2, pp.330-353, 2013. ,
On Developing New Models, with Paging as a Case Study, ACM SIGACT News, vol.40, issue.4, pp.98-123, 2010. ,
List update with probabilistic locality of reference, Information Processing Letters, vol.112, issue.13, pp.540-543, 2012. ,
There are infinitely many competitive-optimal online list accessing algorithms. Discussion paper ,
Self-organizing linear search, ACM Computing Surveys, vol.17, issue.3, pp.295-311, 1985. ,
Two results on the list update problem, Information Processing Letters, vol.38, issue.6, pp.301-306, 1991. ,
Strongly Competitive Algorithms for Paging with Locality of Reference, SIAM Journal on Computing, vol.25, issue.3, pp.477-497, 1996. ,
A Survey of Algorithms and Models for List Update, Lecture Notes in Computer Science, pp.251-266, 2013. ,
A simpler analysis of Burrows?Wheeler-based compression, Theoretical Computer Science, vol.387, issue.3, pp.220-235, 2007. ,
Markov Paging, SIAM Journal on Computing, vol.30, issue.3, pp.906-922, 2000. ,
Linear waste of best fit bin packing on skewed distributions, Random Structures and Algorithms, vol.20, issue.3, pp.441-464, 2002. ,
Beyond Competitive Analysis, SIAM Journal on Computing, vol.30, issue.1, pp.300-317, 2000. ,
On the competitiveness of the move-to-front rule, Theoretical Computer Science, vol.242, issue.1-2, pp.313-325, 2000. ,
Outperforming LRU with an adaptive replacement cache algorithm, Computer, vol.37, issue.4, pp.58-65, 2004. ,
On the Competitiveness of Linear Search, Algorithms - ESA 2000, vol.1879, pp.338-345, 2000. ,
An optimality proof of the LRU- K page replacement algorithm, Journal of the ACM, vol.46, issue.1, pp.92-112, 1999. ,
On adequate performance measures for paging, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06, pp.487-496, 2006. ,
Randomized competitive algorithms for the list update problem, Algorithmica, vol.11, issue.1, pp.15-32, 1994. ,
Two New Families of List Update Algorithms, Algorithms and Computation, vol.1533, pp.100-109, 1998. ,
Wiley Encyclopedia of Molecular Medicine, 2002. ,
Amortized efficiency of list update and paging rules, Communications of the ACM, vol.28, issue.2, pp.202-208, 1985. ,
A Unified Analysis of Paging and Caching, Algorithmica, vol.20, issue.2, pp.175-200, 1998. ,
Models for compression in full-text retrieval systems, [1991] Proceedings. Data Compression Conference ,
Thek-server dual and loose competitiveness for paging, Algorithmica, vol.11, issue.6, pp.525-541, 1994. ,
Bounding the diffuse adversary, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA '98), pp.420-425, 1998. ,
On-Line Paging Against Adversarially Biased Random Inputs, Journal of Algorithms, vol.37, issue.1, pp.218-235, 2000. ,
On-Line File Caching, Algorithmica, vol.33, issue.3, pp.371-383, 2002. ,