Competitive Paging With Locality of Reference (1991)

Cached

Download Links

by Allan Borodin , Prabhakar Raghavan , Sandy Irani , Baruch Schieber
Venue:Journal of Computer and System Sciences
Citations:121 - 3 self

Active Bibliography

31 Experimental Studies of Access Graph Based Heuristics: Beating the LRU standard? – Amos Fiat, Ziv Rosen - 1997
61 MARKOV PAGING – Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan - 2000
73 Strongly Competitive Algorithms for Paging with Locality of Reference – Sandy Irani, et al. - 1995
39 Randomized Competitive Algorithms for the List Update Problem – Nick Reingold, Jeffery Westbrook, Daniel D. Sleator - 1992
A new competitive analysis of randomized caching (Extended Abstract) – Ching Law, Charles E. Leiserson
21 A Unified Analysis of Paging and Caching – Eric Torng - 1998
13 Competitive Paging And Dual-Guided On-Line Weighted Caching And Matching Algorithms – Neal Young - 1991
59 Energy-Efficient Algorithms for . . . – Susanne Albers, HIROSHI FUJIWARA - 2007
4 On-line Algorithms: Competitive Analysis and Beyond – Steven Phillips, Jeffery Westbrook - 1999
27 Optimal Prediction for Prefetching in the Worst Case – P. Krishnan, Jeffrey Scott Vitter - 1998
73 New Results on Server Problems – M. Chrobak, H. Karloff, T. Payne, S. Vishwanathan - 1990
13 The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms – Yair Bartal, Adi Rosen - 1992
Competitive Cache Replacement Strategies for a Shared Cache – Anil Kumar Katti - 2011
5 On-line algorithms and the k-server conjecture – Elias Koutsoupias - 1994
55 Competitive k-Server Algorithms – Amos Fiat, Yuval Rabani, Yiftach Ravid - 1990
164 Competitive Paging Algorithms – Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. Mcgeoch, Daniel D. Sleator, Neal E. Young - 1991
21 Competitive Algorithms for Layered Graph Traversal – Amos Fiat, Dean P. Foster, Howard Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan - 1991
3 Competitive Analysis of Paging: A Survey – Sandy Irani - 1996
A New Measure for the Study of Online Algorithms – S. Ben David, A. Borodin - 2001