A new competitive analysis of randomized caching

DOI10.1007/3-540-40996-3_4MaRDI QIDQ4472478zbMATH OpenFDO

Authors Ching Law, Charles E. Leiserson

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690035.htm, http://hdl.handle.net/1721.1/80094

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• Competitive analysis of randomized paging algorithms
• Competitive analysis of randomized paging algorithms
• More on randomized on-line algorithms for caching.
• Competitive randomized algorithms for nonuniform problems
• A unified analysis of paging and caching

Cited in

(4)

• More on randomized on-line algorithms for caching.
• An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
• An analysis of optimum caching
• scientific article; zbMATH DE number 5938925 (Why is no real title available?)

This page was built for publication: A new competitive analysis of randomized caching

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