Topology Approach in Distributed Computing
Publisher
Springer New York
Reference17 articles.
1. Attiya H, Bar-Noy A, Dolev D, Peleg D, Reischuk R (1990) Renaming in an asynchronous environment. J ACM 37(3):524–548
2. Biran O, Moran S, Zaks S (1990) A combinatorial characterization of the distributed 1-solvable tasks. J Algorithms 11(3):420–440
3. Borowsky E, Gafni E (1993) Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the 25th ACM symposium on theory of computing, May 1993
4. Chaudhuri S, Herlihy M, Lynch NA, Tuttle MR (2000) Tight bounds for k-set agreement. J ACM 47(5):912–943
5. Chaudhuri S (1993) More choices allow more faults: set consensus problems in totally asynchronous systems. Inf Comput 105(1):132–158, A preliminary version appeared in ACM PODC 1990