Silent MST Approximation for Tiny Memory
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-030-64348-5_10
Reference24 articles.
1. Barenboim, L., Elkin, M., Goldenberg, U.: Locally-iterative distributed ($$\Delta $$+ 1): -coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In: Newport, C., Keidar, I. (eds.) Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, 23–27 July 2018, pp. 437–446. ACM (2018)
2. Beauquier, J., Gradinariu, M., Johnen, C.: Memory space requirements for self-stabilizing leader election protocols. In: 18th Annual ACM Symposium on Principles of Distributed Computing, PODC 1999, pp. 199–207 (1999). https://doi.org/10.1145/301308.301358
3. Blin, L., Boubekeur, F., Dubois, S.: A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. J. Parallel Distrib. Comput. 117, 50–62 (2018). https://doi.org/10.1016/j.jpdc.2018.02.007
4. Blin, L., Dubois, S., Feuilloley, L.: Silent MST approximation for tiny memory. CoRR abs/1905.08565 (2019). http://arxiv.org/abs/1905.08565
5. Blin, L., Feuilloley, L., Bouder, G.L.: Brief announcement: memory lower bounds for self-stabilization. In: 33rd International Symposium on Distributed Computing, DISC 2019, Budapest, Hungary, 14–18 October 2019, vol. 146, pp. 37:1–37:3 (2019). https://doi.org/10.4230/LIPIcs.DISC.2019.37
Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimal Memory Requirement for Self-stabilizing Token Circulation;Lecture Notes in Computer Science;2024
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3