Author:
Attiya Hagit,Shachnai Hadas,Tamir Tami
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. H. Attiya, M. Bellare, H. Shachnai and T. Tamir. The minimum color sum problem and distributed resource allocation, manuscript, 1994.
2. B. Awerbuch and D. Peleg. Sparse partition. IEEE Symp. on Foundation of Computer Science, 1990, pp. 503–513.
3. B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. IEEE Syrnp. on Foundation of Computer Science, 1990, pp. 65–74.
4. V.C. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhood constrained systems. ACM Trans. Programming Languages and Systems, Vol. 11, 1989, pp. 562–584.
5. J. Bar-Ilan and D. Peleg. Distributed resource allocation algorithms. International Workshop on Distributed Algorithms, 1992, pp. 276–291.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献