1. Competitive analysis of randomized paging algorithms
2. An
O
(log
k
)-Competitive Algorithm for Generalized Caching
3. Susanne Albers , Sanjeev Arora , and Sanjeev Khanna . 1999 . Page replacement for general caching problems . In Symposium on Discrete Algorithms. 31--40 . Susanne Albers, Sanjeev Arora, and Sanjeev Khanna. 1999. Page replacement for general caching problems. In Symposium on Discrete Algorithms. 31--40.
4. N. Alon , B. Awerbuch , Y. Azar , N. Buchbinder , and J. Naor . 2003. The online set cover problem . In Symposium on the Theory of Computation. 100--105 . N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. 2003. The online set cover problem. In Symposium on the Theory of Computation. 100--105.
5. A Primal-Dual Randomized Algorithm for Weighted Paging