Author:
Bar-Ilan Judit,Peleg David
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32:804–823, 1985.
2. B. Awerbuch, L. Cowen and M. Smith. Self-stabilizing symmetry breaking in poly-logarithmic time. Unpublished manuscript, 1992.
3. B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. In FOCS, pages 65–74. IEEE, 1990.
4. K. Chandy and J. Misra. The dining philosophers problem. In TOPLAS, pages 632–646. ACM, 1984.
5. E. W. Dijkstra. Hierarchical ordering of sequential processes. ACTA Informatica, pages 115–138, 1971.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献