Competitive algorithms for the weighted list update problem

DOI10.1007/BFB0028266MaRDI QIDQ4037423zbMATH OpenFDO

Authors Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028266

zbMATH Keywords

2-competitivitycounting move-to-frontmove-to-front heuristiconline algorithmsrandom move-to-front

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• The weighted list update problem and the lazy adversary
• Improved Randomized On-Line Algorithms for the List Update Problem
• Two results on the list update problem
• Randomized competitive algorithms for the list update problem
• scientific article; zbMATH DE number 910898

Cited in

(7)

• The weighted list update problem and the lazy adversary
• The list update problem and the retrieval of sets
• Revisiting the COUNTER algorithms for list update
• Improved Randomized On-Line Algorithms for the List Update Problem
• scientific article; zbMATH DE number 910898 (Why is no real title available?)
• The list update problem and the retrieval of sets
• A combined BIT and TIMESTAMP algorithm for the list update problem

This page was built for publication: Competitive algorithms for the weighted list update problem

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