Author:
Friedman Joel,Linial Nathan
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference11 articles.
1. S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson. On the Power of Randomization in On-line Algorithms. InProc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 379–386, May 1990.
2. P. Berman, H. J. Karloff, and G. Tardos. A Competitive Three-Server Algorithm. InProc. of the 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 280–290, January 1990.
3. A. Bordoin, N. Linial, and M. Saks. An Optimal On-Line Algorithm for Metrical Task Systems. InProc. of the 19th Ann. ACM Symp. on Theory of Computing, pages 373–382, May 1987. Final version to appear inJ. Assoc. Comput. Mach.
4. M. Chrobak, H. J. Karloff, T. Payne, and S. Vishwanathan. New Results on Server Problems. InProc. of the 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, pates 291–300, January 1990.
5. D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir. Random Walks on Weighted Graphs and Applications to On-line Algorithms. InProc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 369–378, May 1990.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献