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