OnlineMin

swMATH12059MaRDI QIDQ23993FDOQ23993

Author name not available (Why is that?)

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)

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

This page was built for software: OnlineMin