{"publication_status":"published","doi":"10.1145/1989493.1989515","department":[{"_id":"63"}],"year":"2011","_id":"16453","publication_identifier":{"isbn":["9781450307437"]},"language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Degener_Kempkes_Langner_Meyer auf der Heide_Pietrzyk_Wattenhofer_2011, title={A tight runtime bound for synchronous gathering of autonomous robots with limited visibility}, DOI={10.1145/1989493.1989515}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Degener, Bastian and Kempkes, Barbara and Langner, Tobias and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Wattenhofer, Roger}, year={2011} }","short":"B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, R. Wattenhofer, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","ieee":"B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer, “A tight runtime bound for synchronous gathering of autonomous robots with limited visibility,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.","mla":"Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989515.","chicago":"Degener, Bastian, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, and Roger Wattenhofer. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011. https://doi.org/10.1145/1989493.1989515.","apa":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., & Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989515","ama":"Degener B, Kempkes B, Langner T, Meyer auf der Heide F, Pietrzyk P, Wattenhofer R. A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989515"},"date_created":"2020-04-07T12:31:24Z","publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Langner, Tobias","last_name":"Langner","first_name":"Tobias"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"},{"full_name":"Wattenhofer, Roger","first_name":"Roger","last_name":"Wattenhofer"}],"status":"public","date_updated":"2022-01-06T06:52:50Z","title":"A tight runtime bound for synchronous gathering of autonomous robots with limited visibility","type":"conference","user_id":"15415"}