Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference18 articles.
1. Anceaume, E., Hurfin, M., Parvedy, P.R.: An efficient solution to the k-set agreement problem. Technical Report PI-1440, INRIA (2003)
2. Attiya, H., Avidor, Z.: Wait-free n-set consensus when inputs are restricted. In: Malkhi, D. (ed.) Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, vol. 2508 of Lecture Notes in Computer Science, pp. 326–338. Springer (2002)
3. Borowsky, E., Gafni, E.: Generalized flp impossibility result for t-resilient asynchronous computations. In: Proceedings of the 1993 ACM Symposium on Theory of Computing (1993)
4. Chandra, T.D., Hadzilacos, V., Toueg, S.:The weakest failure detector for solving consensus. Journal of the ACM (JACM) 43(4), 685–722 (1996)
5. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM (JACM) 43(2), 225–267 (1996)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献