Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differential services. In: Proceedings of IEEE INFOCOM, pp. 431–440 (2000)
2. Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM Journal on Computing 35(2), 278–304 (2005)
3. Lecture Notes in Computer Science;Y. Azar,2004
4. Azar, Y., Richter, Y.: An improved algorithm for cioq switches. ACM Transactions on Algorithms 2(2), 282–295 (2006)
5. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 606–615. ACM (1995)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献