Multidimensional approximate agreement in Byzantine asynchronous systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Theoretical Computer Science
Hi-index | 0.00 |
This paper surveys the main caracteristics of the distributed models proposed for robot networks and briefly presents the latest algorithmic achievements for tackling the agreement abstraction in both continuous and discrete spaces.