Low Communication Self-stabilization through Randomization

Author:

Kutten Shay,Zinenko Dmitry

Publisher

Springer Berlin Heidelberg

Reference31 articles.

1. Afek, Y., Gafni, E.: Time and message bounds for election in synchronous and asynchronous complete networks. In: PODC’85, pp. 186–195. ACM, New York (1985)

2. Lecture Notes in Computer Science;Y. Afek,1992

3. Afek, Y., Matias, Y.: Elections in anonymous networks. Information and Computation Journal 113(2), 312–330 (1994)

4. Lecture Notes in Computer Science;S. Aggarwal,1993

5. Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computing 43(9), 1026–1038 (1994)

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

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

2. Brief Announcement;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21

3. Smoothed Analysis of Leader Election in Distributed Networks;Lecture Notes in Computer Science;2020

4. The first fully polynomial stabilizing algorithm for BFS tree construction;Information and Computation;2019-04

5. A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees;Lecture Notes in Computer Science;2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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