On competitive on-line paging with lookahead
From MaRDI portal
Publication:4593963
Recommendations
Cited in
(6)- A competitive analysis of the list update problem with lookahead
- A competitive analysis of the list update problem with lookahead
- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
- On the influence of lookahead in competitive paging algorithms
- A new measure for the study of on-line algorithms
- Analysis of simple randomized buffer management for parallel I/O
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 Q4593963)