Selected papers that cite this one
- Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, January 1995.
- John Havlicek. Computable obstructions to wait-free computability. In 38th Annual Symposium on Foundations of Computer Science, pages 80-89, Miami Beach, Florida, 20-22 October 1997. IEEE.
- Maurice Herlihy and Sergio Rajsbaum. The decidability of distributed decision tasks (extended abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 589-598, El Paso, Texas, 4-6 May 1997.
- Maurice Herlihy and Nir Shavit. A simple constructive computability theorem for wait-free computation. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 243-252, Montréal, Québec, Canada, 23-25 May 1994.
- Junguk L. Kim and Geneva G. Belford. A distributed election protocol for unreliable networks. Journal of Parallel and Distributed Computing, 35(1):35-42, 25 May 1996.
- Ambuj K. Singh and Mohamed G. Gouda. Rankers: a classification of synchronization problems. Science of Computer Programming, 21(3):191-223, December 1993.
- Gadi Taubenfeld, Shmuel Katz, and Shlomo Moran. Impossibility results in the presence of multiple faulty processes. Information and Computation, 113(2):173-198, September 1994.