Selected papers that cite this one
- Hagit Attiya and Ophir Rachman. Atomic snapshots in O(n log n) operations. SIAM Journal on Computing, 27(2):319-340, March 1998.
- Amos Israeli and Asaf Shirazi. The time complexity of updating snapshot memories. Information Processing Letters, 65(1):33-40, 15 January 1998.
- Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic snapshots of shared memory. Journal of the ACM, 40(4):873-890, September 1993.
- Eshrat Arjomandi, Michael J. Fischer, and Nancy A. Lynch. Efficiency of synchronous versus asynchronous distributed systems. Journal of the ACM, 30(3):449-456, July 1983.
- Hagit Attiya and Nancy A. Lynch. Time bounds for real-time process control in the presence of timing uncertainty. Information and Computation, 110(1):183-232, April 1994.
- Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, January 1987.
- Danny Dolev, Eli Gafni, and Nir Shavit. Toward a non-atomic era: l-exclusion as a test case. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 78-92, Chicago, Illinois, 2-4 May 1988.
- Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. Journal of the ACM, 33(3):499-516, July 1986.
- Danny Dolev, Ruediger Reischuk, and H. Raymond Strong. `Eventual' is earlier than `immediate'. In 23rd Annual Symposium on Foundations of Computer Science, pages 196-203, Chicago, Illinois, 3-5 November 1982. IEEE.
- Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a Byzantine environment: Crash failures. Information and Computation, 88(2):156-186, October 1990.
- Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.
- Zvi M. Kedem, Krishna V. Palem, and Paul G. Spirakis. Efficient robust parallel computations (extended abstract). In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 138-148, Baltimore, Maryland, 14-16 May 1990.
- Charles Martel, Ramesh Subramonian, and Arvin Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In 31st Annual Symposium on Foundations of Computer Science, volume II, pages 590-599, St. Louis, Missouri, 22-24 October 1990. IEEE.
- Gary L. Peterson and James E. Burns. Concurrent reading while writing II: The multi-writer case. In 28th Annual Symposium on Foundations of Computer Science, pages 383-392, Los Angeles, California, 12-14 October 1987. IEEE.
- Gary L. Peterson and Michael J. Fischer. Economical solutions for the critical section problem in a distributed system (extended abstract). In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 91-97, Boulder, Colorado, 2-4 May 1977.
- Paul M. B. Vitányi and Baruch Awerbuch. Atomic shared register access by asynchronous hardware (detailed abstract). In 27th Annual Symposium on Foundations of Computer Science, pages 233-243, Toronto, Ontario, Canada, 27-29 October 1986. IEEE.