Competitive Algorithms for Relaxed List Update and Multilevel Caching
From MaRDI portal
Publication:4943079
DOI10.1006/jagm.1999.1061zbMath0951.68179OpenAlexW2067972761MaRDI QIDQ4943079
Publication date: 28 August 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1061
Related Items
More on weighted servers or FIFO is better than LRU. ⋮ Calculating lower bounds for caching problems ⋮ Online file caching with rejection penalties
This page was built for publication: Competitive Algorithms for Relaxed List Update and Multilevel Caching
