Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12, 2012.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Kempkes, Barbara;
Kling, Peter;
Meyer auf der Heide, FriedhelmLibreCat
Publishing Year
Proceedings Title
Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA '12
ISBN
LibreCat-ID
Cite this
Kempkes B, Kling P, Meyer auf der Heide F. Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In: Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12. ; 2012. doi:10.1145/2312005.2312009
Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2012). Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12. https://doi.org/10.1145/2312005.2312009
@inproceedings{Kempkes_Kling_Meyer auf der Heide_2012, title={Optimal and competitive runtime bounds for continuous, local gathering of mobile robots}, DOI={10.1145/2312005.2312009}, booktitle={Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12}, author={Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2012} }
Kempkes, Barbara, Peter Kling, and Friedhelm Meyer auf der Heide. “Optimal and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots.” In Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12, 2012. https://doi.org/10.1145/2312005.2312009.
B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Optimal and competitive runtime bounds for continuous, local gathering of mobile robots,” in Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12, 2012.
Kempkes, Barbara, et al. “Optimal and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots.” Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12, 2012, doi:10.1145/2312005.2312009.
Google Scholar
ISBN Search