OnlineMin

MaRDI QIDQ23993swMATHFDO

Official website http://link.springer.com/article/10.1007%2Fs00224-012-9427-y

Described by source

• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm

Cited in

(5)

• Online file caching with rejection penalties
• The optimal structure of algorithms for \(\alpha\)-paging
• Engineering efficient paging algorithms
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• OnlineMin: a fast strongly competitive randomized paging algorithm

This page was built for software: OnlineMin