Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Barbosa V.C., Gafni E. (1989). Concurrency in heavily loaded neighborhood-constrained systems. ACM Trans. on Prog. Lang. and Systems
11(4), 562–584.
2. Chandy K.M., Misra J. (1984). The drinking philosophers problem. ACM Trans. on Prog. Lang. and Systems
6(4), 632–646.
3. Gafni E. M., Bertsekas D. P. (1981). Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Trans. Commusource Allocationn. COM-29, 1, 11–18.
4. Attiya H., Shachnai H., Tamir T. (1994). Local Labeling and Resource Allocation Using Preprocessing. WDAG'94 LNCS 857, 194–208.
5. Barbosa V.C. (1993). Massively Parallel Models of Computation: Distributed Parallel Processing in Artificial Intelligence and Optimization. Ellis Horwood.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献