On the competitiveness of the move-to-front rule

DOI10.1016/S0304-3975(98)00264-3zbMath0947.68166WikidataQ61734812 ScholiaQ61734812MaRDI QIDQ1575556

Salvador Roura, Conrado Martínez

Publication date: 21 August 2000

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

zbMATH Keywords

competitive analysison-line algorithmsmove-to-front rulelist update problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (5)

Optimal strategies for the list update problem under the MRM alternative cost model ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ List Update with Locality of Reference ⋮ A Survey of Algorithms and Models for List Update ⋮ On list update and work function algorithms.

Cites Work

• Two results on the list update problem
• On the power of randomization in on-line algorithms
• Randomized competitive algorithms for the list update problem
• Competitive \(k\)-server algorithms
• Competitive paging with locality of reference
• Competitive algorithms for server problems
• Exegesis of Self-Organizing Linear Search
• Competitive paging algorithms
• On self-organizing sequential search heuristics
• An optimal on-line algorithm for metrical task system
• Strongly Competitive Algorithms for Paging with Locality of Reference
• Unnamed Item
• Unnamed Item

This page was built for publication: On the competitiveness of the move-to-front rule