An Asynchronous Computability Theorem for Fair Adversaries-Reference-Cited by-同舟云学术

An Asynchronous Computability Theorem for Fair Adversaries

Published:2018-07-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Kuznetsov Petr¹,Rieutord Thibault¹,He Yuan²

Affiliation:

1. LTCI, Télécom ParisTech, Université Paris-Saclay, Paris, France

2. University of California, Los Angeles, Los Angeles, CA, USA

Funder

ANR-DFG project DISCMAT

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3212734.3212765

Reference29 articles.

1. Atomic snapshots of shared memory

2. Defining liveness

3. Elizabeth Borowsky and Eli Gafni . 1993 a. Generalized FLP impossibility result for t-resilient asynchronous computations. In STOC. 91--100. 10.1145/167088.167119 Elizabeth Borowsky and Eli Gafni . 1993 a. Generalized FLP impossibility result for t-resilient asynchronous computations. In STOC. 91--100. 10.1145/167088.167119

4. Elizabeth Borowsky and Eli Gafni . 1993 b. Immediate atomic snapshots and fast renaming. In PODC. 41--51. 10.1145/164051.164056 Elizabeth Borowsky and Eli Gafni . 1993 b. Immediate atomic snapshots and fast renaming. In PODC. 41--51. 10.1145/164051.164056

5. Elizabeth Borowsky and Eli Gafni . 1997. A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In PODC. 189--198. 10.1145/259380.259439 Elizabeth Borowsky and Eli Gafni . 1997. A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In PODC. 189--198. 10.1145/259380.259439

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

1. Topological Characterization of Consensus in Distributed Systems;Journal of the ACM;2024-08-22

2. Pattern Models: A Dynamic Epistemic Logic For Distributed Systems;The Computer Journal;2024-02-17

3. On the Bit Complexity of Iterated Memory;Lecture Notes in Computer Science;2024

4. A Topological Characterization to Arbitrary Resilient Asynchronous Complexity;Mathematics;2022-08-01

5. A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20