Optimal projective algorithms for the list update problem

DOI10.1007/3-540-45022-X_27MaRDI QIDQ2754153zbMATH OpenFDO

Authors Christoph Ambühl, B. Gärtner, Bernhard von Stengel

Publication date 9 December 2001

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

Full work available at URL https://doi.org/10.1007/3-540-45022-X_27

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Optimal lower bounds for projective list update algorithms
• Two results on the list update problem
• Off-line algorithms for the list update problem
• scientific article; zbMATH DE number 910898
• Improved Randomized On-Line Algorithms for the List Update Problem

Cited in

(6)

• The weighted list update problem and the lazy adversary
• A Survey of Algorithms and Models for List Update
• Optimal lower bounds for projective list update algorithms
• Improved Randomized On-Line Algorithms for the List Update Problem
• scientific article; zbMATH DE number 910898 (Why is no real title available?)
• List update with delays or time windows

This page was built for publication: Optimal projective algorithms for the list update problem

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