Author:
Karlin A. R.,Manasse M. S.,McGeoch L. A.,Owicki S.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Ben-David, S., Borodin, A., Karp, R., Tardos, G., and Wigderson, A. On the power of randomization in on-line algorithms.Algorithmica,11:2?14, 1994.
2. Berman, P., Karloff, H., and Tardos, G. A competitive three-server algorithm.Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pages 280?290.
3. Borodin, A., Linial, N., and Saks, M. An optimal online algorithm for metrical task systems.Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pages 373?382.
4. Borodin, A., Linial, N., and Saks, M. An optimal on-line algorithm for metrical task systems.J. Assoc. Comput. Mach.,39(4):745?763, 1992.
5. Chrobak, M., Karloff, H., Payne, T., and Vishwanathan, S. New results on server problems.SIAM J. Discrete Math.,4(2): 172?181, 1991.
Cited by
147 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献