Optimal and competitive runtime bounds for continuous, local gathering of mobile robots - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

A Continuous, Local Strategy for Constructing a Short Chain of Mobile RobotsBastian Degener, Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide. sirocco 2010: 168-182 [doi]

runs on WebDSL