On the competitive theory and practice of online list accessing algorithms

DOI10.1007/S00453-001-0069-8zbMATH Open0990.68075OpenAlexW1529928007MaRDI QIDQ5957574FDOQ5957574

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

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

zbMATH Keywords

online list accessing problem

Mathematics Subject Classification ID

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

Cited In (7)

• On list update with locality of reference
• Parameterized analysis of paging and list update algorithms
• Weighted forward looking adaptive coding
• List factoring and relative worst order analysis
• Title not available (Why is that?)
• A Survey of Algorithms and Models for List Update
• On the separation and equivalence of paging strategies and other online algorithms

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)