[{"department":[{"_id":"63"}],"type":"conference","date_created":"2017-10-17T12:43:00Z","file":[{"date_created":"2018-03-14T13:48:21Z","creator":"florida","file_id":"1219","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-14T13:48:21Z","file_name":"657-flp_algosensors2011-Cord-Landwehr.pdf","file_size":454740,"access_level":"closed"}],"abstract":[{"lang":"eng","text":"We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\\epsilon} n) communication rounds and yields a \\my^4(1+4\\my^2(1+\\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\\epsilon} n) communication rounds and an approximation factor of \\my^4(1 + 2(1 + \\epsilon)^{1/p})^p. Here, \\epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \\my the relative measurement error."}],"publication":"Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)","doi":"10.1007/978-3-642-28209-6_3","language":[{"iso":"eng"}],"series_title":"LNCS","date_updated":"2022-01-06T07:03:12Z","author":[{"full_name":"Abshoff, Sebastan","first_name":"Sebastan","last_name":"Abshoff"},{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Kempkes","first_name":"Barbara ","full_name":"Kempkes, Barbara "},{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"}],"year":"2011","title":"Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"chicago":"Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara  Kempkes, and Peter Pietrzyk. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 13–27. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>.","short":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, P. Pietrzyk, in: Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.","ama":"Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In: <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>. LNCS. ; 2011:13-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Degener_Kempkes_Pietrzyk_2011, series={LNCS}, title={Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)}, author={Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and Kempkes, Barbara  and Pietrzyk, Peter}, year={2011}, pages={13–27}, collection={LNCS} }","mla":"Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>.","apa":"Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2011). Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i> (pp. 13–27). <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>","ieee":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27."},"file_date_updated":"2018-03-14T13:48:21Z","user_id":"477","ddc":["040"],"_id":"657","page":"13-27","has_accepted_license":"1","status":"public"},{"user_id":"477","language":[{"iso":"eng"}],"_id":"663","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:13Z","author":[{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"}],"title":"Complexity Classes for Local Computation","status":"public","year":"2011","department":[{"_id":"63"}],"type":"mastersthesis","date_created":"2017-10-17T12:43:01Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"ama":"Swierkot K. <i>Complexity Classes for Local Computation</i>. Universität Paderborn; 2011.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","mla":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","short":"K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011.","chicago":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","apa":"Swierkot, K. (2011). <i>Complexity Classes for Local Computation</i>. Universität Paderborn.","ieee":"K. Swierkot, <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}]},{"series_title":"LNCS","doi":"10.1007/978-3-642-31500-8_4","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2011","title":"An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment","date_updated":"2022-01-06T07:03:14Z","date_created":"2017-10-17T12:43:01Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1216","access_level":"closed","file_size":333335,"file_name":"664-PPAM11GKM_01.pdf","date_updated":"2018-03-14T13:45:57Z","relation":"main_file","date_created":"2018-03-14T13:45:57Z","creator":"florida"}],"department":[{"_id":"63"}],"type":"conference","publication":"Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)","abstract":[{"text":"Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. The PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying \"parallel computer\": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion.In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources.Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors.","lang":"eng"}],"_id":"664","page":"31--40","user_id":"15504","ddc":["040"],"status":"public","has_accepted_license":"1","citation":{"apa":"Gehweiler, J., Kling, P., &#38; Meyer auf der Heide, F. (2011). An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 31--40). <a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">https://doi.org/10.1007/978-3-642-31500-8_4</a>","ieee":"J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2011, pp. 31--40.","chicago":"Gehweiler, Joachim, Peter Kling, and Friedhelm Meyer auf der Heide. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” In <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 31--40. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">https://doi.org/10.1007/978-3-642-31500-8_4</a>.","short":"J. Gehweiler, P. Kling, F. Meyer auf der Heide, in: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.","mla":"Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2011, pp. 31--40, doi:<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>.","ama":"Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In: <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. LNCS. ; 2011:31--40. doi:<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>","bibtex":"@inproceedings{Gehweiler_Kling_Meyer auf der Heide_2011, series={LNCS}, title={An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>}, booktitle={Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Gehweiler, Joachim and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011}, pages={31--40}, collection={LNCS} }"},"file_date_updated":"2018-03-14T13:45:57Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"editor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Rajaraman","first_name":"Rajmohan ","full_name":"Rajaraman, Rajmohan "}],"user_id":"477","doi":"10.1145/1989493","language":[{"iso":"eng"}],"_id":"667","date_updated":"2022-01-06T07:03:14Z","title":"23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures","status":"public","year":"2011","department":[{"_id":"63"}],"type":"conference_editor","date_created":"2017-10-17T12:43:02Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"ieee":"F. Meyer auf der Heide and R. Rajaraman, Eds., <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011.","apa":"Meyer auf der Heide, F., &#38; Rajaraman, R. (Eds.). (2011). <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>","mla":"Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011, doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>.","bibtex":"@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures}, DOI={<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>}, year={2011} }","chicago":"Meyer auf der Heide, Friedhelm, and Rajmohan  Rajaraman, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2011. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>.","ama":"Meyer auf der Heide F, Rajaraman R, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>.; 2011. doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>","short":"F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011."}},{"status":"public","_id":"16410","publisher":"Springer","page":"178-189","user_id":"15415","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, no. 6543, Springer, 2011, pp. 178–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>. Springer; 2011:178-189. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>","bibtex":"@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, number={6543}, booktitle={37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, 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}, pages={178–189} }","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i> (pp. 178–189). Springer. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 2011, no. 6543, pp. 178–189.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 178–89. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>.","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: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011, pp. 178–189."},"publication_identifier":{"isbn":["9783642183805","9783642183812"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"},{"full_name":"Hüllmann, Martina","last_name":"Hüllmann","first_name":"Martina"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"full_name":"Klaas, Alexander","last_name":"Klaas","first_name":"Alexander"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"last_name":"Kurras","first_name":"Sven","full_name":"Kurras, Sven"},{"first_name":"Marcus","last_name":"Märtens","full_name":"Märtens, Marcus"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Raupach, Christoph","first_name":"Christoph","last_name":"Raupach"},{"full_name":"Swierkot, Kamil","last_name":"Swierkot","first_name":"Kamil"},{"last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"}],"title":"Collisionless Gathering of Robots with an Extent","year":"2011","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-18381-2_15","publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","issue":"6543","abstract":[{"lang":"eng","text":"Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version."}],"date_created":"2020-04-06T07:52:42Z","department":[{"_id":"63"}],"type":"conference"},{"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-06T10:10:39Z","place":"Berlin, Heidelberg","publication":"Algorithms Unplugged","citation":{"bibtex":"@inbook{Gehweiler_Meyer auf der Heide_2011, place={Berlin, Heidelberg}, title={Bin Packing - How Do I Get My Stuff into the Boxes}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">10.1007/978-3-642-15328-0_38</a>}, booktitle={Algorithms Unplugged}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2011}, pages={367–374} }","ama":"Gehweiler J, Meyer auf der Heide F. Bin Packing - How Do I Get My Stuff into the Boxes. In: <i>Algorithms Unplugged</i>. Berlin, Heidelberg; 2011:367-374. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">10.1007/978-3-642-15328-0_38</a>","mla":"Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” <i>Algorithms Unplugged</i>, 2011, pp. 367–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">10.1007/978-3-642-15328-0_38</a>.","short":"J. Gehweiler, F. Meyer auf der Heide, in: Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374.","chicago":"Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” In <i>Algorithms Unplugged</i>, 367–74. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">https://doi.org/10.1007/978-3-642-15328-0_38</a>.","ieee":"J. Gehweiler and F. Meyer auf der Heide, “Bin Packing - How Do I Get My Stuff into the Boxes,” in <i>Algorithms Unplugged</i>, Berlin, Heidelberg, 2011, pp. 367–374.","apa":"Gehweiler, J., &#38; Meyer auf der Heide, F. (2011). Bin Packing - How Do I Get My Stuff into the Boxes. In <i>Algorithms Unplugged</i> (pp. 367–374). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">https://doi.org/10.1007/978-3-642-15328-0_38</a>"},"user_id":"15415","doi":"10.1007/978-3-642-15328-0_38","page":"367-374","language":[{"iso":"eng"}],"_id":"16412","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","year":"2011","title":"Bin Packing - How Do I Get My Stuff into the Boxes","status":"public","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"isbn":["9783642153273","9783642153280"]}},{"citation":{"apa":"Rajaraman, R., &#38; Meyer auf der Heide, F. (2011). Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>","ieee":"R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,” 2011.","chicago":"Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. “Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11,” 2011. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>.","short":"R. Rajaraman, F. Meyer auf der Heide, in: 2011.","mla":"Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. <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\">10.1145/1989493</a>.","ama":"Rajaraman R, Meyer auf der Heide F. Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. In: ; 2011. doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>","bibtex":"@inproceedings{Rajaraman_Meyer auf der Heide_2011, title={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, DOI={<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>}, author={Rajaraman, Rajmohan and Meyer auf der Heide, Friedhelm}, year={2011} }"},"department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-06T13:48:10Z","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","author":[{"full_name":"Rajaraman, Rajmohan","last_name":"Rajaraman","first_name":"Rajmohan"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"publication_identifier":{"isbn":["9781450307437"]},"status":"public","year":"2011","title":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","doi":"10.1145/1989493","user_id":"15415","_id":"16428","language":[{"iso":"eng"}]},{"publication":"Computer Science Review","citation":{"mla":"Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” <i>Computer Science Review</i>, 2011, pp. 57–68, doi:<a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">10.1016/j.cosrev.2010.09.005</a>.","bibtex":"@article{Degener_Fekete_Kempkes_Meyer auf der Heide_2011, title={A survey on relay placement with runtime and approximation guarantees}, DOI={<a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">10.1016/j.cosrev.2010.09.005</a>}, journal={Computer Science Review}, author={Degener, Bastian and Fekete, Sándor P. and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={57–68} }","ama":"Degener B, Fekete SP, Kempkes B, Meyer auf der Heide F. A survey on relay placement with runtime and approximation guarantees. <i>Computer Science Review</i>. 2011:57-68. doi:<a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">10.1016/j.cosrev.2010.09.005</a>","ieee":"B. Degener, S. P. Fekete, B. Kempkes, and F. Meyer auf der Heide, “A survey on relay placement with runtime and approximation guarantees,” <i>Computer Science Review</i>, pp. 57–68, 2011.","apa":"Degener, B., Fekete, S. P., Kempkes, B., &#38; Meyer auf der Heide, F. (2011). A survey on relay placement with runtime and approximation guarantees. <i>Computer Science Review</i>, 57–68. <a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">https://doi.org/10.1016/j.cosrev.2010.09.005</a>","short":"B. Degener, S.P. Fekete, B. Kempkes, F. Meyer auf der Heide, Computer Science Review (2011) 57–68.","chicago":"Degener, Bastian, Sándor P. Fekete, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” <i>Computer Science Review</i>, 2011, 57–68. <a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">https://doi.org/10.1016/j.cosrev.2010.09.005</a>."},"date_created":"2020-04-07T06:46:06Z","type":"journal_article","department":[{"_id":"63"}],"status":"public","title":"A survey on relay placement with runtime and approximation guarantees","year":"2011","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"last_name":"Fekete","first_name":"Sándor P.","full_name":"Fekete, Sándor P."},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_identifier":{"issn":["1574-0137"]},"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","page":"57-68","language":[{"iso":"eng"}],"_id":"16447","user_id":"15415","doi":"10.1016/j.cosrev.2010.09.005"},{"year":"2011","title":"Energy-efficient strategies for building short chains of mobile robots locally","status":"public","author":[{"last_name":"Brandes","first_name":"Philipp","full_name":"Brandes, Philipp"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","page":"138-149","_id":"16451","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1016/j.tcs.2012.10.056","publication":"SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity","citation":{"mla":"Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” <i>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>, 2011, pp. 138–49, doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">10.1016/j.tcs.2012.10.056</a>.","bibtex":"@inproceedings{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, title={Energy-efficient strategies for building short chains of mobile robots locally}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">10.1016/j.tcs.2012.10.056</a>}, booktitle={SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={138–149} }","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>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>. ; 2011:138-149. doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">10.1016/j.tcs.2012.10.056</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>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>, 2011, pp. 138–149.","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>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i> (pp. 138–149). <a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">https://doi.org/10.1016/j.tcs.2012.10.056</a>","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>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>, 138–49, 2011. <a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">https://doi.org/10.1016/j.tcs.2012.10.056</a>.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–149."},"date_created":"2020-04-07T12:12:23Z","type":"conference","department":[{"_id":"63"}]},{"year":"2011","status":"public","title":"A tight runtime bound for synchronous gathering of autonomous robots with limited visibility","publication_identifier":{"isbn":["9781450307437"]},"author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Langner, Tobias","last_name":"Langner","first_name":"Tobias"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Pietrzyk","first_name":"Peter","full_name":"Pietrzyk, Peter"},{"first_name":"Roger","last_name":"Wattenhofer","full_name":"Wattenhofer, Roger"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","_id":"16453","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1145/1989493.1989515","publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","citation":{"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.","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>.","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>","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.","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>","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>."},"date_created":"2020-04-07T12:31:24Z","type":"conference","department":[{"_id":"63"}]},{"citation":{"short":"P. Kling, F. Meyer auf der Heide, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","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.","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} }","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>","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>."},"publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-07T12:33:00Z","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","publication_identifier":{"isbn":["9781450307437"]},"author":[{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Convergence of local communication chain strategies via linear transformations","status":"public","year":"2011","doi":"10.1145/1989493.1989517","user_id":"15415","language":[{"iso":"eng"}],"_id":"16454"},{"author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["1877-0509"]},"title":"Building Simple Formations in Large Societies of Tiny Mobile Robots","status":"public","year":"2011","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"_id":"16455","page":"153-155","user_id":"15415","doi":"10.1016/j.procs.2011.09.049","citation":{"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.","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>","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>.","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>"},"publication":"Procedia Computer Science","date_created":"2020-04-07T12:35:11Z","department":[{"_id":"63"}],"type":"journal_article"},{"doi":"10.1007/978-3-0348-0130-0_35","user_id":"15415","language":[{"iso":"eng"}],"_id":"16456","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","title":"Energy-Awareness in Self-organising Robotic Exploration Teams","status":"public","year":"2011","author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["9783034801294","9783034801300"]},"type":"book_chapter","department":[{"_id":"63"}],"place":"Basel","date_created":"2020-04-07T12:36:17Z","publication":"Organic Computing — A Paradigm Shift for Complex Systems","citation":{"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>.","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>","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>","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.","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.","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>."}},{"citation":{"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>","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} }","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>.","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>.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 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>","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."},"publication":"Structural Information and Communication Complexity","place":"Berlin, Heidelberg","date_created":"2020-04-08T06:52:53Z","department":[{"_id":"63"}],"type":"book_chapter","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642222115","9783642222122"]},"author":[{"full_name":"Brandes, Philipp","last_name":"Brandes","first_name":"Philipp"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"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"}],"title":"Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally","year":"2011","status":"public","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16459","doi":"10.1007/978-3-642-22212-2_13","user_id":"15415"},{"citation":{"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} }","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>","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.","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>.","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.","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>"},"publication":"Journal of Interconnection Networks","date_created":"2020-05-18T13:35:10Z","department":[{"_id":"63"}],"type":"journal_article","publication_identifier":{"issn":["0219-2659","1793-6713"]},"author":[{"full_name":"Hsu, D. Frank","first_name":"D. Frank","last_name":"Hsu"},{"first_name":"Bruce M.","last_name":"Magga","full_name":"Magga, Bruce M."},{"full_name":"Ho, Howard C. T.","first_name":"Howard C. T.","last_name":"Ho"},{"first_name":"Juraj","last_name":"Hromkovic","full_name":"Hromkovic, Juraj"},{"first_name":"Francis C. M.","last_name":"Lau","full_name":"Lau, Francis C. M."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"status":"public","title":"EDITORIAL","year":"2011","publication_status":"published","date_updated":"2022-01-06T06:53:01Z","language":[{"iso":"eng"}],"_id":"17009","page":"vii-viii","user_id":"15415","doi":"10.1142/s0219265911002885"},{"place":"Berlin, Heidelberg","date_created":"2020-04-06T07:47:55Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"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>.","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>","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>","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.","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>."},"publication":"Automata, Languages and Programming","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"}],"language":[{"iso":"eng"}],"_id":"16409","doi":"10.1007/978-3-642-22012-8_52","user_id":"15415","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"full_name":"Märtens, Marcus","last_name":"Märtens","first_name":"Marcus"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","last_name":"Swierkot","first_name":"Kamil"},{"full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","last_name":"Weddemann","first_name":"Christoph"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"status":"public","year":"2011","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","date_updated":"2022-01-06T06:52:50Z","publication_status":"published"},{"date_updated":"2022-01-06T06:54:09Z","intvolume":"      6534","status":"public","title":"The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers","year":"2010","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"full_name":"Röglin, Heiko","last_name":"Röglin","first_name":"Heiko"}],"user_id":"15415","doi":"10.1007/978-3-642-18318-8_5","volume":6534,"publisher":"Springer","_id":"19678","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","publication":"Workshop on Approximation and Online Algorithms (WAOA)","citation":{"ieee":"P. Briest and H. Röglin, “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers,” in <i>Workshop on Approximation and Online Algorithms (WAOA)</i>, 2010, vol. 6534.","apa":"Briest, P., &#38; Röglin, H. (2010). The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In <i>Workshop on Approximation and Online Algorithms (WAOA)</i> (Vol. 6534). Springer. <a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">https://doi.org/10.1007/978-3-642-18318-8_5</a>","chicago":"Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” In <i>Workshop on Approximation and Online Algorithms (WAOA)</i>, Vol. 6534. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">https://doi.org/10.1007/978-3-642-18318-8_5</a>.","short":"P. Briest, H. Röglin, in: Workshop on Approximation and Online Algorithms (WAOA), Springer, 2010.","mla":"Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” <i>Workshop on Approximation and Online Algorithms (WAOA)</i>, vol. 6534, Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">10.1007/978-3-642-18318-8_5</a>.","bibtex":"@inproceedings{Briest_Röglin_2010, series={Lecture Notes in Computer Science}, title={The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}, volume={6534}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">10.1007/978-3-642-18318-8_5</a>}, booktitle={Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Briest, Patrick and Röglin, Heiko}, year={2010}, collection={Lecture Notes in Computer Science} }","ama":"Briest P, Röglin H. The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In: <i>Workshop on Approximation and Online Algorithms (WAOA)</i>. Vol 6534. Lecture Notes in Computer Science. Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-18318-8_5\">10.1007/978-3-642-18318-8_5</a>"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-24T14:13:19Z"},{"publication":"International Parallel & Distributed Processing Symposium (IPDPS)","citation":{"short":"B. Degener, P. Pietrzyk, B. Kempkes, in: International Parallel &#38; Distributed Processing Symposium (IPDPS), 2010.","chicago":"Degener, Bastian, Peter Pietrzyk, and Barbara Kempkes. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” In <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, 2010. <a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">https://doi.org/10.1109/IPDPS.2010.5470349</a>.","ieee":"B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, 2010.","apa":"Degener, B., Pietrzyk, P., &#38; Kempkes, B. (2010). A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">https://doi.org/10.1109/IPDPS.2010.5470349</a>","bibtex":"@inproceedings{Degener_Pietrzyk_Kempkes_2010, title={A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">10.1109/IPDPS.2010.5470349</a>}, booktitle={International Parallel &#38; Distributed Processing Symposium (IPDPS)}, author={Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2010} }","ama":"Degener B, Pietrzyk P, Kempkes B. A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In: <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">10.1109/IPDPS.2010.5470349</a>","mla":"Degener, Bastian, et al. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” <i>International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, 2010, doi:<a href=\"https://doi.org/10.1109/IPDPS.2010.5470349\">10.1109/IPDPS.2010.5470349</a>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-28T08:25:37Z","date_updated":"2022-01-06T06:54:10Z","title":"A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ","status":"public","year":"2010","author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"}],"user_id":"15415","doi":"10.1109/IPDPS.2010.5470349","language":[{"iso":"eng"}],"_id":"19711"},{"status":"public","user_id":"15415","volume":5873,"page":"624--639","_id":"19796","citation":{"chicago":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 5873:624--639. Lecture Notes in Computer Science, 2010. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>.","short":"M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639.","apa":"Mense, M., &#38; Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i> (Vol. 5873, pp. 624--639). <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>","ieee":"M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2010, vol. 5873, pp. 624--639.","ama":"Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>","bibtex":"@inproceedings{Mense_Schindelhauer_2010, series={Lecture Notes in Computer Science}, title={Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}, volume={5873}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>}, booktitle={Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Mense, Mario and Schindelhauer, Christian}, year={2010}, pages={624--639}, collection={Lecture Notes in Computer Science} }","mla":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, vol. 5873, 2010, pp. 624--639, doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>."},"date_updated":"2022-01-06T06:54:12Z","publication_status":"published","intvolume":"      5873","title":"Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks","year":"2010","author":[{"last_name":"Mense","first_name":"Mario","full_name":"Mense, Mario"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642051173","9783642051180"]},"doi":"10.1007/978-3-642-05118-0_43","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We introduce the Read-Write-Coding-System (RWC) – a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \\leq r,w \\leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\\left(n,k,d\\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data."}],"publication":"Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems","type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-30T12:12:33Z"},{"date_created":"2020-10-01T09:39:13Z","department":[{"_id":"63"}],"type":"conference","citation":{"chicago":"Janson, Thomas, Peter Mahlmann, and Christian Schindelhauer. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.” In <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>, 2010. <a href=\"https://doi.org/10.1109/icpads.2010.42\">https://doi.org/10.1109/icpads.2010.42</a>.","short":"T. Janson, P. Mahlmann, C. Schindelhauer, in: Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010.","ieee":"T. Janson, P. Mahlmann, and C. Schindelhauer, “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs,” in <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>, 2010.","apa":"Janson, T., Mahlmann, P., &#38; Schindelhauer, C. (2010). A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>. <a href=\"https://doi.org/10.1109/icpads.2010.42\">https://doi.org/10.1109/icpads.2010.42</a>","bibtex":"@inproceedings{Janson_Mahlmann_Schindelhauer_2010, title={A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, DOI={<a href=\"https://doi.org/10.1109/icpads.2010.42\">10.1109/icpads.2010.42</a>}, booktitle={Proceedings of the 16th International Conference on Parallel and Distributed Systems}, author={Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian}, year={2010} }","ama":"Janson T, Mahlmann P, Schindelhauer C. A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In: <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/icpads.2010.42\">10.1109/icpads.2010.42</a>","mla":"Janson, Thomas, et al. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.” <i>Proceedings of the 16th International Conference on Parallel and Distributed Systems</i>, 2010, doi:<a href=\"https://doi.org/10.1109/icpads.2010.42\">10.1109/icpads.2010.42</a>."},"publication":"Proceedings of the 16th International Conference on Parallel and Distributed Systems","abstract":[{"lang":"eng","text":"We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis."}],"_id":"19824","language":[{"iso":"eng"}],"doi":"10.1109/icpads.2010.42","user_id":"15415","author":[{"full_name":"Janson, Thomas","first_name":"Thomas","last_name":"Janson"},{"full_name":"Mahlmann, Peter","last_name":"Mahlmann","first_name":"Peter"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"publication_identifier":{"isbn":["9781424497270"]},"title":"A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","status":"public","year":"2010","date_updated":"2022-01-06T06:54:13Z","publication_status":"published"}]