Journal of the ACM Bibliography

Selected papers that cite this one

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

• Yehuda Afek and Gideon Stupp. Optimal time-space tradeoff for shared memory leader election. Journal of Algorithms, 25(1):95-117, October 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, Hagit Attiya, and Gadi Taubenfeld. Time-adaptive algorithms for syncronization. SIAM Journal on Computing, 26(2):539-556, April 1997.

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

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

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

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

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

• Injong Rhee and Jennifer L. Welch. Time bounds on synchronization in a periodic distributed system. Information Processing Letters, 64(2):87-93, 28 October 1997.

Shortcuts: