{"doi":"10.1145/2312005.2312009","citation":{"bibtex":"@inproceedings{Kempkes_Kling_Meyer auf der Heide_2012, title={Optimal and competitive runtime bounds for continuous, local gathering of mobile robots}, DOI={<a href=\"https://doi.org/10.1145/2312005.2312009\">10.1145/2312005.2312009</a>}, 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} }","ieee":"B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Optimal and competitive runtime bounds for continuous, local gathering of mobile robots,” in <i>Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12</i>, 2012.","chicago":"Kempkes, Barbara, Peter Kling, and Friedhelm Meyer auf der Heide. “Optimal and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots.” In <i>Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12</i>, 2012. <a href=\"https://doi.org/10.1145/2312005.2312009\">https://doi.org/10.1145/2312005.2312009</a>.","ama":"Kempkes B, Kling P, Meyer auf der Heide F. Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In: <i>Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12</i>. ; 2012. doi:<a href=\"https://doi.org/10.1145/2312005.2312009\">10.1145/2312005.2312009</a>","apa":"Kempkes, B., Kling, P., &#38; Meyer auf der Heide, F. (2012). Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In <i>Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA ’12</i>. <a href=\"https://doi.org/10.1145/2312005.2312009\">https://doi.org/10.1145/2312005.2312009</a>","short":"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.","mla":"Kempkes, Barbara, et al. “Optimal and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots.” <i>Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12</i>, 2012, doi:<a href=\"https://doi.org/10.1145/2312005.2312009\">10.1145/2312005.2312009</a>."},"user_id":"15415","department":[{"_id":"63"}],"publication":"Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA '12","title":"Optimal and competitive runtime bounds for continuous, local gathering of mobile robots","date_created":"2020-04-07T06:43:11Z","type":"conference","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450312134"]},"_id":"16446","year":"2012","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","status":"public","author":[{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}]}