Author:
Lund Carsten,Phillips Steven,Reingold Nick
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference14 articles.
1. A. Borodin, S. Irani, P. Raghavan, B. Schieber, Competitive paging with locality of reference, Proceedings, 23rd Annual ACM Symposium on Theory of Computing, 1991, 249, 259
2. R. Caceres, The pyramid IP to X.25 protocol interface: Merging DDN and PDN approaches, Proceedings Uniform, Washington, DC, 1987
3. Finite State Markov Decision Processes;Derman,1970
4. On competitive algorithms for paging problems;Fiat;J. Algorithms,1991
5. Some distribution-free aspects of paging performance;Franaszek;J. Assoc. Comput. Mach.,1974
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献