Author:
Castañeda Armando,Rajsbaum Sergio,Roy Matthieu
Funder
Universidad Nacional Autónoma de México
Cyber-Physical Systems (CPS)
Publisher
Springer Science and Business Media LLC
Reference30 articles.
1. Agmon N, Peleg D (2006) Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J Comput 36(1):56–82.
2. Alcántara M, Castañeda A, Peñaloza DF, Rajsbaum S (2017) Fault-tolerant robot gathering problems on graphs with arbitrary appearing times In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 493–502.. IEEE.
3. Attiya H, Bar-Noy A, Dolev D (1995) Sharing memory robustly in message-passing systems. J ACM 42(1):124–142.
4. Attiya H, Bar-Noy A, Dolev D, Peleg D, Reischuk R (1990) Renaming in an asynchronous environment. J ACM 37(3):524–548.
5. Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations, and advanced topics. Wiley.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tolerance to Asynchrony of an Algorithm for Gathering Myopic Robots on an Infinite Triangular Grid;2024 19th European Dependable Computing Conference (EDCC);2024-04-08
2. Why Extension-Based Proofs Fail;SIAM Journal on Computing;2023-07-25
3. Wait-free approximate agreement on graphs;Theoretical Computer Science;2023-02
4. Tight Bounds for Asymptotic and Approximate Consensus;Journal of the ACM;2021-12-31
5. Reductions and Extension-Based Proofs;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21