Author:
Bern Marshall,Greene Daniel H.,Raghunathan Arvind,Sudan Madhu
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the Power of Randomization in Online Algorithms,Proc. 22th ACM Symp. on Theory of Computing, 1990, pp. 379?386.
2. P. Berman, H. Karloff, and G. Tardos, A Competitive Three-Server Algorithm,Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, 1989, pp. 280?290.
3. A. Borodin, N. Linial, and M. Saks, An Optimal Online Algorithm for Metrical Task Systems,Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 373?382.
4. A. Calderbank, E. Coffman, and L. Flatto, Sequencing Problems in Two-Server Systems,Math. Oper. Res. 10 (1985), 585?595.
5. M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New Results on Server Problems,SIAM J. Discrete Math. 4 (1991), 172?181.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献