Author:
Raghavan Prabhakar,Snir Marc
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Nineteenth Annual ACM Symposium on Theory of Computing, pages 373–382, 1987.
2. A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, May 1989.
3. P. Chew. There exist planar graphs almost as good as the complete graph. 1988. To appear, JCSS.
4. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. Randomized algorithms for paging problems. 1988. In preparation.
5. A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70–119, 1988.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献