Optimal strategies for the list update problem under the MRM alternative cost model

DOI10.1016/J.IPL.2011.12.001MaRDI QIDQ437676zbMATH OpenOpenAlexFDO

Authors Alexander Golynski, Alejandro Lopez-Ortiz

Publication date 18 July 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.12.001

zbMATH Keywords

dynamic programmingonline algorithmslist update

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Dynamic programming (90C39) Searching and sorting (68P10)

Recommendations

• Off-line algorithms for the list update problem
• Online and Offline Access to Short Lists
• A Survey of Algorithms and Models for List Update
• List Update with Locality of Reference
• Optimal lower bounds for projective list update algorithms

Cites work

• scientific article; zbMATH DE number 1670645 (Why is no real title available?)
• scientific article; zbMATH DE number 1670671 (Why is no real title available?)
• scientific article; zbMATH DE number 910898 (Why is no real title available?)
• List Update with Locality of Reference
• On Serial Files with Relocatable Records
• On the competitiveness of the move-to-front rule
• Parameterized Analysis of Paging and List Update Algorithms

Cited in

(3)

• scientific article; zbMATH DE number 1670645 (Why is no real title available?)
• Off-line algorithms for the list update problem
• A Survey of Algorithms and Models for List Update

This page was built for publication: Optimal strategies for the list update problem under the MRM alternative cost model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q437676)