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]
@inproceedings{KempkesKH12,
title = {Optimal and competitive runtime bounds for continuous, local gathering of mobile robots},
author = {Barbara Kempkes and Peter Kling and Friedhelm Meyer auf der Heide},
year = {2012},
doi = {10.1145/2312005.2312009},
url = {http://doi.acm.org/10.1145/2312005.2312009},
researchr = {https://researchr.org/publication/KempkesKH12},
cites = {0},
citedby = {0},
pages = {18-26},
booktitle = {24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012},
editor = {Guy E. Blelloch and Maurice Herlihy},
publisher = {ACM},
isbn = {978-1-4503-1213-4},
}