Author:
Agrawal Kunal,Bender Michael A.,Fineman Jeremy T.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Lecture Notes in Computer Science;D. Achlioptas,1996
2. Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5(2), 78–101 (1966)
3. Borodin, A., Irani, S., Raghavan, P., Schieber, B.: Competitive paging with locality of reference. Journal of Computer and System Sciences 50(2), 244–258 (1995)
4. Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms 12(4), 685–699 (1991)
5. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.:Cache-oblivious algorithms. In: 40th Annual Symposium on Foundations of Computer Science, pp. 285–297, New York, October 17–19 (1999)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Paging and the Address-Translation Problem;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06