On the competitive theory and practice of online list accessing algorithms

DOI10.1007/S00453-001-0069-8MaRDI QIDQ5957574zbMATH OpenOpenAlexFDO

Authors R. Bachrach, Ran El-Yaniv, M. Reinstädtler

Publication date 14 August 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0069-8

zbMATH Keywords

online list accessing problem

Mathematics Subject Classification ID

Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 910898
• Improved Randomized On-Line Algorithms for the List Update Problem
• A new family of randomized algorithms for list accessing
• Online and Offline Access to Short Lists
• Two results on the list update problem

Cited in

(9)

• On the competitiveness of the move-to-front rule
• List factoring and relative worst order analysis
• Weighted forward looking adaptive coding
• Parameterized analysis of paging and list update algorithms
• On list update with locality of reference
• A Survey of Algorithms and Models for List Update
• scientific article; zbMATH DE number 2102774 (Why is no real title available?)
• On the separation and equivalence of paging strategies and other online algorithms
• A 3.3904-competitive online algorithm for list update with uniform costs

This page was built for publication: On the competitive theory and practice of online list accessing algorithms

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