Paging and list update under bijective analysis
From MaRDI portal
Publication:5395706
DOI10.1145/2450142.2450143zbMath1281.68244OpenAlexW2045732032WikidataQ114071350 ScholiaQ114071350MaRDI QIDQ5395706
Pascal Schweitzer, Spyros Angelopoulos
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2450142.2450143
Theory of data (68P99) Theory of operating systems (68N25) Algorithms in computer science (68W99) Online algorithms; streaming algorithms (68W27)
Related Items (10)
Quantifying Competitiveness in Paging with Locality of Reference ⋮ Best-of-both-worlds analysis of online search ⋮ On the absolute approximation ratio for first fit and related results ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Unnamed Item ⋮ Quantifying competitiveness in paging with locality of reference ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ A Survey of Algorithms and Models for List Update ⋮ Unnamed Item
This page was built for publication: Paging and list update under bijective analysis
