On the competitive theory and practice of online list accessing algorithms
From MaRDI portal
Publication:5957574
DOI10.1007/s00453-001-0069-8zbMath0990.68075OpenAlexW1529928007MaRDI QIDQ5957574
Ran El-Yaniv, M. Reinstädtler, R. Bachrach
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05)
Related Items (6)
On list update with locality of reference ⋮ Weighted forward looking adaptive coding ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ On the list update problem with advice ⋮ A Survey of Algorithms and Models for List Update ⋮ Parameterized analysis of paging and list update algorithms
This page was built for publication: On the competitive theory and practice of online list accessing algorithms