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
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Two results on the list update problem
Information Processing Letters
The weighted list update problem and the lazy adversary
Theoretical Computer Science
A lower bound for randomized list update algorithms
Information Processing Letters
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
Off-line algorithms for the list update problem
Information Processing Letters
A competitive analysis of the list update problem with lookahead
Theoretical Computer Science
Online computation and competitive analysis
Online computation and competitive analysis
Improved randomized on-line algorithms for the list update problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science
Optimal Projective Algorithms for the List Update Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Self-Organizing Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Paging for multi-core shared caches
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Optimal strategies for the list update problem under the MRM alternative cost model
Information Processing Letters
| Hi-index | 0.01 |
In the offline list update problem, we maintain an unsorted linear list used as a dictionary. Accessing the item at position i in the list costs i units. In order to reduce access cost, we are allowed to update the list at any time by transposing consecutive items at a cost of one unit. Given a sequence σ of requests one has to serve in turn, we are interested in the minimal cost needed to serve all requests. Little is known about this problem. The best algorithm so far needs exponential time in the number of items in the list. We show that there is no polynomial algorithm unless P = NP.