Author:
Grove Edward F.,Kao Ming-Yang,Krishnan P.,Vitter Jeffrey Scott
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. B. Awerbuch and D. Peleg, “Concurrent Online Tracking of Mobile Users,” Proceedings of SIGCOMM 1991.
2. Y. Azar, A. Y. Broder, and A. R. Karlin, “On-line Load Balancing,” Proceedings of the 33rd Symposium on Foundations of Computer Science (October 1993), 218–225.
3. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. R. Pruhs, and O. Waarts, “Online Load Balancing of Temporary Tasks,” Proceedings of the 1993 Workshop on Algorithms and Data Structures (August 1993).
4. Y. Azar, J. Naor, and R. Rom, “The Competitiveness of On-Line Assignments,” Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (January 1992).
5. D. Coppersmith, P. Doyle, P. Raghavan, M. Snir, “Random Walks on Weighted Graphs and Applications to On-line Algorithms,” Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 1990, and 369–378), Also appears as IBM Research Report RC 15840.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献