Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes-Reference-Cited by-同舟云学术

Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes

Published:2021-07-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Ledent Jérémy¹

Affiliation:

1. University of Strathclyde, Glasgow, United Kingdom

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3465084.3467946

Reference12 articles.

1. Higher chordality: From graphs to complexes

2. The topology of look-compute-move robot wait-free algorithms with hard termination

3. Dan Alistarh Faith Ellen and Joel Rybicki. 2021. Wait-free approximate agreement on graphs. (2021). arxiv: cs.DC/2103.08949 Dan Alistarh Faith Ellen and Joel Rybicki. 2021. Wait-free approximate agreement on graphs. (2021). arxiv: cs.DC/2103.08949

4. The BG distributed simulation algorithm

5. Convergence and covering on graphs for wait-free robots;Armando Casta;J. Braz. Comput. Soc.,2018

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

1. Brief Announcement: Communication-Optimal Convex Agreement;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Multidimensional Approximate Agreement with Asynchronous Fallback;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

3. Wait-free approximate agreement on graphs;Theoretical Computer Science;2023-02

4. Optimal Synchronous Approximate Agreement with Asynchronous Fallback;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20