scientific article; zbMATH DE number 910898

MaRDI QIDQ4886073zbMATH OpenFDO

Authors Susanne Albers

Publication date 4 November 1996

zbMATH Keywords

TIMESTAMP algorithms

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Improved Randomized On-Line Algorithms for the List Update Problem
• Randomized competitive algorithms for the list update problem
• Off-line algorithms for the list update problem
• A lower bound for randomized list update algorithms
• The list update problem: Improved bounds for the counter scheme
• Improved Online Algorithms for the Sorting Buffer Problem
• scientific article; zbMATH DE number 1670833
• scientific article; zbMATH DE number 177552
• A Survey of Algorithms and Models for List Update
• A new family of randomized algorithms for list accessing

Cited in

(20)

• A competitive analysis of the list update problem with lookahead
• Two results on the list update problem
• Randomized competitive algorithms for the list update problem
• Off-line algorithms for the list update problem
• On list update and work function algorithms.
• Paid exchanges are worth the price
• scientific article; zbMATH DE number 1670833 (Why is no real title available?)
• Second step algorithms in the Burrows-Wheeler compression algorithm
• A Survey of Algorithms and Models for List Update
• Optimal lower bounds for projective list update algorithms
• scientific article; zbMATH DE number 177552 (Why is no real title available?)
• Optimal strategies for the list update problem under the MRM alternative cost model
• Improved Randomized On-Line Algorithms for the List Update Problem
• scientific article; zbMATH DE number 1862357 (Why is no real title available?)
• scientific article; zbMATH DE number 2102774 (Why is no real title available?)
• On the competitive theory and practice of online list accessing algorithms
• A new lower bound for the list update problem in the partial cost model
• A combined BIT and TIMESTAMP algorithm for the list update problem
• A lower bound for randomized list update algorithms
• A new family of randomized algorithms for list accessing

This page was built for publication:

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