Subconsensus Tasks: Renaming Is Weaker Than Set Agreement-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Subconsensus Tasks: Renaming Is Weaker Than Set Agreement

Published:2006 Issue: Volume: Page:329-338
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gafni Eli,Rajsbaum Sergio,Herlihy Maurice

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11864219_23.pdf

Reference14 articles.

1. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524–548 (1990)

2. Attiya, H., Rajsbaum, S.: The combinatorial structure of wait-free solvable tasks. SIAM J. Comput. 31(4), 1286–1313 (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, pp. 206–215 (May 1993)

4. Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC 1993: Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, pp. 41–51. ACM Press, New York (1993)

5. Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: PODC 1997: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pp. 189–198. ACM Press, New York (1997)

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

1. The Solvability of Consensus in Iterated Models Extended with Safe-Consensus;Theory of Computing Systems;2023-07-17

2. Reductions and Extension-Based Proofs;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21

3. Counting-based impossibility proofs for set agreement and renaming;Journal of Parallel and Distributed Computing;2016-01

4. Topology Approach in Distributed Computing;Encyclopedia of Algorithms;2016

5. Set Agreement;Encyclopedia of Algorithms;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3