Optimal and competitive runtime bounds for continuous, local gathering of mobile robots

Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide. Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In Guy E. Blelloch, Maurice Herlihy, editors, 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. pages 18-26, ACM, 2012. [doi]

Abstract

Abstract is missing.