Author:
Cohen Edith,Kaplan Haim,Zwick Uri
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference30 articles.
1. D. Achlioptas, M. Chrobak, J. Noga, Competitive analysis of randomized paging algorithms, in: Proceedings of the Fourth European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 1136, Springer, Berlin, 1996, pp. 419–430.
2. S. Albers, Generalized connection caching, in: Proceedings of the 12th annual ACM Symposium on Parallel Algorithms and Architectures, ACM, 2000, pp. 70–78.
3. Apache HTTP server project, http://www.apache.org.
4. Hardness of approximation;Arora,1997
5. A study of replacement algorithms for virtual storage computers;Belady;IBM Systems J.,1966
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献