Journal of the ACM Bibliography

Selected papers that cite this one

• Yehuda Afek, Dalia Dauber, and Dan Touitou. Wait-free made fast (extended abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 538-547, Las Vegas, Nevada, 29 May-1 June 1995.

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

• 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, Nancy Lynch, and Nir Shavit. Are wait-free algorithms fast? Journal of the ACM, 41(4):725-763, July 1994.

• Hagit Attiya and Ophir Rachman. Atomic snapshots in O(n log n) operations. SIAM Journal on Computing, 27(2):319-340, March 1998.

• Danny Dolev and Nir Shavit. Bounded concurrent time-stamping. SIAM Journal on Computing, 26(2):418-455, April 1997.

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

• Amos Israeli and Asaf Shirazi. The time complexity of updating snapshot memories. Information Processing Letters, 65(1):33-40, 15 January 1998.

• Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 569-578, El Paso, Texas, 4-6 May 1997.

Selected references

• Hagit Attiya, Nancy Lynch, and Nir Shavit. Are wait-free algorithms fast? (extended abstract). In 31st Annual Symposium on Foundations of Computer Science, volume I, pages 55-64, St. Louis, Missouri, 22-24 October 1990. IEEE.

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

• Howard P. Katseff. A new solution to the critical section problem. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, pages 86-88, San Diego, California, 1-3 May 1978.

• Leslie Lamport. The mutual exclusion problem: Part II -- statement and solutions. Journal of the ACM, 33(2):327-348, April 1986.

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

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

Shortcuts: