More on randomized on-line algorithms for caching.

DOI10.1016/S0304-3975(02)00045-2zbMath1044.68166OpenAlexW2088826026MaRDI QIDQ1401208

Marek Chrobak, Elias Koutsoupias, John 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)

Related Items (4)

More on randomized on-line algorithms for caching. ⋮ Knowledge state algorithms ⋮ \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm ⋮ Limited bookmark randomized online algorithms for the paging problem

Cites Work

• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• More on randomized on-line algorithms for caching.
• Competitive analysis of randomized paging algorithms
• Trackless online algorithms for the server problem
• Limited bookmark randomized online algorithms for the paging problem
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• Competitive paging algorithms
• On the k -server conjecture
• Beyond Competitive Analysis
• On-Line Paging Against Adversarially Biased Random Inputs

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