Amortized efficiency of list update and paging rules
Communications of the ACM
ACM Computing Surveys (CSUR)
Two results on the list update problem
Information Processing Letters
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
Self-Organizing Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
On paging with locality of reference
Journal of Computer and System Sciences
Algorithmic foundations of the internet
ACM SIGACT News
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio for on-line algorithms
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A simpler analysis of burrows-wheeler based compression
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An Application of Self-organizing Data Structures to Compression
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
On the relative dominance of paging algorithms
Theoretical Computer Science
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Optimal strategies for the list update problem under the MRM alternative cost model
Information Processing Letters
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
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Paging and list update under bijective analysis
Journal of the ACM (JACM)
| Hi-index | 0.00 |
It is known that in practice, request sequences for the list update problem exhibit a certain degree of locality of reference. Motivated by this observation we apply the locality of reference model for the paging problem due to Albers et al. [STOC 2002/JCSS 2005] in conjunction with bijective analysis [SODA 2007] to list update. Using this framework, we prove that Move-to-Front (MTF) is the unique optimal algorithm for list update. This addresses the open question of defining an appropriate model for capturing locality of reference in the context of list update [Hester and Hirschberg ACM Comp. Surv. 1985]. Our results hold both for the standard cost function of Sleator and Tarjan [CACM 1985] and the improved cost function proposed independently by Martínez and Roura [TCS 2000] and Munro [ESA 2000]. This result resolves an open problem of Martínez and Roura, namely proposing a measure which can successfully separate MTF from all other list-update algorithms.