Author:
Dwork Cynthia,Herlihy Maurice,Plotkin Serge A.,Waarts Orli
Reference28 articles.
1. K. Abrahamson, On Achieving Consensus Using a Shared Memory, Proc. 7 ACM Symposium on Principles of Distributed Computing, pp.291–302, 1988.
2. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, Atomic Snapshots of Shared Memory, Proc. 9 ACM Symposium on Principles of Distributed Computing, pp. 1–13, 1990.
3. J. Anderson, Composite Registers, Proc. 9 ACM Symposium on Principles of Distributed Computing, pp. 15–30, August 1990.
4. J. Anderson, and B. Groselj, Beyond Atomic Registers: Bounded Wait-free Implementations of Non-trivial Objects, Proc. 5th International Workshop on Distributed Algorithms, Delphi, Greece, October 1991.
5. J. Aspnes, Time-and Space-Efficient Randomized Consensus, to appear in the Journal of Algorithms. An earlier version appears in Proc. 9 ACM Symposium on Principles of Distributed Computing, pp. 325–331, 1990.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献