Limited bookmark randomized online algorithms for the paging problem
From MaRDI portal
Recommendations
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- OnlineMin: a fast strongly competitive randomized paging algorithm
- Improved space bounds for strongly competitive randomized paging algorithms
- A strongly competitive randomized paging algorithm
- Competitive analysis of randomized paging algorithms
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- A competitive 2-server algorithm
- Competitive analysis of randomized paging algorithms
- Competitive paging with locality of reference
- HARMONIC is 3-competitive for two servers
- More on randomized on-line algorithms for caching.
- Trackless online algorithms for the server problem
Cited in
(5)
This page was built for publication: Limited bookmark randomized online algorithms for the paging problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607066)