A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement-Reference-Cited by-同舟云学术

A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement

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

Author:

Fraigniaud Pierre¹,Paz Ami²,Rajsbaum Sergio³

Affiliation:

1. IRIF, CNRS & Université Paris Cité, Paris, France

2. LISN, CNRS & Université Paris Saclay, Paris, France

3. UNAM, Mexico city, Mexico

Funder

ANR

UNAM-PAPIIT

Publisher

ACM

Link

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

Reference37 articles.

1. J. Aspnes and M. Herlihy . 1990 . Wait-Free Data Structures in the Asynchronous PRAM Model. In 2nd ACM Symposium on Parallel Algorithms and Architectures (SPAA) (Island of Crete, Greece). 340--349 . https://doi.org/10.1145/97444.97701 10.1145/97444.97701 J. Aspnes and M. Herlihy. 1990. Wait-Free Data Structures in the Asynchronous PRAM Model. In 2nd ACM Symposium on Parallel Algorithms and Architectures (SPAA) (Island of Crete, Greece). 340--349. https://doi.org/10.1145/97444.97701

2. Bounds on the Step and Namespace Complexity of Renaming

3. Hagit Attiya and Faith Ellen . 2014. Impossibility Results for Distributed Computing . Morgan & Claypool Publishers . https://doi.org/10.2200/ S00551ED1V01Y 2013 11DCT012 Hagit Attiya and Faith Ellen. 2014. Impossibility Results for Distributed Computing. Morgan & Claypool Publishers. https://doi.org/10.2200/ S00551ED1V01Y201311DCT012

4. Indistinguishability

5. Distributed Computing

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

1. The topology of local computing in networks;Journal of Applied and Computational Topology;2024-07-01