On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement-Reference-Cited by-同舟云学术

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

On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement

Published:2023 Issue: Volume: Page:1-12
ISSN:1045-9219
Container-title:IEEE Transactions on Parallel and Distributed Systems
language:
Short-container-title:IEEE Trans. Parallel Distrib. Syst.

Author:

Kumar Manish¹^ORCID,Molla Anisur Rahaman¹^ORCID

Affiliation:

1. Indian Statistical Institute, Kolkata, India

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computational Theory and Mathematics,Hardware and Architecture,Signal Processing

Link

http://xplorestaging.ieee.org/ielx7/71/4359390/10026332.pdf?arnumber=10026332

Reference53 articles.

1. Contemporary approaches to fault tolerance

2. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems;rowstron;Proc IFIP/ACM Int Conf Distrib Syst Platforms,2001

3. Overcoming byzantine failures using checkpointing;agbaria,2003

4. Resource burning for permissionless systems;gupta;Proc IFIP/ACM Int Conf Distrib Syst Platforms Open Distrib Process,2020

5. Probability and Computing

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

1. Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement;Proceedings of the 25th International Conference on Distributed Computing and Networking;2024-01-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP