Amortized efficiency of list update and paging rules
Communications of the ACM
Improved randomized on-line algorithms for the list update problem
Proceedings of the sixth 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
Offline List Update is NP-Hard
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the Competitiveness of Linear Search
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Toward self-organizing linear search
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
| Hi-index | 0.89 |
We give an explicit representation for the offline optimum strategy for list update under the MRM model of Martinez and Roura [C. Martinez, S. Roura, On the competitiveness of the move-to-front rule, Theoret. Comput. Sci. 242 (1-2) (2000) 3130-325] and Munro [J.I. Munro, On the competitiveness of linear search, in: Proc. 8th Annual European Symposium on Algorithms (ESA 2000), in: Lecture Notes in Comput. Sci., vol. 1879, 2000, pp. 338-345] and give an O(n^3) algorithm to compute it. This is in contrast to the standard model of Sleator and Tarjan [D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM 28 (2) (1985) 202-208] under which computing the offline optimum was shown to be NP-hard [C. Ambuhl, Offline list update is NP-hard, in: Proc. 8th Annual European Symposium on Algorithms (ESA 2000), in: Lecture Notes in Comput. Sci., vol. 1879, 2000, pp. 42-51]. This algorithm follows from a new characterization theorem for realizable visiting sequences in the MRM model.