scientific article

zbMATH Open0800.68484MaRDI QIDQ4010318FDOQ4010318

Sandy Irani, Baruch Schieber, Allan Borodin, Prabhakar Raghavan

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

competitive paging

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Title not available (Why is that?)
• Online computation with advice
• 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)