scientific article; zbMATH DE number 65707

MaRDI QIDQ4010318zbMATH OpenFDO

Authors Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber

Publication date 27 September 1992

zbMATH Keywords

competitive paging

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Competitive paging with locality of reference
• Quantifying competitiveness in paging with locality of reference
• Quantifying competitiveness in paging with locality of reference
• Strongly Competitive Algorithms for Paging with Locality of Reference
• scientific article; zbMATH DE number 742969
• On paging with locality of reference
• Competitive paging algorithms
• scientific article; zbMATH DE number 1263239
• On Certain New Models for Paging with Locality of Reference
• A strongly competitive randomized paging algorithm

Cited in

(4)

• Online computation with advice
• scientific article; zbMATH DE number 1263239 (Why is no real title available?)
• Competitive caching of query results in search engines
• Competitive analysis of randomized paging algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4010318)