Summary: 5. E. Borowsky and E. Gafni, ``Immediate atomic snapshots and fast renaming,'' in
Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Com­
puting, pages 41--51, 1993.
6. E. Borowsky and E. Gafni, ``The implication of the Borowsky­Gafni simulation on
the set consensus hierarchy,'' Technical Report 930021, UCLA Computer Science
Dept., 1993.
7. S. Chaudhuri, ``More Choices Allow More Faults: Set Consensus Problems in To­
tally Asynchronous Systems,'' Information and Computation, 105 (1), pages 132--
158, July 1993.
8. S. Chaudhuri, M.P. Herlihy, N. Lynch, and M.R. Tuttle, ``A tight lower bound for
k­set agreement,'' in Proceedings of the 34th IEEE Symposium on Foundations of
Computer Science, October 1993.
9. D. Dolev, N. Lynch, S. Pinter, E. Stark and W. Weihl, ``Reaching Approximate
Agreement in the Presence of Faults,'' Journal of the ACM, 33 (3), pages 499--516,
1986.
10. M. Fischer, N.A. Lynch, and M.S. Paterson, ``Impossibility of distributed commit
with one faulty process,'' Journal of the ACM, 32(2), pages 374--382, 1985.
11. E. Gafni, E. Koutsoupias, ``3­processor tasks are undecidable,'' Brief Announce­
ment in Proceedings of the 14­th Annual ACM Symposium on Principles of Dis­
tributed Computing, page 271, August 1995.

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences