Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. S. Albers. Better bounds for on-line scheduling. In Proc. 29th ACM Symp. on Theory of Computing, pages 130–139, 1997.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. 25th ACM Symposium on the Theory of Computing, pages 623–631, 1993. Also in Journal of the ACM 44:3 (1997) pp. 486–504.
3. B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 321–327, 1994.
4. Y. Azar, A. Broder, and A. Karlin. On-line load balancing. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pages 218–225, 1992. Also in Theoretical Compute Science 130 (1994) pp. 73–84.
5. Y. Azar and L. Epstein. On-line load balancing of temporary tasks on identical machines. In 5th Israeli Symp. on Theory of Computing and Systems, pages 119–125, 1997.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献