Improved communication complexity of fault-tolerant consensus

Author:

Hajiaghayi Mohammad T.1,Kowalski Dariusz R.2,Olkowski Jan1

Affiliation:

1. University of Maryland, USA

2. Augusta University, USA

Publisher

ACM

Reference31 articles.

1. Communication Complexity of Byzantine Agreement, Revisited

2. D. Alistarh , J. Aspnes , V. King , and J. Saia , Communication-eficient randomized consensus, Distributed Comput. , 31 ( 2018 ), 489 - 501 . D. Alistarh, J. Aspnes, V. King, and J. Saia, Communication-eficient randomized consensus, Distributed Comput., 31 ( 2018 ), 489-501.

3. D. Alistarh , S. Gilbert , R. Guerraoui , M. Zadimoghaddam , How Eficient Can Gossip Be? (On the Cost of Resilient Information Exchange), Automata, Languages and Programming , 37th International Colloquium, ICALP 2010 , 115 - 126 . D. Alistarh, S. Gilbert, R. Guerraoui, M. Zadimoghaddam, How Eficient Can Gossip Be? (On the Cost of Resilient Information Exchange), Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, 115-126.

4. S. Amdur S. Weber and V. Hadzilacos On the message complexity of binary agreement under crash failures Distributed Computing 5 ( 1992 ) 175-186. S. Amdur S. Weber and V. Hadzilacos On the message complexity of binary agreement under crash failures Distributed Computing 5 ( 1992 ) 175-186.

5. J. Aspnes Lower Bounds for Distributed Coin-Flipping and Randomized Consensus J. ACM 45 ( 3 ) ( 1998 ): 415-450. J. Aspnes Lower Bounds for Distributed Coin-Flipping and Randomized Consensus J. ACM 45 ( 3 ) ( 1998 ): 415-450.

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

1. Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Adaptive Consensus: Enhancing Robustness in Dynamic Environments;Lecture Notes on Data Engineering and Communications Technologies;2024

3. Brief Announcement: Improved Consensus in Quantum Networks;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

4. Anti-Counterfeiting and Traceability Consensus Algorithm Based on Weightage to Contributors in a Food Supply Chain of Industry 4.0;Sustainability;2023-05-11

5. On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement;IEEE Transactions on Parallel and Distributed Systems;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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