On competitive on-line paging with lookahead

DOI10.1016/S0304-3975(98)00118-2MaRDI QIDQ1276313zbMATH OpenFDO

Authors Dany Breslauer

Publication date 2 February 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

on-line paging algorithms

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• On competitive on-line paging with lookahead
• On the influence of lookahead in competitive paging algorithms
• A new measure for the study of on-line algorithms
• A competitive analysis of the list update problem with lookahead

Cites work

• 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?)
• A new measure for the study of on-line algorithms
• A strongly competitive randomized paging algorithm
• Competitive paging algorithms
• On the influence of lookahead in competitive paging algorithms

Cited in

(14)

• The relative worst-order ratio applied to paging
• Online computation with advice
• Online bounded analysis
• Exact distributional analysis of online algorithms with lookahead
• Combining request scheduling with web caching
• Online Algorithms for Weighted Paging with Predictions
• A competitive analysis of the list update problem with lookahead
• Online-bounded analysis
• On competitive on-line paging with lookahead
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• A new measure for the study of on-line algorithms
• Competitive caching of query results in search engines
• On the influence of lookahead in competitive paging algorithms
• Beyond Competitive 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)