Author:
Afek Yehuda,Dolev Danny,Gafni Eli,Merritt Michael,Shavit Nir
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in an asynchronous environment. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 337–346, October 1987.
2. J. H. Anderson, and M. G. Gouda, The virtue of patience: concurrent programming with and without waiting. unpublished manuscript, Dept. of Computer Science, Austin, Texas, January 1988.
3. D. Dolev, E. Gafni, and N. Shavit. Towards a non-atomic era: l-exclusion as a test case. In Proceedings of the 20
th
Annual ACM Symposium on Theory of Computing. ACM SIGACT, ACM, 1988.
4. E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications Of The ACM, 8:165, 1965.
5. D. Dolev and N. Shavit. Bounded concurrent time-stamp systems are constructible. In Proceedings of the 21
st
Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454–465. ACM SIGACT, ACM, 1989.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献