On competitive on-line paging with lookahead
From MaRDI portal
Publication:1276313
DOI10.1016/S0304-3975(98)00118-2zbMATH Open0909.68023MaRDI QIDQ1276313FDOQ1276313
Authors: Dany Breslauer
Publication date: 2 February 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (13)
- A competitive analysis of the list update problem with lookahead
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- Online computation with advice
- Competitive caching of query results in search engines
- Online-bounded analysis
- On the influence of lookahead in competitive paging algorithms
- On competitive on-line paging with lookahead
- Beyond Competitive Analysis
- The relative worst-order ratio applied to paging
- Exact distributional analysis of online algorithms with lookahead
- Combining request scheduling with web caching
- A new measure for the study of on-line algorithms
- Online bounded analysis
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)