Turning Adversaries into Friends: Simplified, Made Constructive, and Extended-Reference-Cited by-同舟云学术

Turning Adversaries into Friends: Simplified, Made Constructive, and Extended

Published:2010 Issue: Volume: Page:380-394
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gafni Eli,Kuznetsov Petr

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17653-1_28

Reference23 articles.

1. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. Journal of the ACM 40(4), 873–890 (1993)

2. Lecture Notes in Computer Science;Y. Afek,2006

3. Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91–100. ACM Press, New York (May 1993)

4. Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distributed Computing 14(3), 127–146 (2001)

5. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4), 685–722 (1996)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Contention-related crash failures: Definitions, agreement algorithms, and impossibility results;Theoretical Computer Science;2022-03

2. The computational structure of progress conditions and shared objects;Distributed Computing;2019-06-19

3. An Asynchronous Computability Theorem for Fair Adversaries;Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing;2018-07-23

4. Agreement Functions for Distributed Computing Models;Networked Systems;2017

5. Asynchronous Computability Theorems for t-Resilient Systems;Lecture Notes in Computer Science;2016