Amortized efficiency of list update and paging rules
Communications of the ACM
Two results on the list update problem
Information Processing Letters
A lower bound for randomized list update algorithms
Information Processing Letters
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth 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
Two New Families of List Update Algorithms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Offline List Update is NP-Hard
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Optimal strategies for the list update problem under the MRM alternative cost model
Information Processing Letters
Online distributed object migration
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |