On competitive on-line paging with lookahead
From MaRDI portal
(Redirected from On competitive on-line paging with lookahead)
Recommendations
Cites work
- A new measure for the study of on-line algorithms
- A strongly competitive randomized paging algorithm
- Competitive paging algorithms
- scientific article; zbMATH DE number 432825 (Why is no real title available?)
- scientific article; zbMATH DE number 1261821 (Why is no real title available?)
- scientific article; zbMATH DE number 910900 (Why is no real title available?)
- On the influence of lookahead in competitive paging algorithms
Cited in
(16)- A competitive analysis of the list update problem with lookahead
- A new measure for the study of on-line algorithms
- On the influence of lookahead in competitive paging algorithms
- Online-bounded analysis
- Combining request scheduling with web caching
- Competitive caching of query results in search engines
- Exact distributional analysis of online algorithms with lookahead
- Beyond Competitive Analysis
- On competitive on-line paging with lookahead
- A competitive analysis of the list update problem with lookahead
- Online computation with advice
- Online bounded analysis
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- Online Algorithms for Weighted Paging with Predictions
- Distributional online weighted paging with limited horizon
- The relative worst-order ratio applied to paging
This page was built for publication: On competitive on-line paging with lookahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276313)
