Selected papers that cite this one
- William R. Burley. Traversing layered graphs using the work function algorithm. Journal of Algorithms, 20(3):479-511, May 1996.
- Tyng-Ruey Chuang and Wen L. Hwang. A probabilistic approach to the problem of automatic selection of data representations. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, pages 190-200, Philadelphia, Pennsylvania, 24-26 May 1996.
- Xiaotie Deng and Sanjeev Mahajan. The cost of derandomization: Computability or competitiveness. SIAM Journal on Computing, 26(3):786-802, June 1997.
- Ran El-Yaniv and Jon Kleinberg. Geometric two-server algorithms. Information Processing Letters, 53(6):355-358, 24 March 1995.
- Elias Koutsoupias and Christos H. Papadimitriou. On the k-server conjecture. Journal of the ACM, 42(5):971-983, September 1995.
- Stephen Ponzio. The combinatorics of effective resistances and resistive inverses. Accepted for publication in Information and Computation. Final manuscript received for publication January 1, 1998.
- S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in online algorithms (extended abstract). In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 379-386, Baltimore, Maryland, 14-16 May 1990.
- Allan Borodin, Nathan Linial, and Michael Saks. An optimal online algorithm for metrical task systems. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 373-382, New York City, 25-27 May 1987.
- Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, and Prasoon Tiwari. The electrical resistance of a graph captures its commute and cover times (detailed abstract). In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 574-586, Seattle, Washington, 15-17 May 1989.
- Amos Fiat, Yuval Rabani, and Yiftach Ravid. Competitive k-server algorithms (extended abstract). In 31st Annual Symposium on Foundations of Computer Science, volume II, pages 454-463, St. Louis, Missouri, 22-24 October 1990. IEEE.
- E. F. Grove. The harmonic online K-server algorithm is competitive. In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 260-266, New Orleans, Louisiana, 6-8 May 1991.