Journal of the ACM Bibliography

Selected papers that cite this one

• Yehuda Afek, David S. Greenberg, Michael Merritt, and Gadi Taubenfeld. Computing with faulty shared ojects. Journal of the ACM, 42(6):1231-1274, November 1995.

• Yehuda Afek and Gideon Stupp. Synchronization power depends on the register size (preliminary version). In 34th Annual Symposium on Foundations of Computer Science, pages 196-205, Palo Alto, California, 3-5 November 1993. IEEE.

• Rajeev Alur, Hagit Attiya, and Gadi Taubenfeld. Time-adaptive algorithms for syncronization. SIAM Journal on Computing, 26(2):539-556, April 1997.

• Rajeev Alur, Hagit Attiya, and Gadi Taubenfeld. Time-adaptive algorithms for synchronization. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 800-809, Montréal, Québec, Canada, 23-25 May 1994.

• Rajeev Alur and Thomas Henzinger. Finitary fairness. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 52-61, Paris, France, 4-7 July 1994. IEEE Computer Society Press.

• James Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 559-568, El Paso, Texas, 4-6 May 1997.

• James Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM, 45(3):415-450, May 1998.

• James Aspnes and Orli Waarts. Randomized consensus in expected O(N log^2 N) operations per processor. SIAM Journal on Computing, 25(5):1024-1044, October 1996.

• 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.

• Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM, 41(1):122-152, January 1994.

• Hagit Attiya, Nancy Lynch, and Nir Shavit. Are wait-free algorithms fast? Journal of the ACM, 41(4):725-763, July 1994.

• Yonatan Aumann and Michael A. Bender. Fault tolerant data structures. In 37th Annual Symposium on Foundations of Computer Science, pages 580-589, Burlington, Vermont, 14-16 October 1996. IEEE.

• Yonatan Aumann, Michael A. Bender, and Lisa Zhang. Efficient execution of nondeterministic parallel programs on asynchronous systems. Information and Computation, 139(1):1-16, 25 November 1997.

• Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Marcel-C\u{a}t\u{a}lin Ro\c{s}u, and Ray Strong. Efficient message passing interface (MPI) for parallel computing on clusters of workstations. Journal of Parallel and Distributed Computing, 40(1):19-34, 10 January 1997.

• Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving Consensus. Journal of the ACM, 43(4):685-722, July 1996.

• Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.

• Soma Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1):132-158, July 1993.

• Benny Chor, Amos Israeli, and Ming Li. Wait-free consensus using asynchronous hardware. SIAM Journal on Computing, 23(4):701-712, August 1994.

• Francis Chu. Reducing Omega to \Diamond W. Information Processing Letters, 67(6):289-293, 30 September 1998.

• Cynthia Dwork, Maurice Herlihy, and Orli Waarts. Contention in shared memory algorithms. Journal of the ACM, 44(6):779-805, November 1997.

• Alan D. Fekete. Asynchronous approximate agreement. Information and Computation, 115(1):95-124, 15 November 1994.

• Michael J. Fischer, Shlomo Moran, Steven Rudich, and Gadi Taubenfeld. The wakeup problem. SIAM Journal on Computing, 25(6):1332-1357, December 1996.

• 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.

• Prasad Jayanti, Tushar Deepak Chandra, and Sam Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451-500, May 1998.

• 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.

• Wai-Kau Lo and Vassos Hadzilacos. All of us are smarter than any of us: Wait-free hierarchies are not robust. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 579-588, El Paso, Texas, 4-6 May 1997.

• Louise E. Moser and P. M. Melliar-Smith. Byzantine-resistant total ordering algorithms. Accepted for publication in Information and Computation. Final manuscript received for publication October 29, 1998.

• 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.

Shortcuts: