OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm

DOI10.1007/978-3-642-29116-6_14zbMath1242.68375OpenAlexW1602169857MaRDI QIDQ2896387

Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu

Publication date: 16 July 2012

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_14

Mathematics Subject Classification ID

Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (4)

The optimal structure of algorithms for \(\alpha\)-paging ⋮ Engineering Efficient Paging Algorithms ⋮ Unnamed Item ⋮ Online file caching with rejection penalties

Uses Software

• OnlineMin

This page was built for publication: OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm