共 50 条
- [1] Brief Announcement: Certified Impossibility Results for Byzantine-Tolerant Mobile Robots DISTRIBUTED COMPUTING, 2013, 8205 : 575 - 576
- [2] The Extended BG-Simulation and the Characterization of t-Resiliency STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 85 - 91
- [3] Brief Announcement: Wait-Free Gathering of Mobile Robots DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 401 - 402
- [4] Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2017, 2018, 10616 : 484 - 488
- [5] Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 16 - 21
- [6] Brief Announcement: Byzantine Agreement with Homonyms SPAA '10: PROCEEDINGS OF THE TWENTY-SECOND ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2010, : 74 - 75
- [8] Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 405 - +
- [9] Brief Announcement: Accurate Byzantine Agreement with Feedback PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 215 - 216
- [10] Brief Announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots PROCEEDINGS OF THE 2016 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'16), 2016, : 439 - 441