[{"_id":"16453","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","status":"public","date_updated":"2022-01-06T06:52:50Z","author":[{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"full_name":"Langner, Tobias","last_name":"Langner","first_name":"Tobias"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"},{"last_name":"Wattenhofer","full_name":"Wattenhofer, Roger","first_name":"Roger"}],"date_created":"2020-04-07T12:31:24Z","title":"A tight runtime bound for synchronous gathering of autonomous robots with limited visibility","doi":"10.1145/1989493.1989515","publication_status":"published","publication_identifier":{"isbn":["9781450307437"]},"year":"2011","citation":{"apa":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., &#38; Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>. <a href=\"https://doi.org/10.1145/1989493.1989515\">https://doi.org/10.1145/1989493.1989515</a>","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.","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={<a href=\"https://doi.org/10.1145/1989493.1989515\">10.1145/1989493.1989515</a>}, 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} }","mla":"Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011, doi:<a href=\"https://doi.org/10.1145/1989493.1989515\">10.1145/1989493.1989515</a>.","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: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>. ; 2011. doi:<a href=\"https://doi.org/10.1145/1989493.1989515\">10.1145/1989493.1989515</a>","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 <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011. <a href=\"https://doi.org/10.1145/1989493.1989515\">https://doi.org/10.1145/1989493.1989515</a>.","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 <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>, 2011."}},{"publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","citation":{"chicago":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011. <a href=\"https://doi.org/10.1145/1989493.1989517\">https://doi.org/10.1145/1989493.1989517</a>.","ieee":"P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain strategies via linear transformations,” in <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>, 2011.","ama":"Kling P, Meyer auf der Heide F. Convergence of local communication chain strategies via linear transformations. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>. ; 2011. doi:<a href=\"https://doi.org/10.1145/1989493.1989517\">10.1145/1989493.1989517</a>","apa":"Kling, P., &#38; Meyer auf der Heide, F. (2011). Convergence of local communication chain strategies via linear transformations. In <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>. <a href=\"https://doi.org/10.1145/1989493.1989517\">https://doi.org/10.1145/1989493.1989517</a>","bibtex":"@inproceedings{Kling_Meyer auf der Heide_2011, title={Convergence of local communication chain strategies via linear transformations}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989517\">10.1145/1989493.1989517</a>}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011} }","short":"P. Kling, F. Meyer auf der Heide, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","mla":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011, doi:<a href=\"https://doi.org/10.1145/1989493.1989517\">10.1145/1989493.1989517</a>."},"year":"2011","author":[{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-07T12:33:00Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1145/1989493.1989517","title":"Convergence of local communication chain strategies via linear transformations","publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16454","language":[{"iso":"eng"}]},{"citation":{"apa":"Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2011). Building Simple Formations in Large Societies of Tiny Mobile Robots. <i>Procedia Computer Science</i>, 153–155. <a href=\"https://doi.org/10.1016/j.procs.2011.09.049\">https://doi.org/10.1016/j.procs.2011.09.049</a>","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, Procedia Computer Science (2011) 153–155.","mla":"Degener, Bastian, et al. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” <i>Procedia Computer Science</i>, 2011, pp. 153–55, doi:<a href=\"https://doi.org/10.1016/j.procs.2011.09.049\">10.1016/j.procs.2011.09.049</a>.","bibtex":"@article{Degener_Kempkes_Meyer auf der Heide_2011, title={Building Simple Formations in Large Societies of Tiny Mobile Robots}, DOI={<a href=\"https://doi.org/10.1016/j.procs.2011.09.049\">10.1016/j.procs.2011.09.049</a>}, journal={Procedia Computer Science}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={153–155} }","ama":"Degener B, Kempkes B, Meyer auf der Heide F. Building Simple Formations in Large Societies of Tiny Mobile Robots. <i>Procedia Computer Science</i>. 2011:153-155. doi:<a href=\"https://doi.org/10.1016/j.procs.2011.09.049\">10.1016/j.procs.2011.09.049</a>","chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” <i>Procedia Computer Science</i>, 2011, 153–55. <a href=\"https://doi.org/10.1016/j.procs.2011.09.049\">https://doi.org/10.1016/j.procs.2011.09.049</a>.","ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building Simple Formations in Large Societies of Tiny Mobile Robots,” <i>Procedia Computer Science</i>, pp. 153–155, 2011."},"page":"153-155","year":"2011","publication_status":"published","publication_identifier":{"issn":["1877-0509"]},"doi":"10.1016/j.procs.2011.09.049","title":"Building Simple Formations in Large Societies of Tiny Mobile Robots","date_created":"2020-04-07T12:35:11Z","author":[{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:50Z","status":"public","type":"journal_article","publication":"Procedia Computer Science","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16455"},{"publication_identifier":{"isbn":["9783034801294","9783034801300"]},"publication_status":"published","citation":{"chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” In <i>Organic Computing — A Paradigm Shift for Complex Systems</i>. Basel, 2011. <a href=\"https://doi.org/10.1007/978-3-0348-0130-0_35\">https://doi.org/10.1007/978-3-0348-0130-0_35</a>.","ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising Robotic Exploration Teams,” in <i>Organic Computing — A Paradigm Shift for Complex Systems</i>, Basel, 2011.","ama":"Degener B, Kempkes B, Meyer auf der Heide F. Energy-Awareness in Self-organising Robotic Exploration Teams. In: <i>Organic Computing — A Paradigm Shift for Complex Systems</i>. Basel; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_35\">10.1007/978-3-0348-0130-0_35</a>","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.","mla":"Degener, Bastian, et al. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” <i>Organic Computing — A Paradigm Shift for Complex Systems</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_35\">10.1007/978-3-0348-0130-0_35</a>.","bibtex":"@inbook{Degener_Kempkes_Meyer auf der Heide_2011, place={Basel}, title={Energy-Awareness in Self-organising Robotic Exploration Teams}, DOI={<a href=\"https://doi.org/10.1007/978-3-0348-0130-0_35\">10.1007/978-3-0348-0130-0_35</a>}, booktitle={Organic Computing — A Paradigm Shift for Complex Systems}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }","apa":"Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2011). Energy-Awareness in Self-organising Robotic Exploration Teams. In <i>Organic Computing — A Paradigm Shift for Complex Systems</i>. Basel. <a href=\"https://doi.org/10.1007/978-3-0348-0130-0_35\">https://doi.org/10.1007/978-3-0348-0130-0_35</a>"},"place":"Basel","year":"2011","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-07T12:36:17Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-0348-0130-0_35","title":"Energy-Awareness in Self-organising Robotic Exploration Teams","publication":"Organic Computing — A Paradigm Shift for Complex Systems","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16456","language":[{"iso":"eng"}]},{"year":"2011","place":"Berlin, Heidelberg","citation":{"mla":"Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” <i>Structural Information and Communication Complexity</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.","bibtex":"@inbook{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, place={Berlin, Heidelberg}, title={Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>}, booktitle={Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }","apa":"Brandes, P., Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In <i>Structural Information and Communication Complexity</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">https://doi.org/10.1007/978-3-642-22212-2_13</a>","ama":"Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In: <i>Structural Information and Communication Complexity</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>","ieee":"P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in <i>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2011.","chicago":"Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” In <i>Structural Information and Communication Complexity</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">https://doi.org/10.1007/978-3-642-22212-2_13</a>."},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642222115","9783642222122"]},"title":"Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally","doi":"10.1007/978-3-642-22212-2_13","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-08T06:52:53Z","author":[{"first_name":"Philipp","last_name":"Brandes","full_name":"Brandes, Philipp"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","type":"book_chapter","publication":"Structural Information and Communication Complexity","language":[{"iso":"eng"}],"_id":"16459","user_id":"15415","department":[{"_id":"63"}]},{"status":"public","publication":"Journal of Interconnection Networks","type":"journal_article","language":[{"iso":"eng"}],"_id":"17009","department":[{"_id":"63"}],"user_id":"15415","year":"2011","page":"vii-viii","citation":{"ieee":"D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer auf der Heide, “EDITORIAL,” <i>Journal of Interconnection Networks</i>, pp. vii–viii, 2011.","chicago":"Hsu, D. Frank, Bruce M. Magga, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, and Friedhelm Meyer auf der Heide. “EDITORIAL.” <i>Journal of Interconnection Networks</i>, 2011, vii–viii. <a href=\"https://doi.org/10.1142/s0219265911002885\">https://doi.org/10.1142/s0219265911002885</a>.","ama":"Hsu DF, Magga BM, Ho HCT, Hromkovic J, Lau FCM, Meyer auf der Heide F. EDITORIAL. <i>Journal of Interconnection Networks</i>. 2011:vii-viii. doi:<a href=\"https://doi.org/10.1142/s0219265911002885\">10.1142/s0219265911002885</a>","apa":"Hsu, D. F., Magga, B. M., Ho, H. C. T., Hromkovic, J., Lau, F. C. M., &#38; Meyer auf der Heide, F. (2011). EDITORIAL. <i>Journal of Interconnection Networks</i>, vii–viii. <a href=\"https://doi.org/10.1142/s0219265911002885\">https://doi.org/10.1142/s0219265911002885</a>","mla":"Hsu, D. Frank, et al. “EDITORIAL.” <i>Journal of Interconnection Networks</i>, 2011, pp. vii–viii, doi:<a href=\"https://doi.org/10.1142/s0219265911002885\">10.1142/s0219265911002885</a>.","short":"D.F. Hsu, B.M. Magga, H.C.T. Ho, J. Hromkovic, F.C.M. Lau, F. Meyer auf der Heide, Journal of Interconnection Networks (2011) vii–viii.","bibtex":"@article{Hsu_Magga_Ho_Hromkovic_Lau_Meyer auf der Heide_2011, title={EDITORIAL}, DOI={<a href=\"https://doi.org/10.1142/s0219265911002885\">10.1142/s0219265911002885</a>}, journal={Journal of Interconnection Networks}, author={Hsu, D. Frank and Magga, Bruce M. and Ho, Howard C. T. and Hromkovic, Juraj and Lau, Francis C. M. and Meyer auf der Heide, Friedhelm}, year={2011}, pages={vii–viii} }"},"publication_identifier":{"issn":["0219-2659","1793-6713"]},"publication_status":"published","title":"EDITORIAL","doi":"10.1142/s0219265911002885","date_updated":"2022-01-06T06:53:01Z","author":[{"last_name":"Hsu","full_name":"Hsu, D. Frank","first_name":"D. Frank"},{"full_name":"Magga, Bruce M.","last_name":"Magga","first_name":"Bruce M."},{"first_name":"Howard C. T.","full_name":"Ho, Howard C. T.","last_name":"Ho"},{"full_name":"Hromkovic, Juraj","last_name":"Hromkovic","first_name":"Juraj"},{"first_name":"Francis C. M.","last_name":"Lau","full_name":"Lau, Francis C. M."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-05-18T13:35:10Z"},{"date_created":"2020-04-06T07:47:55Z","author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"full_name":"Hüllmann, Martina","last_name":"Hüllmann","first_name":"Martina"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"first_name":"Alexander","full_name":"Klaas, Alexander","last_name":"Klaas"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Sven","last_name":"Kurras","full_name":"Kurras, Sven"},{"first_name":"Marcus","last_name":"Märtens","full_name":"Märtens, Marcus"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Raupach","full_name":"Raupach, Christoph","first_name":"Christoph"},{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel"},{"first_name":"Christoph","last_name":"Weddemann","full_name":"Weddemann, Christoph"},{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"}],"date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-642-22012-8_52","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"publication_status":"published","citation":{"ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>.","ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>"},"year":"2011","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"user_id":"15415","_id":"16409","language":[{"iso":"eng"}],"publication":"Automata, Languages and Programming","type":"book_chapter","status":"public","abstract":[{"text":"Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.\r\n","lang":"eng"}]},{"publisher":"Heinz Nixdorf Institut","date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-30T07:25:59Z","author":[{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Schroeder","id":"477","full_name":"Schroeder, Ulf-Peter","first_name":"Ulf-Peter"}],"title":"A Large-Scale Distributed Environment for Peer-to-Peer Services","has_accepted_license":"1","year":"2010","place":"Paderborn","citation":{"chicago":"Gehweiler, Joachim, Friedhelm Meyer auf der Heide, and Ulf-Peter Schroeder. <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut, 2010.","ieee":"J. Gehweiler, F. Meyer auf der Heide, and U.-P. Schroeder, <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut, 2010.","ama":"Gehweiler J, Meyer auf der Heide F, Schroeder U-P. <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut; 2010.","short":"J. Gehweiler, F. Meyer auf der Heide, U.-P. Schroeder, A Large-Scale Distributed Environment for Peer-to-Peer Services, Heinz Nixdorf Institut, Paderborn, 2010.","bibtex":"@book{Gehweiler_Meyer auf der Heide_Schroeder_2010, place={Paderborn}, title={A Large-Scale Distributed Environment for Peer-to-Peer Services}, publisher={Heinz Nixdorf Institut}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Schroeder, Ulf-Peter}, year={2010} }","mla":"Gehweiler, Joachim, et al. <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Heinz Nixdorf Institut, 2010.","apa":"Gehweiler, J., Meyer auf der Heide, F., &#38; Schroeder, U.-P. (2010). <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut."},"_id":"17462","department":[{"_id":"63"}],"user_id":"15415","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-30T07:24:17Z","report_number":"tr-ri-10-317","type":"report","status":"public","file":[{"date_created":"2020-07-30T07:24:17Z","creator":"koala","date_updated":"2020-07-30T07:24:17Z","file_name":"tr-ri-10-317.pdf","file_id":"17463","access_level":"closed","file_size":468844,"content_type":"application/pdf","relation":"main_file","success":1}]},{"date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-30T07:48:53Z","author":[{"last_name":"Blesa","full_name":"Blesa, Maria J.","first_name":"Maria J."},{"first_name":"Christian","full_name":"Blum, Christian","last_name":"Blum"},{"full_name":"de Caro, Angelo","last_name":"de Caro","first_name":"Angelo"},{"last_name":"Degener","full_name":"Degener, Bastian ","first_name":"Bastian "},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"first_name":"Piere","last_name":"Leone","full_name":"Leone, Piere"},{"first_name":"Giuseppe","last_name":"Persiano","full_name":"Persiano, Giuseppe"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Georgios","full_name":"Mylonas, Georgios","last_name":"Mylonas"}],"title":"Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study","has_accepted_license":"1","year":"2010","citation":{"apa":"Blesa, M. J., Blum, C., de Caro, A., Degener, B., Kempkes, B., Leone, P., … Mylonas, G. (2010). <i>Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study</i>.","short":"M.J. Blesa, C. Blum, A. de Caro, B. Degener, B. Kempkes, P. Leone, G. Persiano, F. Meyer auf der Heide, G. Mylonas, Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study, 2010.","bibtex":"@book{Blesa_Blum_de Caro_Degener_Kempkes_Leone_Persiano_Meyer auf der Heide_Mylonas_2010, title={Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study}, author={Blesa, Maria J. and Blum, Christian and de Caro, Angelo and Degener, Bastian  and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe and Meyer auf der Heide, Friedhelm and Mylonas, Georgios}, year={2010} }","mla":"Blesa, Maria J., et al. <i>Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study</i>. 2010.","ama":"Blesa MJ, Blum C, de Caro A, et al. <i>Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study</i>.; 2010.","chicago":"Blesa, Maria J., Christian Blum, Angelo de Caro, Bastian  Degener, Barbara Kempkes, Piere Leone, Giuseppe Persiano, Friedhelm Meyer auf der Heide, and Georgios Mylonas. <i>Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study</i>, 2010.","ieee":"M. J. Blesa <i>et al.</i>, <i>Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study</i>. 2010."},"_id":"17464","department":[{"_id":"63"}],"user_id":"15415","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-30T07:48:24Z","type":"report","report_number":"FRONTS-TR-2010-11","status":"public","file":[{"file_size":242286,"file_name":"FRONTS-TR-2010-11.pdf","file_id":"17466","access_level":"closed","date_updated":"2020-07-30T07:48:24Z","date_created":"2020-07-30T07:48:24Z","creator":"koala","success":1,"relation":"main_file","content_type":"application/pdf"}]},{"file":[{"creator":"koala","date_created":"2020-08-04T12:26:55Z","date_updated":"2020-08-04T12:26:55Z","access_level":"closed","file_id":"17587","file_name":"BoundedStepwidth.pdf","file_size":476532,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"lang":"eng","text":"We are given a winding chain of $n$ mobile robots between two stations in the plane, each of them having a limited viewing range. It is only guaranteed that each robot can see its two neighbors in the chain. We analyze a simple and natural parallel strategy to shorten the chain in a time model where each relay is allowed to move up to a distance of $\\delta$ in each time step. This model fills the gap between the previously used discrete time model and the continuous time model which was introduced recently in \\cite{sirocco}. We analyze the strategy with respect to two quality measures: the number of time steps and the maximum distance to be traveled by the robots, which are the major energy consumers in this scenario. We provide asymptotically tight or almost tight bounds in this time model for both quality measures and it turns out that the best choice for $\\delta$ is $\\delta \\in \\Theta(\\frac{1}{n})$, since this minimizes the number of time steps as well as the maximum traveled distance."}],"type":"preprint","file_date_updated":"2020-08-04T12:26:55Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"15415","department":[{"_id":"63"}],"_id":"17586","citation":{"ama":"Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Building short chains of mobile robots locally with a bounded stepwidth. 2010.","ieee":"P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building short chains of mobile robots locally with a bounded stepwidth.” 2010.","chicago":"Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Building Short Chains of Mobile Robots Locally with a Bounded Stepwidth,” 2010.","apa":"Brandes, P., Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2010). Building short chains of mobile robots locally with a bounded stepwidth.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, (2010).","mla":"Brandes, Philipp, et al. <i>Building Short Chains of Mobile Robots Locally with a Bounded Stepwidth</i>. 2010.","bibtex":"@article{Brandes_Degener_Kempkes_Meyer auf der Heide_2010, title={Building short chains of mobile robots locally with a bounded stepwidth}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2010} }"},"year":"2010","has_accepted_license":"1","title":"Building short chains of mobile robots locally with a bounded stepwidth","author":[{"first_name":"Philipp","full_name":"Brandes, Philipp","last_name":"Brandes"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-08-04T12:28:05Z","date_updated":"2022-01-06T06:53:15Z"},{"publication":"Informatik Spektrum","type":"journal_article","status":"public","_id":"1903","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","language":[{"iso":"eng"}],"issue":"5","year":"2010","page":"468--474","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” <i>Informatik Spektrum</i>, no. 5, pp. 468--474, 2010.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5 (2010): 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>.","ama":"Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>. 2010;(5):468--474. doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5, 2010, pp. 468--474, doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.","bibtex":"@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>, (5), 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>"},"date_updated":"2022-01-06T06:53:57Z","date_created":"2018-03-28T07:21:50Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"title":"Algorithmische Grundlagen verteilter Speichersysteme","doi":"10.1007/s00287-010-0470-2"},{"language":[{"iso":"eng"}],"_id":"16414","department":[{"_id":"63"}],"user_id":"15415","status":"public","type":"conference","title":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","doi":"10.1145/1810479","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-06T10:42:26Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Phillips","full_name":"Phillips, Cynthia A.","first_name":"Cynthia A."}],"year":"2010","citation":{"ama":"Meyer auf der Heide F, Phillips CA. Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. In: ; 2010. doi:<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>","chicago":"Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. “Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10,” 2010. <a href=\"https://doi.org/10.1145/1810479\">https://doi.org/10.1145/1810479</a>.","ieee":"F. Meyer auf der Heide and C. A. Phillips, “Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10,” 2010.","apa":"Meyer auf der Heide, F., &#38; Phillips, C. A. (2010). Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. <a href=\"https://doi.org/10.1145/1810479\">https://doi.org/10.1145/1810479</a>","short":"F. Meyer auf der Heide, C.A. Phillips, in: 2010.","bibtex":"@inproceedings{Meyer auf der Heide_Phillips_2010, title={Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10}, DOI={<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>}, author={Meyer auf der Heide, Friedhelm and Phillips, Cynthia A.}, year={2010} }","mla":"Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>. 2010, doi:<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>."},"publication_identifier":{"isbn":["9781450300797"]},"publication_status":"published"},{"_id":"16365","department":[{"_id":"63"}],"series_title":"SIROCCO 2010","user_id":"15415","language":[{"iso":"eng"}],"publication":"Structural Information and Communication Complexity","type":"book_chapter","status":"public","date_updated":"2022-01-06T06:52:49Z","author":[{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-02T13:56:17Z","title":"A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots","doi":"10.1007/978-3-642-13284-1_14","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642132834","9783642132841"]},"publication_status":"published","year":"2010","place":"Berlin, Heidelberg","page":"168-182","citation":{"ama":"Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: <i>Structural Information and Communication Complexity</i>. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>","ieee":"B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in <i>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2010, pp. 168–182.","chicago":"Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” In <i>Structural Information and Communication Complexity</i>, 168–82. SIROCCO 2010. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>.","bibtex":"@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin, Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>}, booktitle={Structural Information and Communication Complexity}, author={Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2010}, pages={168–182}, collection={SIROCCO 2010} }","mla":"Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” <i>Structural Information and Communication Complexity</i>, 2010, pp. 168–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>.","short":"B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.","apa":"Degener, B., Kempkes, B., Kling, P., &#38; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In <i>Structural Information and Communication Complexity</i> (pp. 168–182). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>"}},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16401","status":"public","type":"conference","publication":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","doi":"10.1145/1810479.1810523","title":"A local O(n2) gathering algorithm","date_created":"2020-04-03T12:48:11Z","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:50Z","citation":{"ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering algorithm,” in <i>Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10</i>, 2010.","chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Local O(N2) Gathering Algorithm.” In <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>, 2010. <a href=\"https://doi.org/10.1145/1810479.1810523\">https://doi.org/10.1145/1810479.1810523</a>.","ama":"Degener B, Kempkes B, Meyer auf der Heide F. A local O(n2) gathering algorithm. In: <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>. ; 2010. doi:<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>","apa":"Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2010). A local O(n2) gathering algorithm. In <i>Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10</i>. <a href=\"https://doi.org/10.1145/1810479.1810523\">https://doi.org/10.1145/1810479.1810523</a>","bibtex":"@inproceedings{Degener_Kempkes_Meyer auf der Heide_2010, title={A local O(n2) gathering algorithm}, DOI={<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>}, booktitle={Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2010} }","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010.","mla":"Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.” <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>, 2010, doi:<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>."},"year":"2010","publication_status":"published","publication_identifier":{"isbn":["9781450300797"]}},{"editor":[{"last_name":"Abramsky","full_name":"Abramsky, Samson","first_name":"Samson"},{"first_name":"Cyril","last_name":"Gavoille","full_name":"Gavoille, Cyril"},{"last_name":"Kirchner","full_name":"Kirchner, Claude","first_name":"Claude"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Spirakis","full_name":"Spirakis, Paul G.","first_name":"Paul G."}],"status":"public","type":"book_editor","language":[{"iso":"eng"}],"_id":"16403","user_id":"15415","department":[{"_id":"63"}],"year":"2010","place":"Berlin, Heidelberg","citation":{"apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>.","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg, 2010.","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>}, year={2010} }","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>.","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010.","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>"},"publication_status":"published","publication_identifier":{"isbn":["9783642141614","9783642141621"],"issn":["0302-9743","1611-3349"]},"title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.","doi":"10.1007/978-3-642-14162-1","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-03T12:56:30Z"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642141614","9783642141621"]},"publication_status":"published","citation":{"bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>}, year={2010} }","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>.","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg, 2010.","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>.","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010."},"place":"Berlin, Heidelberg","year":"2010","date_created":"2020-04-03T12:58:05Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-642-14165-2","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.","type":"book_editor","status":"public","editor":[{"full_name":"Abramsky, Samson","last_name":"Abramsky","first_name":"Samson"},{"first_name":"Cyril","full_name":"Gavoille, Cyril","last_name":"Gavoille"},{"last_name":"Kirchner","full_name":"Kirchner, Claude","first_name":"Claude"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Paul G.","full_name":"Spirakis, Paul G.","last_name":"Spirakis"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16404","language":[{"iso":"eng"}]},{"year":"2009","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” <i>Public Service Review: Science and Technology</i> 04 (2009).","ieee":"F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,” <i>Public Service Review: Science and Technology</i>, vol. 04, 2009.","ama":"Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization. <i>Public Service Review: Science and Technology</i>. 2009;04.","bibtex":"@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology}, author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }","mla":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” <i>Public Service Review: Science and Technology</i>, vol. 04, 2009.","short":"F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and Technology 04 (2009).","apa":"Meyer auf der Heide, F., &#38; Rammig, F.-J. (2009). Self-Organisation and Self-Optimization. <i>Public Service Review: Science and Technology</i>, <i>04</i>."},"intvolume":"         4","title":"Self-Organisation and Self-Optimization","date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-29T13:51:54Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Franz-Josef","full_name":"Rammig, Franz-Josef","last_name":"Rammig"}],"volume":"04","status":"public","type":"journal_article","publication":"Public Service Review: Science and Technology","language":[{"iso":"eng"}],"_id":"17453","user_id":"15415","department":[{"_id":"63"}]},{"abstract":[{"text":"For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others) from p? The present work explores the trade-off between query time\r\nand preprocessing space for these quantities in 2D: exactly, in the approximate\r\ndeterministic, and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space data structure for S that, given p and time O(log n), allows\r\nto approximate the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically is just linear in the size n of the scene S. On the other hand,\r\nwe present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing time and space with similar approximation properties and query\r\ntime O(k*polylog n), where k<n is an arbitrary parameter. We describe an\r\nimplementation of this approach and demonstrate the practical benefit of the\r\nparameter k to trade memory for query time in an empirical evaluation on three\r\nclasses of benchmark scenes.","lang":"eng"}],"status":"public","type":"conference","publication":"Proc. 25th European Workshop on Computational Geometry","language":[{"iso":"eng"}],"_id":"18346","user_id":"15415","department":[{"_id":"63"}],"year":"2009","citation":{"ama":"Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. In: <i>Proc. 25th European Workshop on Computational Geometry</i>. ; 2009:203-206.","ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” in <i>Proc. 25th European Workshop on Computational Geometry</i>, 2009, pp. 203–206.","chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” In <i>Proc. 25th European Workshop on Computational Geometry</i>, 203–6, 2009.","apa":"Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., &#38; Ziegler, M. (2009). Planar Visibility Counting. In <i>Proc. 25th European Workshop on Computational Geometry</i> (pp. 203–206).","bibtex":"@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206} }","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” <i>Proc. 25th European Workshop on Computational Geometry</i>, 2009, pp. 203–06.","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in: Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206."},"page":"203-206","title":"Planar Visibility Counting","date_updated":"2022-01-06T06:53:29Z","author":[{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"last_name":"Hilbig","full_name":"Hilbig, Matthias","first_name":"Matthias"},{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-08-26T08:49:50Z"},{"language":[{"iso":"eng"}],"_id":"16429","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Theoretical Computer Science","type":"journal_article","title":"Optimal strategies for maintaining a chain of relays between an explorer and a base camp","doi":"10.1016/j.tcs.2008.04.010","date_updated":"2022-01-06T06:52:50Z","author":[{"last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław","first_name":"Jarosław"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-06T13:52:18Z","year":"2009","page":"3391-3405","citation":{"ieee":"J. Kutyłowski and F. Meyer auf der Heide, “Optimal strategies for maintaining a chain of relays between an explorer and a base camp,” <i>Theoretical Computer Science</i>, pp. 3391–3405, 2009.","chicago":"Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” <i>Theoretical Computer Science</i>, 2009, 3391–3405. <a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">https://doi.org/10.1016/j.tcs.2008.04.010</a>.","ama":"Kutyłowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain of relays between an explorer and a base camp. <i>Theoretical Computer Science</i>. 2009:3391-3405. doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">10.1016/j.tcs.2008.04.010</a>","apa":"Kutyłowski, J., &#38; Meyer auf der Heide, F. (2009). Optimal strategies for maintaining a chain of relays between an explorer and a base camp. <i>Theoretical Computer Science</i>, 3391–3405. <a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">https://doi.org/10.1016/j.tcs.2008.04.010</a>","bibtex":"@article{Kutyłowski_Meyer auf der Heide_2009, title={Optimal strategies for maintaining a chain of relays between an explorer and a base camp}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">10.1016/j.tcs.2008.04.010</a>}, journal={Theoretical Computer Science}, author={Kutyłowski, Jarosław and Meyer auf der Heide, Friedhelm}, year={2009}, pages={3391–3405} }","mla":"Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” <i>Theoretical Computer Science</i>, 2009, pp. 3391–405, doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">10.1016/j.tcs.2008.04.010</a>.","short":"J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405."},"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published"},{"status":"public","publication":"Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09","type":"conference","language":[{"iso":"eng"}],"_id":"16430","department":[{"_id":"63"}],"user_id":"15415","year":"2009","citation":{"apa":"Mehler, J., &#38; Meyer auf der Heide, F. (2009). Power-aware online file allocation in mobile ad hoc networks. In <i>Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09</i>. <a href=\"https://doi.org/10.1145/1583991.1584072\">https://doi.org/10.1145/1583991.1584072</a>","short":"J. Mehler, F. Meyer auf der Heide, in: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.","mla":"Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>, 2009, doi:<a href=\"https://doi.org/10.1145/1583991.1584072\">10.1145/1583991.1584072</a>.","bibtex":"@inproceedings{Mehler_Meyer auf der Heide_2009, title={Power-aware online file allocation in mobile ad hoc networks}, DOI={<a href=\"https://doi.org/10.1145/1583991.1584072\">10.1145/1583991.1584072</a>}, booktitle={Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, author={Mehler, Jan and Meyer auf der Heide, Friedhelm}, year={2009} }","chicago":"Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” In <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>, 2009. <a href=\"https://doi.org/10.1145/1583991.1584072\">https://doi.org/10.1145/1583991.1584072</a>.","ieee":"J. Mehler and F. Meyer auf der Heide, “Power-aware online file allocation in mobile ad hoc networks,” in <i>Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09</i>, 2009.","ama":"Mehler J, Meyer auf der Heide F. Power-aware online file allocation in mobile ad hoc networks. In: <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>. ; 2009. doi:<a href=\"https://doi.org/10.1145/1583991.1584072\">10.1145/1583991.1584072</a>"},"publication_identifier":{"isbn":["9781605586069"]},"publication_status":"published","title":"Power-aware online file allocation in mobile ad hoc networks","doi":"10.1145/1583991.1584072","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Jan","full_name":"Mehler, Jan","last_name":"Mehler"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-06T13:53:57Z"}]