[{"user_id":"15415","page":"39-52","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18290","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:28Z","title":"Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems","status":"public","year":"2010","author":[{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"},{"last_name":"Wiesemann","first_name":"Timo","full_name":"Wiesemann, Timo"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"}],"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-08-25T14:14:36Z","abstract":[{"text":"Typischerweise sind die Knoten eines PC-Clusters nicht mit leistungsfähigen Grafikkarten ausgestattet. Dennoch bieten Cluster-Betreiber einige wenige Rechenknoten an, die mit Highend-Grafikkarten ausgestattet sind, um beispielsweise eine PowerWall zu betreiben. Wenn zwischen diesen unterschiedlichen Knotentypen ein schnelles Netzwerk existiert, kann die Bilderzeugung durch die Knoten mit schwacher Grafikkarte beschleunigt werden. Dabei können die unterschiedlichen Knotentypen unterschiedliche Aufgabe bearbeiten. In einem solchen heterogenen System, müssen die unterschiedlichen entstehenden Lasten auf andere Weise verteilt werden, als in einem System, bei dem alle Knoten gleich ausgestattet sind. Wir präsentieren in dieser Arbeit Lastbalancierungsmechanismen, die in einem parallelen Out-of-Core-Renderingsystem für heterogene PC-Cluster eingesetzt werden.\r\n","lang":"ger"}],"publication":"Augmented & Virtual Reality in der Produktentstehung","citation":{"short":"T. Suess, T. Wiesemann, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, 2010, pp. 39–52.","chicago":"Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 39–52. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2010, pp. 39–52.","apa":"Suess, T., Wiesemann, T., &#38; Fischer, M. (2010). Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In <i>Augmented &#38; Virtual Reality in der Produktentstehung</i> (pp. 39–52).","bibtex":"@inbook{Suess_Wiesemann_Fischer_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010}, pages={39–52}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Suess T, Wiesemann T, Fischer M. Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2010:39-52.","mla":"Suess, Tim, et al. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 2010, pp. 39–52."}},{"citation":{"mla":"Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>. 2010, doi:<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>.","apa":"Meyer auf der Heide, F., &#38; Phillips, C. A. (2010). Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. <a href=\"https://doi.org/10.1145/1810479\">https://doi.org/10.1145/1810479</a>","ieee":"F. Meyer auf der Heide and C. A. Phillips, “Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10,” 2010.","chicago":"Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. “Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10,” 2010. <a href=\"https://doi.org/10.1145/1810479\">https://doi.org/10.1145/1810479</a>.","short":"F. Meyer auf der Heide, C.A. Phillips, in: 2010.","ama":"Meyer auf der Heide F, Phillips CA. Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. In: ; 2010. doi:<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>","bibtex":"@inproceedings{Meyer auf der Heide_Phillips_2010, title={Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10}, DOI={<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>}, author={Meyer auf der Heide, Friedhelm and Phillips, Cynthia A.}, year={2010} }"},"date_created":"2020-04-06T10:42:26Z","type":"conference","department":[{"_id":"63"}],"title":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","year":"2010","status":"public","publication_identifier":{"isbn":["9781450300797"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Phillips, Cynthia A.","first_name":"Cynthia A.","last_name":"Phillips"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","_id":"16414","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1145/1810479"},{"language":[{"iso":"eng"}],"_id":"16505","doi":"10.1007/978-3-642-17289-2_60","user_id":"15415","publication_identifier":{"isbn":["9783642172885","9783642172892"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Benjamin","last_name":"Eikel","full_name":"Eikel, Benjamin"},{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"}],"title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","status":"public","year":"2010","date_updated":"2022-01-06T06:52:52Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-14T13:06:51Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"ieee":"B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2010.","mla":"Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” <i>Advances in Visual Computing</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>.","apa":"Eikel, B., Jähn, C., &#38; Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>","bibtex":"@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>}, booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}, year={2010} }","chicago":"Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>.","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","ama":"Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>"},"publication":"Advances in Visual Computing","abstract":[{"text":"We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset.","lang":"eng"}]},{"citation":{"bibtex":"@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin, Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>}, booktitle={Structural Information and Communication Complexity}, author={Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2010}, pages={168–182}, collection={SIROCCO 2010} }","ama":"Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: <i>Structural Information and Communication Complexity</i>. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>","mla":"Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” <i>Structural Information and Communication Complexity</i>, 2010, pp. 168–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>.","chicago":"Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” In <i>Structural Information and Communication Complexity</i>, 168–82. SIROCCO 2010. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>.","short":"B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.","ieee":"B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in <i>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2010, pp. 168–182.","apa":"Degener, B., Kempkes, B., Kling, P., &#38; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In <i>Structural Information and Communication Complexity</i> (pp. 168–182). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>"},"publication":"Structural Information and Communication Complexity","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-02T13:56:17Z","date_updated":"2022-01-06T06:52:49Z","publication_status":"published","author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["9783642132834","9783642132841"],"issn":["0302-9743","1611-3349"]},"year":"2010","status":"public","title":"A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots","doi":"10.1007/978-3-642-13284-1_14","user_id":"15415","language":[{"iso":"eng"}],"_id":"16365","series_title":"SIROCCO 2010","page":"168-182"},{"doi":"10.1145/1810479.1810523","user_id":"15415","language":[{"iso":"eng"}],"_id":"16401","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","title":"A local O(n2) gathering algorithm","status":"public","year":"2010","publication_identifier":{"isbn":["9781450300797"]},"author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"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"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-03T12:48:11Z","publication":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","citation":{"chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Local O(N2) Gathering Algorithm.” In <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>, 2010. <a href=\"https://doi.org/10.1145/1810479.1810523\">https://doi.org/10.1145/1810479.1810523</a>.","ama":"Degener B, Kempkes B, Meyer auf der Heide F. A local O(n2) gathering algorithm. In: <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>. ; 2010. doi:<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010.","bibtex":"@inproceedings{Degener_Kempkes_Meyer auf der Heide_2010, title={A local O(n2) gathering algorithm}, DOI={<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>}, booktitle={Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2010} }","mla":"Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.” <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>, 2010, doi:<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>.","apa":"Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2010). A local O(n2) gathering algorithm. In <i>Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10</i>. <a href=\"https://doi.org/10.1145/1810479.1810523\">https://doi.org/10.1145/1810479.1810523</a>","ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering algorithm,” in <i>Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10</i>, 2010."}},{"title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.","year":"2010","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642141614","9783642141621"]},"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","_id":"16403","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/978-3-642-14162-1","editor":[{"first_name":"Samson","last_name":"Abramsky","full_name":"Abramsky, Samson"},{"full_name":"Gavoille, Cyril","last_name":"Gavoille","first_name":"Cyril"},{"full_name":"Kirchner, Claude","first_name":"Claude","last_name":"Kirchner"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Spirakis","first_name":"Paul G.","full_name":"Spirakis, Paul G."}],"citation":{"chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>.","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg, 2010.","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010.","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>}, year={2010} }","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>."},"date_created":"2020-04-03T12:56:30Z","place":"Berlin, Heidelberg","type":"book_editor","department":[{"_id":"63"}]},{"type":"book_editor","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-03T12:58:05Z","citation":{"short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg, 2010.","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>.","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010.","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>}, year={2010} }","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>."},"doi":"10.1007/978-3-642-14165-2","user_id":"15415","editor":[{"last_name":"Abramsky","first_name":"Samson","full_name":"Abramsky, Samson"},{"full_name":"Gavoille, Cyril","last_name":"Gavoille","first_name":"Cyril"},{"full_name":"Kirchner, Claude","last_name":"Kirchner","first_name":"Claude"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Spirakis, Paul G.","last_name":"Spirakis","first_name":"Paul G."}],"_id":"16404","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","status":"public","year":"2010","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.","publication_identifier":{"isbn":["9783642141614","9783642141621"],"issn":["0302-9743","1611-3349"]}},{"user_id":"5786","volume":261,"language":[{"iso":"eng"}],"_id":"19605","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:54:07Z","intvolume":"       261","title":"Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division","status":"public","year":"2009","author":[{"full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina","last_name":"Lürwer-Brüggemeier"}],"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-21T14:07:23Z","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090212010","relation":"confirmation"}]},"citation":{"short":"K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Lürwer-Brüggemeier K. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Vol 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","chicago":"Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Vol. 261. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","bibtex":"@book{Lürwer-Brüggemeier_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}, volume={261}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Lürwer-Brüggemeier, Katharina}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Lürwer-Brüggemeier, K. (2009). <i>Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division</i> (Vol. 261). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ieee":"K. Lürwer-Brüggemeier, <i>Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division</i>, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}]},{"citation":{"ieee":"M. Mense, <i>On Fault-Tolerant Data Placement in Storage Networks</i>, vol. 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Mense, M. (2009). <i>On Fault-Tolerant Data Placement in Storage Networks</i> (Vol. 260). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","short":"M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Vol. 260. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","mla":"Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","bibtex":"@book{Mense_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={On Fault-Tolerant Data Placement in Storage Networks}, volume={260}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mense, Mario}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Mense M. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Vol 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090206016"}]},"date_created":"2020-09-22T08:05:15Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"year":"2009","title":"On Fault-Tolerant Data Placement in Storage Networks","status":"public","publication_identifier":{"isbn":["978-3-939350-79-8"]},"author":[{"last_name":"Mense","first_name":"Mario","full_name":"Mense, Mario"}],"date_updated":"2022-01-06T06:54:08Z","intvolume":"       260","language":[{"iso":"eng"}],"_id":"19614","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":260},{"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20081218010","relation":"confirmation"}]},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"bibtex":"@book{Kortenjan_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}, volume={258}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kortenjan, Michael}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Kortenjan M. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Vol 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","mla":"Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Vol. 258. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ieee":"M. Kortenjan, <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Kortenjan, M. (2009). <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i> (Vol. 258). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-22T08:42:22Z","date_updated":"2022-01-06T06:54:08Z","intvolume":"       258","title":"Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes","status":"public","year":"2009","author":[{"full_name":"Kortenjan, Michael","first_name":"Michael","last_name":"Kortenjan"}],"publication_identifier":{"isbn":["978-3-939350-77-4"]},"user_id":"5786","volume":258,"_id":"19617","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"date_created":"2020-09-22T08:44:45Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"citation":{"chicago":"Bonorden, Olaf. <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>. Vol. 257. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ieee":"O. Bonorden, <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>, vol. 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Bonorden, O. (2009). <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i> (Vol. 257). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Bonorden_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip}, volume={257}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Bonorden O. <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>. Vol 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","mla":"Bonorden, Olaf. <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080623016","relation":"confirmation"}]},"_id":"19618","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":257,"status":"public","title":"Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip","year":"2009","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"}],"publication_identifier":{"isbn":["978-3-939350-76-7"]},"date_updated":"2022-01-06T06:54:08Z","intvolume":"       257"},{"author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"}],"status":"public","title":"Complexity and approximation of a geometric local robot assignment problem","year":"2009","has_accepted_license":"1","date_updated":"2022-01-06T06:54:10Z","language":[{"iso":"eng"}],"_id":"19722","user_id":"15415","ddc":["000"],"citation":{"apa":"Bonorden, O., Degener, B., Pietrzyk, P., &#38; Kempkes, B. (2009). <i>Complexity and approximation of a geometric local robot assignment problem</i>.","ieee":"O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, <i>Complexity and approximation of a geometric local robot assignment problem</i>. 2009.","short":"O. Bonorden, B. Degener, P. Pietrzyk, B. Kempkes, Complexity and Approximation of a Geometric Local Robot Assignment Problem, 2009.","chicago":"Bonorden, Olaf, Bastian Degener, Peter Pietrzyk, and Barbara Kempkes. <i>Complexity and Approximation of a Geometric Local Robot Assignment Problem</i>, 2009.","mla":"Bonorden, Olaf, et al. <i>Complexity and Approximation of a Geometric Local Robot Assignment Problem</i>. 2009.","ama":"Bonorden O, Degener B, Pietrzyk P, Kempkes B. <i>Complexity and Approximation of a Geometric Local Robot Assignment Problem</i>.; 2009.","bibtex":"@book{Bonorden_Degener_Pietrzyk_Kempkes_2009, title={Complexity and approximation of a geometric local robot assignment problem}, author={Bonorden, Olaf and Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2009} }"},"file_date_updated":"2020-09-28T10:19:26Z","date_created":"2020-09-28T10:19:43Z","file":[{"date_created":"2020-09-28T10:19:26Z","creator":"koala","file_id":"19723","success":1,"content_type":"application/pdf","file_name":"pub-hni-3956.pdf","file_size":258114,"access_level":"closed","relation":"main_file","date_updated":"2020-09-28T10:19:26Z"}],"department":[{"_id":"63"}],"type":"report"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642054334","9783642054341"]},"author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"last_name":"Pietrzyk","first_name":"Peter","full_name":"Pietrzyk, Peter"}],"title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","year":"2009","publication_status":"published","date_updated":"2022-01-06T06:54:10Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-05434-1_25","publication":"Algorithmic Aspects of Wireless Sensor Networks","abstract":[{"lang":"eng","text":"We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\\classP$ or are $\\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\\bigO(\\log^*n)$ communication rounds."}],"date_created":"2020-09-28T10:25:34Z","department":[{"_id":"63"}],"type":"book_chapter","status":"public","_id":"19724","publisher":"Springer","page":"252-262","user_id":"15415","citation":{"bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>}, booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer}, author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}, year={2009}, pages={252–262} }","ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: <i>Algorithmic Aspects of Wireless Sensor Networks</i>. Berlin, Heidelberg: Springer; 2009:252-262. doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Springer, 2009, pp. 252–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>.","chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In <i>Algorithmic Aspects of Wireless Sensor Networks</i>, 252–62. Berlin, Heidelberg: Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>.","short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","ieee":"O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Berlin, Heidelberg: Springer, 2009, pp. 252–262.","apa":"Bonorden, O., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In <i>Algorithmic Aspects of Wireless Sensor Networks</i> (pp. 252–262). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>"},"place":"Berlin, Heidelberg"},{"ddc":["000"],"user_id":"15415","_id":"19825","publisher":"Paderborn, Germany","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"full_name":"Mahlmann, Peter","first_name":"Peter","last_name":"Mahlmann"},{"full_name":"Janson, Thomas","last_name":"Janson","first_name":"Thomas"}],"year":"2009","title":"3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","status":"public","department":[{"_id":"63"}],"type":"report","date_created":"2020-10-01T09:47:54Z","file":[{"date_updated":"2020-10-01T09:47:33Z","relation":"main_file","access_level":"closed","file_size":753215,"file_name":"pub-hni-4130.pdf","success":1,"content_type":"application/pdf","file_id":"19826","creator":"koala","date_created":"2020-10-01T09:47:33Z"}],"abstract":[{"text":"Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn.","lang":"eng"}],"citation":{"bibtex":"@book{Schindelhauer_Mahlmann_Janson_2009, title={3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, publisher={Paderborn, Germany}, author={Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}, year={2009} }","chicago":"Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","ama":"Schindelhauer C, Mahlmann P, Janson T. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany; 2009.","short":"C. Schindelhauer, P. Mahlmann, T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs, Paderborn, Germany, 2009.","ieee":"C. Schindelhauer, P. Mahlmann, and T. Janson, <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","apa":"Schindelhauer, C., Mahlmann, P., &#38; Janson, T. (2009). <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany.","mla":"Schindelhauer, Christian, et al. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009."},"file_date_updated":"2020-10-01T09:47:33Z"},{"year":"2009","status":"public","title":"Minimal Energy Path Planning for Wireless Robots","author":[{"full_name":"Ooi, Chia Ching","last_name":"Ooi","first_name":"Chia Ching"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"issn":["1383-469X","1572-8153"]},"date_updated":"2022-01-06T06:54:13Z","publication_status":"published","page":"309-321","language":[{"iso":"eng"}],"_id":"19830","doi":"10.1007/s11036-008-0150-5","user_id":"15415","publication":"Mobile Networks and Applications (MONET)","citation":{"mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, pp. 309–21, doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>.","bibtex":"@article{Ooi_Schindelhauer_2009, title={Minimal Energy Path Planning for Wireless Robots}, DOI={<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>}, journal={Mobile Networks and Applications (MONET)}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={309–321} }","ama":"Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. <i>Mobile Networks and Applications (MONET)</i>. 2009:309-321. doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>","ieee":"C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” <i>Mobile Networks and Applications (MONET)</i>, pp. 309–321, 2009.","apa":"Ooi, C. C., &#38; Schindelhauer, C. (2009). Minimal Energy Path Planning for Wireless Robots. <i>Mobile Networks and Applications (MONET)</i>, 309–321. <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>","short":"C.C. Ooi, C. Schindelhauer, Mobile Networks and Applications (MONET) (2009) 309–321.","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, 309–21. <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>."},"date_created":"2020-10-01T10:05:47Z","type":"journal_article","department":[{"_id":"63"}]},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-10-01T10:10:10Z","publication":"Telecommunication Systems","citation":{"apa":"Ooi, C. C., &#38; Schindelhauer, C. (2009). Utilizing detours for energy conservation in mobile wireless networks. <i>Telecommunication Systems</i>, <i>43</i>, 25–37. <a href=\"https://doi.org/10.1007/s11235-009-9188-3\">https://doi.org/10.1007/s11235-009-9188-3</a>","ieee":"C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation in mobile wireless networks,” <i>Telecommunication Systems</i>, vol. 43, pp. 25–37, 2009.","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” <i>Telecommunication Systems</i> 43 (2009): 25–37. <a href=\"https://doi.org/10.1007/s11235-009-9188-3\">https://doi.org/10.1007/s11235-009-9188-3</a>.","short":"C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” <i>Telecommunication Systems</i>, vol. 43, 2009, pp. 25–37, doi:<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>.","ama":"Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile wireless networks. <i>Telecommunication Systems</i>. 2009;43:25-37. doi:<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>","bibtex":"@article{Ooi_Schindelhauer_2009, title={Utilizing detours for energy conservation in mobile wireless networks}, volume={43}, DOI={<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>}, journal={Telecommunication Systems}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={25–37} }"},"doi":"10.1007/s11235-009-9188-3","user_id":"15415","volume":43,"page":"25-37","language":[{"iso":"eng"}],"_id":"19831","date_updated":"2022-01-06T06:54:13Z","publication_status":"published","intvolume":"        43","year":"2009","title":"Utilizing detours for energy conservation in mobile wireless networks","status":"public","author":[{"full_name":"Ooi, Chia Ching","first_name":"Chia Ching","last_name":"Ooi"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"issn":["1018-4864","1572-9451"]}},{"title":"Colouring Non-sparse Random Intersection Graphs","status":"public","year":"2009","author":[{"full_name":"Raptopoulos, Christoforos L.","last_name":"Raptopoulos","first_name":"Christoforos L."},{"last_name":"Nikoletseas","first_name":"Sotiris E.","full_name":"Nikoletseas, Sotiris E."},{"full_name":"Spirakis, Paul G.","first_name":"Paul G.","last_name":"Spirakis"}],"publication_identifier":{"isbn":["9781493928637","9781493928644"]},"date_updated":"2022-01-06T06:54:14Z","publication_status":"published","page":"600--611","language":[{"iso":"eng"}],"_id":"19901","doi":"10.1007/978-1-4939-2864-4_597","user_id":"15415","publication":"34st International Symposium on Mathematical Foundations of Computer Science","citation":{"short":"C.L. Raptopoulos, S.E. Nikoletseas, P.G. Spirakis, in: 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.","ama":"Raptopoulos CL, Nikoletseas SE, Spirakis PG. Colouring Non-sparse Random Intersection Graphs. In: <i>34st International Symposium on Mathematical Foundations of Computer Science</i>. ; 2009:600--611. doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">10.1007/978-1-4939-2864-4_597</a>","chicago":"Raptopoulos, Christoforos L., Sotiris E. Nikoletseas, and Paul G. Spirakis. “Colouring Non-Sparse Random Intersection Graphs.” In <i>34st International Symposium on Mathematical Foundations of Computer Science</i>, 600--611, 2009. <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">https://doi.org/10.1007/978-1-4939-2864-4_597</a>.","bibtex":"@inproceedings{Raptopoulos_Nikoletseas_Spirakis_2009, title={Colouring Non-sparse Random Intersection Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">10.1007/978-1-4939-2864-4_597</a>}, booktitle={34st International Symposium on Mathematical Foundations of Computer Science}, author={Raptopoulos, Christoforos L. and Nikoletseas, Sotiris E. and Spirakis, Paul G.}, year={2009}, pages={600--611} }","apa":"Raptopoulos, C. L., Nikoletseas, S. E., &#38; Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In <i>34st International Symposium on Mathematical Foundations of Computer Science</i> (pp. 600--611). <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">https://doi.org/10.1007/978-1-4939-2864-4_597</a>","mla":"Raptopoulos, Christoforos L., et al. “Colouring Non-Sparse Random Intersection Graphs.” <i>34st International Symposium on Mathematical Foundations of Computer Science</i>, 2009, pp. 600--611, doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_597\">10.1007/978-1-4939-2864-4_597</a>.","ieee":"C. L. Raptopoulos, S. E. Nikoletseas, and P. G. Spirakis, “Colouring Non-sparse Random Intersection Graphs,” in <i>34st International Symposium on Mathematical Foundations of Computer Science</i>, 2009, pp. 600--611."},"date_created":"2020-10-06T10:09:51Z","type":"conference","department":[{"_id":"63"}]},{"date_updated":"2022-01-06T06:54:14Z","author":[{"full_name":"Nikoletseas, Sotiris E.","last_name":"Nikoletseas","first_name":"Sotiris E."},{"full_name":"Raptopoulos, Christoforos L.","first_name":"Christoforos L.","last_name":"Raptopoulos"},{"last_name":"Spirakis","first_name":"Paul G.","full_name":"Spirakis, Paul G."}],"title":"Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions","status":"public","year":"2009","user_id":"15415","doi":"10.1109/IPDPS.2009.5161002","language":[{"iso":"eng"}],"_id":"19904","page":"1--11","citation":{"chicago":"Nikoletseas, Sotiris E., Christoforos L. Raptopoulos, and Paul G. Spirakis. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.” In <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>, 1--11, 2009. <a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">https://doi.org/10.1109/IPDPS.2009.5161002</a>.","short":"S.E. Nikoletseas, C.L. Raptopoulos, P.G. Spirakis, in:  Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium, 2009, pp. 1--11.","ieee":"S. E. Nikoletseas, C. L. Raptopoulos, and P. G. Spirakis, “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions,” in <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>, 2009, pp. 1--11.","apa":"Nikoletseas, S. E., Raptopoulos, C. L., &#38; Spirakis, P. G. (2009). Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i> (pp. 1--11). <a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">https://doi.org/10.1109/IPDPS.2009.5161002</a>","bibtex":"@inproceedings{Nikoletseas_Raptopoulos_Spirakis_2009, title={Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">10.1109/IPDPS.2009.5161002</a>}, booktitle={ Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium}, author={Nikoletseas, Sotiris E. and Raptopoulos, Christoforos L. and Spirakis, Paul G.}, year={2009}, pages={1--11} }","ama":"Nikoletseas SE, Raptopoulos CL, Spirakis PG. Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In: <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>. ; 2009:1--11. doi:<a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">10.1109/IPDPS.2009.5161002</a>","mla":"Nikoletseas, Sotiris E., et al. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.” <i> Proceedings of IPDPS - IEEE International Parallel &#38; Distributed Processing Symposium</i>, 2009, pp. 1--11, doi:<a href=\"https://doi.org/10.1109/IPDPS.2009.5161002\">10.1109/IPDPS.2009.5161002</a>."},"publication":" Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium","department":[{"_id":"63"}],"type":"conference","date_created":"2020-10-06T10:23:53Z"},{"date_created":"2020-10-06T14:12:26Z","type":"conference","department":[{"_id":"63"},{"_id":"70"}],"publication":" Parallel and Distributed Computing and Systems, Nr. 21","citation":{"apa":"Deveci, D., Kortenjan, M., &#38; Schomaker, G. (2009). Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In <i> Parallel and Distributed Computing and Systems, Nr. 21</i>.","ieee":"D. Deveci, M. Kortenjan, and G. Schomaker, “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions,” in <i> Parallel and Distributed Computing and Systems, Nr. 21</i>, 2009.","chicago":"Deveci, Deniz, Michael Kortenjan, and Gunnar Schomaker. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” In <i> Parallel and Distributed Computing and Systems, Nr. 21</i>, 2009.","short":"D. Deveci, M. Kortenjan, G. Schomaker, in:  Parallel and Distributed Computing and Systems, Nr. 21, 2009.","mla":"Deveci, Deniz, et al. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” <i> Parallel and Distributed Computing and Systems, Nr. 21</i>, 2009.","ama":"Deveci D, Kortenjan M, Schomaker G. Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In: <i> Parallel and Distributed Computing and Systems, Nr. 21</i>. ; 2009.","bibtex":"@inproceedings{Deveci_Kortenjan_Schomaker_2009, title={Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions}, booktitle={ Parallel and Distributed Computing and Systems, Nr. 21}, author={Deveci, Deniz and Kortenjan, Michael and Schomaker, Gunnar}, year={2009} }"},"_id":"19934","language":[{"iso":"eng"}],"user_id":"15415","title":"Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions","status":"public","year":"2009","author":[{"full_name":"Deveci, Deniz","first_name":"Deniz","last_name":"Deveci"},{"last_name":"Kortenjan","first_name":"Michael","full_name":"Kortenjan, Michael"},{"full_name":"Schomaker, Gunnar","first_name":"Gunnar","last_name":"Schomaker"}],"date_updated":"2022-01-06T06:54:14Z"},{"department":[{"_id":"63"},{"_id":"238"}],"type":"conference","date_created":"2020-11-02T14:04:46Z","abstract":[{"lang":"eng","text":"One of the prominent challenges in mobile robotics is to develop control methodologies that allow the adaptation to dynamic and unforeseen environments. The classic approach of hand-coded controllers is very efficient for well-defined tasks and specific environments but poor in adapting to changing environmental conditions. One alternative approach is the application of evolutionary algorithms which need, in turn, easily evolvable representations of controllers. In this paper, we investigate one promising approach of an artificial hormone system as a control paradigm which is believed to be easily optimized by evolutionary processes. In a first step of this research, we focus on the simple task of collision avoidance. We present a brief mathematical analysis of this controller approach and an implementation of the controller on a mobile robot to check the feasibility in principle of our approach. The task is successfully accomplished and we conclude with a discussion of the hormone dynamics in the robot."}],"citation":{"short":"J. Stradner, H. Hamann, T. Schmickl, K. Crailsheim, in: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009.","chicago":"Stradner, Jürgen, Heiko Hamann, Thomas Schmickl, and Karl Crailsheim. “Analysis and Implementation of an Artificial Homeostatic Hormone System: A First Case Study in Robotic Hardware.” In <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>, 2009. <a href=\"https://doi.org/10.1109/iros.2009.5354056\">https://doi.org/10.1109/iros.2009.5354056</a>.","apa":"Stradner, J., Hamann, H., Schmickl, T., &#38; Crailsheim, K. (2009). Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware. In <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>. <a href=\"https://doi.org/10.1109/iros.2009.5354056\">https://doi.org/10.1109/iros.2009.5354056</a>","ieee":"J. Stradner, H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware,” in <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>, 2009.","ama":"Stradner J, Hamann H, Schmickl T, Crailsheim K. Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware. In: <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>. ; 2009. doi:<a href=\"https://doi.org/10.1109/iros.2009.5354056\">10.1109/iros.2009.5354056</a>","bibtex":"@inproceedings{Stradner_Hamann_Schmickl_Crailsheim_2009, title={Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware}, DOI={<a href=\"https://doi.org/10.1109/iros.2009.5354056\">10.1109/iros.2009.5354056</a>}, booktitle={2009 IEEE/RSJ International Conference on Intelligent Robots and Systems}, author={Stradner, Jürgen and Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2009} }","mla":"Stradner, Jürgen, et al. “Analysis and Implementation of an Artificial Homeostatic Hormone System: A First Case Study in Robotic Hardware.” <i>2009 IEEE/RSJ International Conference on Intelligent Robots and Systems</i>, 2009, doi:<a href=\"https://doi.org/10.1109/iros.2009.5354056\">10.1109/iros.2009.5354056</a>."},"publication":"2009 IEEE/RSJ International Conference on Intelligent Robots and Systems","user_id":"15415","doi":"10.1109/iros.2009.5354056","_id":"20254","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:54:25Z","publication_identifier":{"isbn":["9781424438037"]},"author":[{"full_name":"Stradner, Jürgen","last_name":"Stradner","first_name":"Jürgen"},{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"}],"year":"2009","status":"public","title":"Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware"}]