Paging and list update under bijective analysis
From MaRDI portal
Publication:5395706
DOI10.1145/2450142.2450143zbMath1281.68244WikidataQ114071350 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
68P99: Theory of data
68N25: Theory of operating systems
68W99: Algorithms in computer science
68W27: Online algorithms; streaming algorithms
Related Items
Unnamed Item, Unnamed Item, 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, 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, Quantifying Competitiveness in Paging with Locality of Reference