Off-line algorithms for the list update problem

DOI10.1016/S0020-0190(96)00144-5MaRDI QIDQ1350929zbMATH OpenOpenAlexFDO

Authors Nick Reingold, Jeffery R. Westbrook

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/s0020-0190(96)00144-5

zbMATH Keywords

Analysis of algorithmsCompetitive analysisOn-line algorithmsList updatOff-line algorithmsSequential search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Online and Offline Access to Short Lists
• scientific article; zbMATH DE number 1670645
• Optimal strategies for the list update problem under the MRM alternative cost model
• Two results on the list update problem
• A Survey of Algorithms and Models for List Update

Cites work

• scientific article; zbMATH DE number 3957110 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 910898 (Why is no real title available?)
• A lower bound for randomized list update algorithms
• An Account of Self-Organizing Systems
• Generation of Permutations by Adjacent Transposition
• On Serial Files with Relocatable Records
• On a model for storage and search
• On self-organizing sequential search heuristics
• Randomized competitive algorithms for the list update problem
• Self-organizing sequential search and Hilbert's inequalities
• Two results on the list update problem

Cited in

(22)

• scientific article; zbMATH DE number 1670833 (Why is no real title available?)
• Improved Randomized On-Line Algorithms for the List Update Problem
• The weighted list update problem and the lazy adversary
• A combined BIT and TIMESTAMP algorithm for the list update problem
• Randomized competitive algorithms for the list update problem
• A Survey of Algorithms and Models for List Update
• Self-adjusting grid networks
• Optimal strategies for the list update problem under the MRM alternative cost model
• Revisiting the COUNTER algorithms for list update
• Self-adjusting linear networks
• List update with probabilistic locality of reference
• scientific article; zbMATH DE number 1670645 (Why is no real title available?)
• scientific article; zbMATH DE number 910898 (Why is no real title available?)
• On list update and work function algorithms.
• A lower bound for randomized list update algorithms
• Online and Offline Access to Short Lists
• Average case analyses of list update algorithms, with applications to data compression
• Parameterized analysis of paging and list update algorithms
• The list update problem and the retrieval of sets
• The list update problem and the retrieval of sets
• A new lower bound for the list update problem in the partial cost model
• Paid exchanges are worth the price

This page was built for publication: Off-line 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 Q1350929)