Author:
Albers Susanne,van Stee Rob
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203–218, 2000.
2. S. Albers. Generalized connection caching. In Proceedings of the Twelfth ACM Symposium on Parallel Algorithms and Architectures, pages 70–78. ACM, 2000.
3. E. Cohen, H. Kaplan, and U. Zwick. Connection caching. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 612–621. ACM, 1999.
4. E. Cohen, H. Kaplan, and U. Zwick. Connection caching under various models of communication. In Proceedings of the Twelfth ACM Symposium on Parallel Algorithms and Architectures, pages 54–63. ACM, 2000.
5. T. Feder, R. Motwani, R. Panigraphy, and A. Zhu. Web caching with request reordering. In Proceedings 13th ACM-SIAM Symposium on Discrete Algorithms, pages 104–105, 2002.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献