More on randomized on-line algorithms for caching.

DOI10.1016/S0304-3975(02)00045-2MaRDI QIDQ1401208zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, Elias Koutsoupias, J. Noga

Publication date 17 August 2003

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

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00045-2

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• Competitive analysis of randomized paging algorithms
• Randomized competitive algorithms for generalized caching
• Competitive analysis of randomized paging algorithms
• scientific article; zbMATH DE number 2080233
• Competitive randomized algorithms for nonuniform problems

Cites work

• scientific article; zbMATH DE number 3560403 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A strongly competitive randomized paging algorithm
• An Optimal On-Line Algorithm for K Servers on Trees
• Beyond Competitive Analysis
• Competitive algorithms for server problems
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• Limited bookmark randomized online algorithms for the paging problem
• More on randomized on-line algorithms for caching.
• On the k -server conjecture
• On-Line Paging Against Adversarially Biased Random Inputs
• Trackless online algorithms for the server problem

Cited in

(5)

• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• Knowledge state algorithms
• More on randomized on-line algorithms for caching.
• Limited bookmark randomized online algorithms for the paging problem
• scientific article; zbMATH DE number 2080233 (Why is no real title available?)

This page was built for publication: More on randomized on-line algorithms for caching.

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