On list update and work function algorithms.

DOI10.1016/S0304-3975(01)00253-5zbMath1061.68056MaRDI QIDQ1853486

Eric J. Anderson, Anna R. Karlin, Kirsten Hildrum, April Rasala, Michael E. Saks

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combined BIT and TIMESTAMP algorithm for the list update problem
• A lower bound for randomized list update algorithms
• Online algorithms. The state of the art
• Two results on the list update problem
• Off-line algorithms for the list update problem
• On the competitiveness of the move-to-front rule
• Competitive algorithms for server problems
• Self-adjusting binary search trees
• On the k -server conjecture
• Improved Randomized On-Line Algorithms for the List Update Problem
• Traversing Layered Graphs Using the Work Function Algorithm

This page was built for publication: On list update and work function algorithms.