OnlineMin: a fast strongly competitive randomized paging algorithm

DOI10.1007/978-3-642-29116-6_14MaRDI QIDQ2896387zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• A strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms
• Competitive analysis of randomized paging algorithms
• Improved space bounds for strongly competitive randomized paging algorithms

Cited in

(17)

• Competitive analysis of randomized paging algorithms
• Limited bookmark randomized online algorithms for the paging problem
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• Online file caching with rejection penalties
• The complexity of paging against a probabilistic adversary
• Engineering efficient paging algorithms
• Paging on a RAM with Limited Resources
• Equitable Revisited
• Competitive paging algorithms
• scientific article; zbMATH DE number 2079385 (Why is no real title available?)
• Competitive analysis of randomized paging algorithms
• The optimal structure of algorithms for \(\alpha\)-paging
• Improved space bounds for strongly competitive randomized paging algorithms
• Knowledge state algorithms
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• Online min-max paging
• A strongly competitive randomized paging algorithm

Describes a project that uses

Uses Software

• OnlineMin

This page was built for publication: OnlineMin: a fast strongly competitive randomized paging algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896387)