Author:
Bramas Quentin,Tixeuil Sébastien
Publisher
Springer International Publishing
Reference10 articles.
1. Lecture Notes in Computer Science;E Anagnostou,1992
2. Aurenhammer, F.: Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput. Surv. (CSUR) 23(3), 345–405 (1991)
3. Bramas, Q., Tixeuil, S.: The random bit complexity of mobile robots scattering. CoRR abs/1309.6603 (2015).
http://arxiv.org/abs/1309.6603
4. Clément, J., Défago, X., Potop-Butucaru, M.G., Izumi, T., Messika, S.: The cost of probabilistic agreement in oblivious robot networks. Inf. Process. Lett. 110(11), 431–438 (2010)
5. Lecture Notes in Computer Science;Y Dieudonné,2007
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fault-induced dynamics of oblivious robots on a line;Information and Computation;2020-04
2. The Random Bit Complexity of Mobile Robots Scattering;International Journal of Foundations of Computer Science;2017-02