Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A locally adaptive data compression scheme
Communications of the ACM
Self-organizing sequential search and Hilbert's inequalities
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Two results on the list update problem
Information Processing Letters
A lower bound for randomized list update algorithms
Information Processing Letters
Randomized algorithms
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
Improved Randomized On-Line Algorithms for the List Update Problem
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the competitiveness of the move-to-front rule
Theoretical Computer Science
On self-organizing sequential search heuristics
Communications of the ACM
SIAM Journal on Computing
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On the Competitiveness of Linear Search
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Dynamic optimality for skip lists and B-trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Toward self-organizing linear search
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
On List Update with Locality of Reference
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
An Application of Self-organizing Data Structures to Compression
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
List update with probabilistic locality of reference
Information Processing Letters
| Hi-index | 0.00 |
In this paper we study the performance of list update algorithms under arbitrary distributions that exhibit strict locality of reference and prove that Move-to-Front (MTF) is the best list update algorithm under any such distribution. Furthermore, we study the working set property of online list update algorithms. The working set property indicates the good performance of an online algorithm on sequences with locality of reference. We show that no list update algorithm has the working set property. Nevertheless, we can distinguish among list update algorithms by comparing their performance in terms of the working set bound. We prove bounds for several well known list update algorithms and conclude that MTF attains the best performance in this context as well.