Randomized k-set agreement in crash-prone and Byzantine asynchronous systems-Reference-Cited by-同舟云学术

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

Randomized k-set agreement in crash-prone and Byzantine asynchronous systems

Published:2018-01 Issue: Volume:709 Page:80-97
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Mostéfaoui Achour,Moumen Hamouma,Raynal Michel

Funder

DFG-ANR

ANR

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference39 articles.

1. Fast asynchronous consensus with optimal resilience;Abraham,2010

2. Distributed Computing: Fundamentals, Simulations and Advanced Topics;Attiya,2004

3. Another advantage of free choice: completely asynchronous agreement protocols;Ben-Or,1983

4. Brief announcement: simple gradecast based algorithms;Ben-Or,2010

5. Generalized FLP impossibility results for t-resilient asynchronous computations;Borowsky,1993

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

1. Byzantine fault tolerance in distributed machine learning: a survey;Journal of Experimental & Theoretical Artificial Intelligence;2024-09-12

2. Resilient Consensus for Discrete-Time Multi-agent Systems with Dynamic Leader and Tolerance to Node Failure;Lecture Notes in Electrical Engineering;2024

3. A Short Visit to Distributed Computing Where Simplicity Is Considered a First Class Property;The French School of Programming;2023-10-11

4. Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures;International Journal of Parallel, Emergent and Distributed Systems;2023-04-27

5. Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker;Logical Methods in Computer Science;2023-01-18

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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