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
Two results on the list update problem
Information Processing Letters
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
Paging for multi-core shared caches
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We consider the list-update problem introduced by Sleator and Tarjan, specializing it to the case of accesses only and focusing on short lists. We describe a new optimal offline algorithm, faster than the best previous algorithm when the number of accesses is sufficiently large relative to the number l of items. We also give a simple optimal offline algorithm for l = 3. Taking cl to denote the best competitive ratio of a randomized online algorithm for the list-access problem with l items, we demonstrate that c3 = 6/5 and give new upper and lower bounds on c4. Finally we prove a strengthened lower bound for general l.