共 50 条
- [21] Brief Announcement: Validity Bound of Regular Registers with Churn and Byzantine Processes PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 225 - 226
- [22] Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 127 - 132
- [23] Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 325 - 327
- [24] Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with FewerWords PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 421 - 423
- [25] Brief Announcement: Communication-Efficient Byzantine Consensus without a Common Clock DISTRIBUTED COMPUTING, 2013, 8205 : 567 - +
- [26] Brief Announcement: A Platform for Experimenting with Mobile Algorithms in a Laboratory PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 316 - 317
- [27] Brief announcement: Sweep coverage with mobile and static sensors Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8756 : 346 - 348
- [28] Certified Impossibility Results for Byzantine-Tolerant Mobile Robots STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2013, 2013, 8255 : 178 - 190
- [29] Brief Announcement: Sweep Coverage with Mobile and Static Sensors STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2014, 2014, 8756 : 346 - 348
- [30] Brief Announcement: Fast Scalable Byzantine Agreement in the Full Information Model with a Nonadaptive Adversary PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 304 - 305