[{"title":"Smart Robot Teams Exploring Sparse Trees","doi":"10.1007/11821069_29","date_updated":"2022-01-06T06:52:50Z","author":[{"full_name":"Dynia, M.","last_name":"Dynia","first_name":"M."},{"first_name":"J.","full_name":"Kutyłowski, J.","last_name":"Kutyłowski"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"date_created":"2020-04-08T09:38:28Z","place":"Berlin, Heidelberg","year":"2006","citation":{"ieee":"M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2006.","chicago":"Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11821069_29\">https://doi.org/10.1007/11821069_29</a>.","ama":"Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>","apa":"Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., &#38; Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11821069_29\">https://doi.org/10.1007/11821069_29</a>","short":"M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.","bibtex":"@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin, Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>}, booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }","mla":"Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” <i>Lecture Notes in Computer Science</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>."},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540377917","9783540377931"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16473","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter"},{"status":"public","type":"book_chapter","publication":"IFIP International Federation for Information Processing","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16476","citation":{"apa":"Dynia, M., Kutyłowski, J., Lorek, P., &#38; Meyer auf der Heide, F. (2006). Maintaining Communication Between an Explorer and a Base Station. In <i>IFIP International Federation for Information Processing</i>. Boston, MA. <a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">https://doi.org/10.1007/978-0-387-34733-2_14</a>","mla":"Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and a Base Station.” <i>IFIP International Federation for Information Processing</i>, 2006, doi:<a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">10.1007/978-0-387-34733-2_14</a>.","short":"M. Dynia, J. Kutyłowski, P. Lorek, F. Meyer auf der Heide, in: IFIP International Federation for Information Processing, Boston, MA, 2006.","bibtex":"@inbook{Dynia_Kutyłowski_Lorek_Meyer auf der Heide_2006, place={Boston, MA}, title={Maintaining Communication Between an Explorer and a Base Station}, DOI={<a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">10.1007/978-0-387-34733-2_14</a>}, booktitle={IFIP International Federation for Information Processing}, author={Dynia, Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm}, year={2006} }","ama":"Dynia M, Kutyłowski J, Lorek P, Meyer auf der Heide F. Maintaining Communication Between an Explorer and a Base Station. In: <i>IFIP International Federation for Information Processing</i>. Boston, MA; 2006. doi:<a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">10.1007/978-0-387-34733-2_14</a>","ieee":"M. Dynia, J. Kutyłowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining Communication Between an Explorer and a Base Station,” in <i>IFIP International Federation for Information Processing</i>, Boston, MA, 2006.","chicago":"Dynia, Miroslaw, Jarosław Kutyłowski, Paweł Lorek, and Friedhelm Meyer auf der Heide. “Maintaining Communication Between an Explorer and a Base Station.” In <i>IFIP International Federation for Information Processing</i>. Boston, MA, 2006. <a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">https://doi.org/10.1007/978-0-387-34733-2_14</a>."},"place":"Boston, MA","year":"2006","publication_status":"published","publication_identifier":{"isbn":["9780387346328","9780387347332"],"issn":["1571-5736"]},"doi":"10.1007/978-0-387-34733-2_14","title":"Maintaining Communication Between an Explorer and a Base Station","author":[{"first_name":"Miroslaw","last_name":"Dynia","full_name":"Dynia, Miroslaw"},{"full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski","first_name":"Jarosław"},{"first_name":"Paweł","last_name":"Lorek","full_name":"Lorek, Paweł"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-08T11:13:52Z","date_updated":"2022-01-06T06:52:50Z"},{"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-08-05T10:06:52Z","_id":"17011","user_id":"15415","department":[{"_id":"63"}],"file":[{"file_size":147312,"file_name":"smarts-design.pdf","access_level":"closed","file_id":"17620","date_updated":"2020-08-05T10:06:52Z","date_created":"2020-08-05T10:06:52Z","creator":"koala","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"report","title":"SmartS Simulator Design","date_updated":"2022-01-06T06:53:02Z","author":[{"last_name":"Dynia","full_name":"Dynia, Miroslaw","first_name":"Miroslaw"},{"last_name":"Kuhmlehn","full_name":"Kuhmlehn, Andreas","first_name":"Andreas"},{"full_name":"Kutylowski, Jaroslaw","last_name":"Kutylowski","first_name":"Jaroslaw"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"date_created":"2020-05-18T13:52:43Z","year":"2006","citation":{"short":"M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, C. Schindelhauer, SmartS Simulator Design, 2006.","mla":"Dynia, Miroslaw, et al. <i>SmartS Simulator Design</i>. 2006.","bibtex":"@book{Dynia_Kuhmlehn_Kutylowski_Meyer auf der Heide_Schindelhauer_2006, title={SmartS Simulator Design}, author={Dynia, Miroslaw and Kuhmlehn, Andreas and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }","apa":"Dynia, M., Kuhmlehn, A., Kutylowski, J., Meyer auf der Heide, F., &#38; Schindelhauer, C. (2006). <i>SmartS Simulator Design</i>.","chicago":"Dynia, Miroslaw, Andreas Kuhmlehn, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. <i>SmartS Simulator Design</i>, 2006.","ieee":"M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer, <i>SmartS Simulator Design</i>. 2006.","ama":"Dynia M, Kuhmlehn A, Kutylowski J, Meyer auf der Heide F, Schindelhauer C. <i>SmartS Simulator Design</i>.; 2006."},"publication_status":"published","has_accepted_license":"1"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16468","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Peer-to-Peer Systems IV","status":"public","date_created":"2020-04-08T09:18:56Z","author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/11558989_20","title":"Dynamic Load Balancing in Distributed Hash Tables","publication_status":"published","publication_identifier":{"isbn":["9783540290681","9783540319061"],"issn":["0302-9743","1611-3349"]},"citation":{"apa":"Bienkowski, M., Korzeniowski, M., &#38; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>","short":"M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.","mla":"Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” <i>Peer-to-Peer Systems IV</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>.","bibtex":"@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>}, booktitle={Peer-to-Peer Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2005} }","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>.","ieee":"M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in <i>Peer-to-Peer Systems IV</i>, Berlin, Heidelberg, 2005.","ama":"Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>"},"place":"Berlin, Heidelberg","year":"2005"},{"doi":"10.1007/11549345_1","title":"Page Migration in Dynamic Networks","author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-08T09:23:36Z","date_updated":"2022-01-06T06:52:50Z","citation":{"bibtex":"@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Page Migration in Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>}, booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }","short":"M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.","mla":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” <i>Mathematical Foundations of Computer Science 2005</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>.","apa":"Bienkowski, M., &#38; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>","chicago":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>.","ieee":"M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in <i>Mathematical Foundations of Computer Science 2005</i>, Berlin, Heidelberg, 2005.","ama":"Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>"},"year":"2005","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540287025","9783540318675"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16469","status":"public","publication":"Mathematical Foundations of Computer Science 2005","type":"book_chapter"},{"_id":"16470","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","type":"conference","abstract":[{"lang":"eng","text":"We present a web computing library (PUBWCL) in Java that allows to execute strongly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power.\r\nPUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it.\r\nThe use of Java guarantees a high level of security and makes PUBWCL platform independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.\r\n"}],"status":"public","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-08T09:25:44Z","title":"A Web Computing Environment for Parallel Algorithms in Java","doi":"10.1007/11752578_96","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540341413","9783540341420"]},"publication_status":"published","year":"2005","page":"801-808","citation":{"apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 801–808). <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>","short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.","mla":"Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–08, doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>.","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web Computing Environment for Parallel Algorithms in Java}, DOI={<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={801–808} }","ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:801-808. doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>","chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 801–8, 2005. <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>.","ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–808."}},{"_id":"16471","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","type":"conference","abstract":[{"text":"We compare different load balancing strategies for Bulk-Synchronous Parallel (BSP) programs in a web computing environment. In order to handle the influence of the fluctuating available computation power, we classify the external work load.\r\n\r\nWe evaluate the load balancing algorithms using our web computing library for BSP programs in Java (PUBWCL). Thereby we simulated the external work load in order to have repeatable testing conditions.\r\n\r\nWith the best performing load balancing strategy we could save 39% of the execution time averaged and even up to 50% in particular cases.","lang":"eng"}],"status":"public","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-08T09:30:12Z","author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"Load Balancing Strategies in a Web Computing Environment","doi":"10.1007/11752578_101","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540341413","9783540341420"]},"publication_status":"published","year":"2005","page":"839-846","citation":{"short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.","mla":"Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–46, doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>.","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load Balancing Strategies in a Web Computing Environment}, DOI={<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={839–846} }","apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 839–846). <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>","chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 839–46, 2005. <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>.","ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–846.","ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:839-846. doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>"}},{"type":"conference","publication":"Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"17112","language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"confirmation","url":"http://www.win.tue.nl/EWCG2005/Proceedings/43.pdf"}]},"citation":{"apa":"Bienkowski, M., Damerow, V., Meyer auf der Heide, F., &#38; Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven.","bibtex":"@inproceedings{Bienkowski_Damerow_Meyer auf der Heide_Sohler_2005, title={Average case complexity of Voronoi diagrams of n sites from the unit cube}, booktitle={Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005}, publisher={Technische Universiteit Eindhoven}, author={Bienkowski, Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2005} }","short":"M. Bienkowski, V. Damerow, F. Meyer auf der Heide, C. Sohler, in: Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.","mla":"Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>, Technische Universiteit Eindhoven, 2005.","ama":"Bienkowski M, Damerow V, Meyer auf der Heide F, Sohler C. Average case complexity of Voronoi diagrams of n sites from the unit cube. In: <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven; 2005.","chicago":"Bienkowski, Marcin, Valentina Damerow, Friedhelm Meyer auf der Heide, and Christian Sohler. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” In <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven, 2005.","ieee":"M. Bienkowski, V. Damerow, F. Meyer auf der Heide, and C. Sohler, “Average case complexity of Voronoi diagrams of n sites from the unit cube,” in <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>, 2005."},"year":"2005","date_created":"2020-06-22T13:22:22Z","author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"last_name":"Damerow","full_name":"Damerow, Valentina","first_name":"Valentina"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"date_updated":"2022-01-06T06:53:05Z","publisher":"Technische Universiteit Eindhoven","title":"Average case complexity of Voronoi diagrams of n sites from the unit cube"},{"editor":[{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Dorothea","full_name":"Wagner, Dorothea","last_name":"Wagner"}],"status":"public","type":"conference_editor","language":[{"iso":"eng"}],"_id":"17113","department":[{"_id":"63"}],"series_title":"Dagstuhl Seminar Proceedings","user_id":"15415","year":"2005","intvolume":"      5361","citation":{"apa":"Leonardi, S., Meyer auf der Heide, F., &#38; Wagner, D. (Eds.). (2005). <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i> (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.","mla":"Leonardi, Stefano, et al., editors. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol. 05361, 2005.","short":"S. Leonardi, F. Meyer auf der Heide, D. Wagner, eds., Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks, 2005.","bibtex":"@book{Leonardi_Meyer auf der Heide_Wagner_2005, series={Dagstuhl Seminar Proceedings}, title={Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks}, volume={05361}, year={2005}, collection={Dagstuhl Seminar Proceedings} }","chicago":"Leonardi, Stefano, Friedhelm Meyer auf der Heide, and Dorothea Wagner, eds. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol. 05361. Dagstuhl Seminar Proceedings, 2005.","ieee":"S. Leonardi, F. Meyer auf der Heide, and D. Wagner, Eds., <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>, vol. 05361. 2005.","ama":"Leonardi S, Meyer auf der Heide F, Wagner D, eds. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol 05361.; 2005."},"related_material":{"link":[{"relation":"confirmation","url":"https://drops.dagstuhl.de/opus/volltexte/2006/570/"}]},"title":"Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks","conference":{"end_date":"2005-09-09","location":"Schloss Dagstuhl, Germany","name":"Dagstuhl Seminar Proceedings","start_date":"2005-09-04"},"date_updated":"2022-01-06T06:53:05Z","volume":"05361","date_created":"2020-06-22T13:52:52Z"},{"date_created":"2020-06-26T13:30:51Z","author":[{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"last_name":"Heidebuer","full_name":"Heidebuer, Michael","first_name":"Michael"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Rückert, Ulrich ","last_name":"Rückert","first_name":"Ulrich "},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"last_name":"Vodisek","full_name":"Vodisek, Mario","first_name":"Mario"}],"date_updated":"2022-01-06T06:53:08Z","publisher":"IEEE","title":"V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System","citation":{"apa":"Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., &#38; Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler &#38; P. C. Hariharan (Eds.), <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i> (pp. 153--157). IEEE.","short":"A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel, M. Vodisek, in: B. Kobler, P.C. Hariharan (Eds.), 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, IEEE, 2004, pp. 153--157.","mla":"Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>, edited by Ben Kobler and P. C. Hariharan, IEEE, 2004, pp. 153--157.","bibtex":"@inproceedings{Brinkmann_Heidebuer_Meyer auf der Heide_Rückert_Salzwedel_Vodisek_2004, title={V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System}, booktitle={21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA}, publisher={IEEE}, author={Brinkmann, André and Heidebuer, Michael and Meyer auf der Heide, Friedhelm and Rückert, Ulrich  and Salzwedel, Kay and Vodisek, Mario}, editor={Kobler, Ben and Hariharan, P. C.Editors}, year={2004}, pages={153--157} }","ama":"Brinkmann A, Heidebuer M, Meyer auf der Heide F, Rückert U, Salzwedel K, Vodisek M. V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In: Kobler B, Hariharan PC, eds. <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>. IEEE; 2004:153--157.","ieee":"A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel, and M. Vodisek, “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System,” in <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>, 2004, pp. 153--157.","chicago":"Brinkmann, André, Michael Heidebuer, Friedhelm Meyer auf der Heide, Ulrich  Rückert, Kay Salzwedel, and Mario Vodisek. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” In <i>21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i>, edited by Ben Kobler and P. C. Hariharan, 153--157. IEEE, 2004."},"page":"153--157","year":"2004","user_id":"15415","department":[{"_id":"63"}],"_id":"17346","language":[{"iso":"eng"}],"type":"conference","publication":"21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA","status":"public","editor":[{"first_name":"Ben","last_name":"Kobler","full_name":"Kobler, Ben"},{"first_name":"P. C.","full_name":"Hariharan, P. C.","last_name":"Hariharan"}]},{"abstract":[{"lang":"eng","text":"Given n distinct points p1, p2, ... , pn in the plane, the map labeling\r\nproblem with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn\r\nof maximum possible size such that pi is a corner of Qi and no two squares overlap.\r\nThis problem is NP-hard and no algorithm with approximation ratio better\r\nthan 1/2 exists unless P = NP [10].\r\nIn this paper, we consider a scenario where we want to visualize the information\r\ngathered by smart dust, i.e. by a large set of simple devices, each consisting of\r\na sensor and a sender that can gather sensor data and send it to a central station.\r\nOur task is to label (the positions of) these sensors in a way described by the\r\nlabeling problem above. Since these devices are not positioned accurately (for\r\nexample, they might be dropped from an airplane), this gives rise to consider the\r\nmap labeling problem under the assumption, that the positions of the points are\r\nnot fixed precisely, but perturbed by random noise. In other words, we consider\r\nthe smoothed complexity of the map labeling problem. We present an algorithm\r\nthat, under such an assumption and Gaussian random noise with sufficiently large\r\nvariance, has linear smoothed complexity."}],"status":"public","publication":"12th Annual European Symposium on Algorithms (ESA 2004)","type":"conference","language":[{"iso":"eng"}],"_id":"16474","department":[{"_id":"63"}],"user_id":"15415","series_title":"Lecture Notes in Computer Science","year":"2004","place":"Berlin, Heidelberg","intvolume":"      3221","citation":{"ama":"Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>. Vol 3221. Lecture Notes in Computer Science. Berlin, Heidelberg; 2004. doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>","ieee":"V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, 2004, vol. 3221.","chicago":"Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling Smart Dust.” In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">https://doi.org/10.1007/978-3-540-30140-0_9</a>.","apa":"Bansal, V., Meyer auf der Heide, F., &#38; Sohler, C. (2004). Labeling Smart Dust. In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i> (Vol. 3221). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">https://doi.org/10.1007/978-3-540-30140-0_9</a>","bibtex":"@inproceedings{Bansal_Meyer auf der Heide_Sohler_2004, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Labeling Smart Dust}, volume={3221}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>}, booktitle={12th Annual European Symposium on Algorithms (ESA 2004)}, author={Bansal, Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2004}, collection={Lecture Notes in Computer Science} }","mla":"Bansal, Vikas, et al. “Labeling Smart Dust.” <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, vol. 3221, 2004, doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>.","short":"V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium on Algorithms (ESA 2004), Berlin, Heidelberg, 2004."},"publication_identifier":{"isbn":["9783540230250","9783540301400"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"Labeling Smart Dust","doi":"10.1007/978-3-540-30140-0_9","date_updated":"2022-01-06T06:52:50Z","volume":3221,"author":[{"first_name":"Vikas","full_name":"Bansal, Vikas","last_name":"Bansal"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"date_created":"2020-04-08T11:07:57Z"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16475","status":"public","type":"conference","publication":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA '04","doi":"10.1145/1007912.1007923","title":"Fighting against two adversaries","author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-08T11:10:54Z","date_updated":"2022-01-06T06:52:50Z","citation":{"ama":"Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Fighting against two adversaries. In: <i>Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04</i>. ; 2004. doi:<a href=\"https://doi.org/10.1145/1007912.1007923\">10.1145/1007912.1007923</a>","ieee":"M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Fighting against two adversaries,” in <i>Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04</i>, 2004.","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Fighting against Two Adversaries.” In <i>Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04</i>, 2004. <a href=\"https://doi.org/10.1145/1007912.1007923\">https://doi.org/10.1145/1007912.1007923</a>.","bibtex":"@inproceedings{Bienkowski_Korzeniowski_Meyer auf der Heide_2004, title={Fighting against two adversaries}, DOI={<a href=\"https://doi.org/10.1145/1007912.1007923\">10.1145/1007912.1007923</a>}, booktitle={Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2004} }","short":"M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04, 2004.","mla":"Bienkowski, Marcin, et al. “Fighting against Two Adversaries.” <i>Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04</i>, 2004, doi:<a href=\"https://doi.org/10.1145/1007912.1007923\">10.1145/1007912.1007923</a>.","apa":"Bienkowski, M., Korzeniowski, M., &#38; Meyer auf der Heide, F. (2004). Fighting against two adversaries. In <i>Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04</i>. <a href=\"https://doi.org/10.1145/1007912.1007923\">https://doi.org/10.1145/1007912.1007923</a>"},"year":"2004","publication_status":"published","publication_identifier":{"isbn":["1581138407"]}},{"status":"public","publication":"Theory of Computing Systems","type":"journal_article","language":[{"iso":"eng"}],"_id":"16477","department":[{"_id":"63"}],"user_id":"15415","year":"2004","page":"343-370","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert, and Matthias Grünewald. “Congestion, Dilation, and Energy in Radio Networks.” <i>Theory of Computing Systems</i>, 2004, 343–70. <a href=\"https://doi.org/10.1007/s00224-004-1124-z\">https://doi.org/10.1007/s00224-004-1124-z</a>.","ieee":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Congestion, Dilation, and Energy in Radio Networks,” <i>Theory of Computing Systems</i>, pp. 343–370, 2004.","ama":"Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Congestion, Dilation, and Energy in Radio Networks. <i>Theory of Computing Systems</i>. 2004:343-370. doi:<a href=\"https://doi.org/10.1007/s00224-004-1124-z\">10.1007/s00224-004-1124-z</a>","apa":"Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., &#38; Grünewald, M. (2004). Congestion, Dilation, and Energy in Radio Networks. <i>Theory of Computing Systems</i>, 343–370. <a href=\"https://doi.org/10.1007/s00224-004-1124-z\">https://doi.org/10.1007/s00224-004-1124-z</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in Radio Networks.” <i>Theory of Computing Systems</i>, 2004, pp. 343–70, doi:<a href=\"https://doi.org/10.1007/s00224-004-1124-z\">10.1007/s00224-004-1124-z</a>.","bibtex":"@article{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2004, title={Congestion, Dilation, and Energy in Radio Networks}, DOI={<a href=\"https://doi.org/10.1007/s00224-004-1124-z\">10.1007/s00224-004-1124-z</a>}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}, year={2004}, pages={343–370} }","short":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, Theory of Computing Systems (2004) 343–370."},"publication_identifier":{"issn":["1432-4350","1433-0490"]},"publication_status":"published","title":"Congestion, Dilation, and Energy in Radio Networks","doi":"10.1007/s00224-004-1124-z","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"last_name":"Volbert","full_name":"Volbert, Klaus","first_name":"Klaus"},{"last_name":"Grünewald","full_name":"Grünewald, Matthias","first_name":"Matthias"}],"date_created":"2020-04-08T11:17:35Z"},{"status":"public","type":"conference","publication":"SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","language":[{"iso":"eng"}],"_id":"16480","user_id":"15415","department":[{"_id":"63"}],"year":"2004","citation":{"apa":"Leonardi, S., Marchetti-Spaccamela, A., &#38; Meyer auf der Heide, F. (2004). Scheduling against an adversarial network. In <i>SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures</i>. <a href=\"https://doi.org/10.1145/1007912.1007936\">https://doi.org/10.1145/1007912.1007936</a>","mla":"Leonardi, S., et al. “Scheduling against an Adversarial Network.” <i>SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2004, doi:<a href=\"https://doi.org/10.1145/1007912.1007936\">10.1145/1007912.1007936</a>.","short":"S. Leonardi, A. Marchetti-Spaccamela, F. Meyer auf der Heide, in: SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004.","bibtex":"@inproceedings{Leonardi_Marchetti-Spaccamela_Meyer auf der Heide_2004, title={Scheduling against an adversarial network}, DOI={<a href=\"https://doi.org/10.1145/1007912.1007936\">10.1145/1007912.1007936</a>}, booktitle={SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures}, author={Leonardi, S. and Marchetti-Spaccamela, A. and Meyer auf der Heide, Friedhelm}, year={2004} }","ama":"Leonardi S, Marchetti-Spaccamela A, Meyer auf der Heide F. Scheduling against an adversarial network. In: <i>SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2004. doi:<a href=\"https://doi.org/10.1145/1007912.1007936\">10.1145/1007912.1007936</a>","chicago":"Leonardi, S., A. Marchetti-Spaccamela, and Friedhelm Meyer auf der Heide. “Scheduling against an Adversarial Network.” In <i>SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2004. <a href=\"https://doi.org/10.1145/1007912.1007936\">https://doi.org/10.1145/1007912.1007936</a>.","ieee":"S. Leonardi, A. Marchetti-Spaccamela, and F. Meyer auf der Heide, “Scheduling against an adversarial network,” in <i>SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures</i>, 2004."},"publication_status":"published","publication_identifier":{"isbn":["1581138407"]},"title":"Scheduling against an adversarial network","doi":"10.1145/1007912.1007936","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-09T06:51:22Z","author":[{"first_name":"S.","last_name":"Leonardi","full_name":"Leonardi, S."},{"last_name":"Marchetti-Spaccamela","full_name":"Marchetti-Spaccamela, A.","first_name":"A."},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}]},{"language":[{"iso":"eng"}],"_id":"16399","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"lang":"eng","text":"We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects.\r\n\r\nThe sampling process is done in the preprocessing. There, the polygons are randomly distributed in our hierarchical data structure, the randomized sample tree. This tree only uses space that is linear in the number of polygons. In order to produce an approximate image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk.\r\n\r\nWe implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology."}],"status":"public","publication":"Presence: Teleoperators and Virtual Environments","type":"journal_article","title":"The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments","doi":"10.1162/1054746043280619","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-03T11:42:11Z","author":[{"last_name":"Klein","full_name":"Klein, Jan","first_name":"Jan"},{"first_name":"Jens","last_name":"Krokowski","full_name":"Krokowski, Jens"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"first_name":"Michael","last_name":"Wand","full_name":"Wand, Michael"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"year":"2004","page":"617-637","citation":{"chicago":"Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” <i>Presence: Teleoperators and Virtual Environments</i>, 2004, 617–37. <a href=\"https://doi.org/10.1162/1054746043280619\">https://doi.org/10.1162/1054746043280619</a>.","ieee":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments,” <i>Presence: Teleoperators and Virtual Environments</i>, pp. 617–637, 2004.","ama":"Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. <i>Presence: Teleoperators and Virtual Environments</i>. 2004:617-637. doi:<a href=\"https://doi.org/10.1162/1054746043280619\">10.1162/1054746043280619</a>","apa":"Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &#38; Meyer auf der Heide, F. (2004). The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. <i>Presence: Teleoperators and Virtual Environments</i>, 617–637. <a href=\"https://doi.org/10.1162/1054746043280619\">https://doi.org/10.1162/1054746043280619</a>","short":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, Presence: Teleoperators and Virtual Environments (2004) 617–637.","mla":"Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” <i>Presence: Teleoperators and Virtual Environments</i>, 2004, pp. 617–37, doi:<a href=\"https://doi.org/10.1162/1054746043280619\">10.1162/1054746043280619</a>.","bibtex":"@article{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2004, title={The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments}, DOI={<a href=\"https://doi.org/10.1162/1054746043280619\">10.1162/1054746043280619</a>}, journal={Presence: Teleoperators and Virtual Environments}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2004}, pages={617–637} }"},"publication_identifier":{"issn":["1054-7460","1531-3263"]},"publication_status":"published"},{"has_accepted_license":"1","year":"2003","citation":{"ama":"Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: <i>Proceedings of SSGRR 2003</i>. ; 2003.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in <i>Proceedings of SSGRR 2003</i>, 2003.","chicago":"Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In <i>Proceedings of SSGRR 2003</i>, 2003.","short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }","mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” <i>Proceedings of SSGRR 2003</i>, 2003.","apa":"Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., &#38; Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In <i>Proceedings of SSGRR 2003</i>."},"date_updated":"2022-01-06T06:54:12Z","date_created":"2020-09-30T12:04:14Z","author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Kay","last_name":"Salzwedel","full_name":"Salzwedel, Kay"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"full_name":"Vodisek, Mario","last_name":"Vodisek","first_name":"Mario"},{"first_name":"Ulrich","last_name":"Rückert","full_name":"Rückert, Ulrich"}],"title":"Storage Management as Means to cope with Exponential Information Growth","publication":"Proceedings of SSGRR 2003","type":"conference","abstract":[{"lang":"eng","text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"pub-hni-908.pdf","file_id":"19793","file_size":499057,"date_created":"2020-09-30T12:03:57Z","creator":"koala","date_updated":"2020-09-30T12:03:57Z"}],"_id":"19790","department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"user_id":"15415","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-09-30T12:03:57Z"},{"status":"public","type":"conference","publication":"ESA","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"_id":"2128","citation":{"ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in <i>ESA</i>, 2003, vol. 2832, pp. 161--171.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In <i>ESA</i>, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>.","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: <i>ESA</i>. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &#38; Sohler, C. (2003). Smoothed Motion Complexity. In <i>ESA</i> (Vol. 2832, pp. 161--171). Springer. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }","mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” <i>ESA</i>, vol. 2832, Springer, 2003, pp. 161--171, doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>.","short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171."},"page":"161--171","intvolume":"      2832","year":"2003","doi":"10.1007/978-3-540-39658-1_17","title":"Smoothed Motion Complexity","author":[{"first_name":"Valentina","last_name":"Damerow","full_name":"Damerow, Valentina"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:37:10Z","volume":2832,"publisher":"Springer","date_updated":"2022-01-06T06:54:52Z"},{"status":"public","abstract":[{"lang":"eng","text":"<jats:title>Zusammenfassung</jats:title><jats:p>Vernetzte Systeme sind zu unverzichtbaren Bestandteilen unseres Umfelds geworden, zum Beispiel als Höchstleistungsrechner, als Kommunikations- und Informationssysteme oder als Planungs- und Steuerungskomponenten von Transport- und Produktionssystemen. Die ständig wachsende Komplexität solcher Systeme stellt Informatiker und Ingenieure vor immer neue Herausforderungen. In diesem Beitrag beschreibe ich die Zielsetzungen und die Struktur des SFB 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen. Als Beispiel für unsere Arbeiten beschreibe ich einen algorithmisch orientierten Forschungszweig, in dem wir, ausgehend von theoretischen Problemen über effiziente Simulationen zwischen parallelen Rechenmodellen, Methoden, Techniken und Implementierungen entwickelt haben, die zu produktnahen Prototypen für die Speichervirtualisierung in verteilten Datenservern führen.</jats:p>"}],"type":"journal_article","publication":"it - Information Technology","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16481","citation":{"short":"F. Meyer auf der Heide, It - Information Technology (2003).","mla":"Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” <i>It - Information Technology</i>, 2003, doi:<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>.","bibtex":"@article{Meyer auf der Heide_2003, title={Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)}, DOI={<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>}, journal={it - Information Technology}, author={Meyer auf der Heide, Friedhelm}, year={2003} }","apa":"Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). <i>It - Information Technology</i>. <a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">https://doi.org/10.1524/itit.45.2.108.19606</a>","ieee":"F. Meyer auf der Heide, “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications),” <i>it - Information Technology</i>, 2003.","chicago":"Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” <i>It - Information Technology</i>, 2003. <a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">https://doi.org/10.1524/itit.45.2.108.19606</a>.","ama":"Meyer auf der Heide F. Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). <i>it - Information Technology</i>. 2003. doi:<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>"},"year":"2003","publication_status":"published","publication_identifier":{"issn":["2196-7032","1611-2776"]},"doi":"10.1524/itit.45.2.108.19606","title":"Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-09T07:27:56Z","date_updated":"2022-01-06T06:52:50Z"},{"publication_status":"published","publication_identifier":{"issn":["1570-8667"]},"citation":{"bibtex":"@article{Juurlink_Kolman_Meyer auf der Heide_Rieping_2003, title={Optimal broadcast on parallel locality models}, DOI={<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>}, journal={Journal of Discrete Algorithms}, author={Juurlink, Bernhardus and Kolman, Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={2003}, pages={151–166} }","mla":"Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.” <i>Journal of Discrete Algorithms</i>, 2003, pp. 151–66, doi:<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>.","short":"B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete Algorithms (2003) 151–166.","apa":"Juurlink, B., Kolman, P., Meyer auf der Heide, F., &#38; Rieping, I. (2003). Optimal broadcast on parallel locality models. <i>Journal of Discrete Algorithms</i>, 151–166. <a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">https://doi.org/10.1016/s1570-8667(03)00023-6</a>","chicago":"Juurlink, Bernhardus, Petr Kolman, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Optimal Broadcast on Parallel Locality Models.” <i>Journal of Discrete Algorithms</i>, 2003, 151–66. <a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">https://doi.org/10.1016/s1570-8667(03)00023-6</a>.","ieee":"B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast on parallel locality models,” <i>Journal of Discrete Algorithms</i>, pp. 151–166, 2003.","ama":"Juurlink B, Kolman P, Meyer auf der Heide F, Rieping I. Optimal broadcast on parallel locality models. <i>Journal of Discrete Algorithms</i>. 2003:151-166. doi:<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>"},"page":"151-166","year":"2003","date_created":"2020-04-09T07:33:09Z","author":[{"first_name":"Bernhardus","last_name":"Juurlink","full_name":"Juurlink, Bernhardus"},{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"}],"date_updated":"2022-01-06T06:52:50Z","doi":"10.1016/s1570-8667(03)00023-6","title":"Optimal broadcast on parallel locality models","type":"journal_article","publication":"Journal of Discrete Algorithms","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16482","language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"user_id":"15415","_id":"16484","language":[{"iso":"eng"}],"type":"conference_editor","status":"public","editor":[{"first_name":"Arnold L.","full_name":"Rosenberg, Arnold L.","last_name":"Rosenberg"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-09T07:41:53Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1145/777412","title":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '03","publication_identifier":{"isbn":["1581136617"]},"publication_status":"published","citation":{"ieee":"A. L. Rosenberg and F. Meyer auf der Heide, Eds., <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>. 2003.","chicago":"Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, eds. <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003. <a href=\"https://doi.org/10.1145/777412\">https://doi.org/10.1145/777412</a>.","ama":"Rosenberg AL, Meyer auf der Heide F, eds. <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>.; 2003. doi:<a href=\"https://doi.org/10.1145/777412\">10.1145/777412</a>","bibtex":"@book{Rosenberg_Meyer auf der Heide_2003, title={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03}, DOI={<a href=\"https://doi.org/10.1145/777412\">10.1145/777412</a>}, year={2003} }","mla":"Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>. 2003, doi:<a href=\"https://doi.org/10.1145/777412\">10.1145/777412</a>.","short":"A.L. Rosenberg, F. Meyer auf der Heide, eds., Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.","apa":"Rosenberg, A. L., &#38; Meyer auf der Heide, F. (Eds.). (2003). <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>. <a href=\"https://doi.org/10.1145/777412\">https://doi.org/10.1145/777412</a>"},"year":"2003"}]