[{"publication":"Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"}],"author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"full_name":"Wiesemann, Timo","first_name":"Timo","last_name":"Wiesemann"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"}],"date_created":"2020-08-25T14:14:36Z","status":"public","abstract":[{"lang":"ger","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"}],"title":"Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems","user_id":"15415","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"39-52","year":"2010","citation":{"short":"T. Suess, T. Wiesemann, M. Fischer, in: Augmented & Virtual Reality in Der Produktentstehung, 2010, pp. 39–52.","ieee":"T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in Augmented & Virtual Reality in der Produktentstehung, 2010, pp. 39–52.","apa":"Suess, T., Wiesemann, T., & Fischer, M. (2010). Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In Augmented & Virtual Reality in der Produktentstehung (pp. 39–52).","ama":"Suess T, Wiesemann T, Fischer M. Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In: Augmented & Virtual Reality in Der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2010:39-52.","chicago":"Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” In Augmented & Virtual Reality in Der Produktentstehung, 39–52. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Suess, Tim, et al. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” Augmented & Virtual Reality in Der Produktentstehung, 2010, 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 & 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} }"},"type":"book_chapter","language":[{"iso":"eng"}],"_id":"18290","date_updated":"2022-01-06T06:53:28Z"},{"department":[{"_id":"63"}],"author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Phillips","first_name":"Cynthia A.","full_name":"Phillips, Cynthia A."}],"date_created":"2020-04-06T10:42:26Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781450300797"]},"user_id":"15415","title":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","language":[{"iso":"eng"}],"year":"2010","type":"conference","citation":{"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.","short":"F. Meyer auf der Heide, C.A. Phillips, in: 2010.","mla":"Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10. 2010, doi:10.1145/1810479.","bibtex":"@inproceedings{Meyer auf der Heide_Phillips_2010, title={Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10}, DOI={10.1145/1810479}, author={Meyer auf der Heide, Friedhelm and Phillips, Cynthia A.}, year={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:10.1145/1810479","apa":"Meyer auf der Heide, F., & Phillips, C. A. (2010). Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479","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. https://doi.org/10.1145/1810479."},"_id":"16414","date_updated":"2022-01-06T06:52:50Z","doi":"10.1145/1810479"},{"author":[{"last_name":"Eikel","first_name":"Benjamin","full_name":"Eikel, Benjamin"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"}],"department":[{"_id":"63"}],"publication":"Advances in Visual Computing","status":"public","date_created":"2020-04-14T13:06:51Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642172885","9783642172892"]},"place":"Berlin, Heidelberg","abstract":[{"lang":"eng","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."}],"user_id":"15415","title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","language":[{"iso":"eng"}],"citation":{"ieee":"B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin, Heidelberg, 2010.","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","mla":"Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” Advances in Visual Computing, 2010, doi:10.1007/978-3-642-17289-2_60.","bibtex":"@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={10.1007/978-3-642-17289-2_60}, booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}, year={2010} }","ama":"Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In: Advances in Visual Computing. Berlin, Heidelberg; 2010. doi:10.1007/978-3-642-17289-2_60","apa":"Eikel, B., Jähn, C., & Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17289-2_60","chicago":"Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” In Advances in Visual Computing. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-17289-2_60."},"year":"2010","type":"book_chapter","_id":"16505","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/978-3-642-17289-2_60"},{"status":"public","date_created":"2020-04-02T13:56:17Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642132834","9783642132841"]},"publication_status":"published","author":[{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"Structural Information and Communication Complexity","user_id":"15415","title":"A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots","place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"year":"2010","type":"book_chapter","citation":{"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 Structural Information and Communication Complexity, 168–82. SIROCCO 2010. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13284-1_14.","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: Structural Information and Communication Complexity. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182. doi:10.1007/978-3-642-13284-1_14","apa":"Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In Structural Information and Communication Complexity (pp. 168–182). Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14","mla":"Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” Structural Information and Communication Complexity, 2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.","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={10.1007/978-3-642-13284-1_14}, 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} }","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 Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182."},"page":"168-182","series_title":"SIROCCO 2010","doi":"10.1007/978-3-642-13284-1_14","_id":"16365","date_updated":"2022-01-06T06:52:49Z"},{"title":"A local O(n2) gathering algorithm","user_id":"15415","publication_status":"published","publication_identifier":{"isbn":["9781450300797"]},"date_created":"2020-04-03T12:48:11Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"doi":"10.1145/1810479.1810523","date_updated":"2022-01-06T06:52:50Z","_id":"16401","citation":{"chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Local O(N2) Gathering Algorithm.” In Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010. https://doi.org/10.1145/1810479.1810523.","ama":"Degener B, Kempkes B, Meyer auf der Heide F. A local O(n2) gathering algorithm. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10. ; 2010. doi:10.1145/1810479.1810523","apa":"Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010). A local O(n2) gathering algorithm. In Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479.1810523","bibtex":"@inproceedings{Degener_Kempkes_Meyer auf der Heide_2010, title={A local O(n2) gathering algorithm}, DOI={10.1145/1810479.1810523}, 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.” Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010, doi:10.1145/1810479.1810523.","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.","ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering algorithm,” in Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10, 2010."},"type":"conference","year":"2010","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"year":"2010","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 II., Berlin, Heidelberg, 2010.","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and 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.","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg; 2010. doi:10.1007/978-3-642-14162-1","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14162-1.","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={10.1007/978-3-642-14162-1}, year={2010} }","mla":"Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1."},"type":"book_editor","date_updated":"2022-01-06T06:52:50Z","_id":"16403","doi":"10.1007/978-3-642-14162-1","department":[{"_id":"63"}],"date_created":"2020-04-03T12:56:30Z","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642141614","9783642141621"]},"publication_status":"published","editor":[{"last_name":"Abramsky","full_name":"Abramsky, Samson","first_name":"Samson"},{"last_name":"Gavoille","full_name":"Gavoille, Cyril","first_name":"Cyril"},{"last_name":"Kirchner","full_name":"Kirchner, Claude","first_name":"Claude"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Spirakis","first_name":"Paul G.","full_name":"Spirakis, Paul G."}],"place":"Berlin, Heidelberg","user_id":"15415","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II."},{"year":"2010","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.","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and 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. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14165-2.","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg; 2010. doi:10.1007/978-3-642-14165-2","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2","mla":"Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.","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={10.1007/978-3-642-14165-2}, year={2010} }"},"type":"book_editor","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-14165-2","_id":"16404","date_updated":"2022-01-06T06:52:50Z","publication_identifier":{"isbn":["9783642141614","9783642141621"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","editor":[{"last_name":"Abramsky","full_name":"Abramsky, Samson","first_name":"Samson"},{"last_name":"Gavoille","full_name":"Gavoille, Cyril","first_name":"Cyril"},{"last_name":"Kirchner","first_name":"Claude","full_name":"Kirchner, Claude"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Spirakis, Paul G.","first_name":"Paul G.","last_name":"Spirakis"}],"date_created":"2020-04-03T12:58:05Z","status":"public","department":[{"_id":"63"}],"title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.","user_id":"15415","place":"Berlin, Heidelberg"},{"_id":"19605","intvolume":" 261","date_updated":"2022-01-06T06:54:07Z","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"type":"dissertation","year":"2009","citation":{"chicago":"Lürwer-Brüggemeier, Katharina. Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division. Vol. 261. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Lürwer-Brüggemeier K. Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division. Vol 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","apa":"Lürwer-Brüggemeier, K. (2009). Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division (Vol. 261). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","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} }","mla":"Lürwer-Brüggemeier, Katharina. Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ieee":"K. Lürwer-Brüggemeier, Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090212010","relation":"confirmation"}]},"title":"Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division","date_created":"2020-09-21T14:07:23Z","status":"public","volume":261,"department":[{"_id":"63"},{"_id":"26"}],"author":[{"first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090206016","relation":"confirmation"}]},"user_id":"5786","title":"On Fault-Tolerant Data Placement in Storage Networks","date_created":"2020-09-22T08:05:15Z","status":"public","volume":260,"publication_identifier":{"isbn":["978-3-939350-79-8"]},"department":[{"_id":"63"},{"_id":"26"}],"author":[{"full_name":"Mense, Mario","first_name":"Mario","last_name":"Mense"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19614","date_updated":"2022-01-06T06:54:08Z","intvolume":" 260","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"dissertation","citation":{"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} }","mla":"Mense, Mario. On Fault-Tolerant Data Placement in Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Mense, Mario. On Fault-Tolerant Data Placement in Storage Networks. Vol. 260. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Mense M. On Fault-Tolerant Data Placement in Storage Networks. Vol 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","apa":"Mense, M. (2009). On Fault-Tolerant Data Placement in Storage Networks (Vol. 260). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Mense, On Fault-Tolerant Data Placement in Storage Networks, vol. 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"year":"2009","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20081218010","relation":"confirmation"}]},"user_id":"5786","title":"Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes","status":"public","date_created":"2020-09-22T08:42:22Z","volume":258,"publication_identifier":{"isbn":["978-3-939350-77-4"]},"author":[{"first_name":"Michael","full_name":"Kortenjan, Michael","last_name":"Kortenjan"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"intvolume":" 258","_id":"19617","date_updated":"2022-01-06T06:54:08Z","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"type":"dissertation","citation":{"short":"M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ieee":"M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Kortenjan, Michael. Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes. Vol. 258. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Kortenjan, M. (2009). Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes (Vol. 258). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Kortenjan M. Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes. Vol 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","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} }","mla":"Kortenjan, Michael. Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"year":"2009","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","type":"dissertation","year":"2009","citation":{"apa":"Bonorden, O. (2009). Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip (Vol. 257). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Bonorden O. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Vol 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","chicago":"Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Vol. 257. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","mla":"Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","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} }","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, Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, vol. 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"_id":"19618","date_updated":"2022-01-06T06:54:08Z","intvolume":" 257","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"}],"department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["978-3-939350-76-7"]},"volume":257,"status":"public","date_created":"2020-09-22T08:44:45Z","title":"Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080623016","relation":"confirmation"}]},"user_id":"5786"},{"has_accepted_license":"1","status":"public","date_created":"2020-09-28T10:19:43Z","author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"last_name":"Pietrzyk","first_name":"Peter","full_name":"Pietrzyk, Peter"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"}],"file_date_updated":"2020-09-28T10:19:26Z","department":[{"_id":"63"}],"file":[{"date_created":"2020-09-28T10:19:26Z","file_name":"pub-hni-3956.pdf","access_level":"closed","file_size":258114,"file_id":"19723","creator":"koala","content_type":"application/pdf","date_updated":"2020-09-28T10:19:26Z","relation":"main_file","success":1}],"ddc":["000"],"title":"Complexity and approximation of a geometric local robot assignment problem","user_id":"15415","type":"report","year":"2009","citation":{"apa":"Bonorden, O., Degener, B., Pietrzyk, P., & Kempkes, B. (2009). Complexity and approximation of a geometric local robot assignment problem.","ama":"Bonorden O, Degener B, Pietrzyk P, Kempkes B. Complexity and Approximation of a Geometric Local Robot Assignment Problem.; 2009.","chicago":"Bonorden, Olaf, Bastian Degener, Peter Pietrzyk, and Barbara Kempkes. Complexity and Approximation of a Geometric Local Robot Assignment Problem, 2009.","mla":"Bonorden, Olaf, et al. Complexity and Approximation of a Geometric Local Robot Assignment Problem. 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} }","short":"O. Bonorden, B. Degener, P. Pietrzyk, B. Kempkes, Complexity and Approximation of a Geometric Local Robot Assignment Problem, 2009.","ieee":"O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, Complexity and approximation of a geometric local robot assignment problem. 2009."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:10Z","_id":"19722"},{"title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642054334","9783642054341"]},"department":[{"_id":"63"}],"doi":"10.1007/978-3-642-05434-1_25","date_updated":"2022-01-06T06:54:10Z","language":[{"iso":"eng"}],"user_id":"15415","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","status":"public","publication":"Algorithmic Aspects of Wireless Sensor Networks","author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"}],"publisher":"Springer","_id":"19724","page":"252-262","citation":{"chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In Algorithmic Aspects of Wireless Sensor Networks, 252–62. Berlin, Heidelberg: Springer, 2009. https://doi.org/10.1007/978-3-642-05434-1_25.","ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: Algorithmic Aspects of Wireless Sensor Networks. Berlin, Heidelberg: Springer; 2009:252-262. doi:10.1007/978-3-642-05434-1_25","apa":"Bonorden, O., Degener, B., Kempkes, B., & Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In Algorithmic Aspects of Wireless Sensor Networks (pp. 252–262). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-05434-1_25","bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={10.1007/978-3-642-05434-1_25}, 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} }","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” Algorithmic Aspects of Wireless Sensor Networks, Springer, 2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.","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 Algorithmic Aspects of Wireless Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262."},"year":"2009","type":"book_chapter"},{"author":[{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"},{"last_name":"Mahlmann","full_name":"Mahlmann, Peter","first_name":"Peter"},{"last_name":"Janson","full_name":"Janson, Thomas","first_name":"Thomas"}],"publisher":"Paderborn, Germany","file_date_updated":"2020-10-01T09:47:33Z","department":[{"_id":"63"}],"file":[{"relation":"main_file","success":1,"date_updated":"2020-10-01T09:47:33Z","content_type":"application/pdf","creator":"koala","file_id":"19826","file_size":753215,"access_level":"closed","file_name":"pub-hni-4130.pdf","date_created":"2020-10-01T09:47:33Z"}],"has_accepted_license":"1","status":"public","date_created":"2020-10-01T09:47:54Z","abstract":[{"lang":"eng","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."}],"title":"3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","ddc":["000"],"user_id":"15415","citation":{"mla":"Schindelhauer, Christian, et al. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.","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. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.","ama":"Schindelhauer C, Mahlmann P, Janson T. 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany; 2009.","apa":"Schindelhauer, C., Mahlmann, P., & Janson, T. (2009). 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany.","ieee":"C. Schindelhauer, P. Mahlmann, and T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. 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."},"type":"report","year":"2009","language":[{"iso":"eng"}],"_id":"19825","date_updated":"2022-01-06T06:54:13Z"},{"publication_status":"published","publication_identifier":{"issn":["1383-469X","1572-8153"]},"date_created":"2020-10-01T10:05:47Z","status":"public","publication":"Mobile Networks and Applications (MONET)","department":[{"_id":"63"}],"author":[{"first_name":"Chia Ching","full_name":"Ooi, Chia Ching","last_name":"Ooi"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"title":"Minimal Energy Path Planning for Wireless Robots","user_id":"15415","page":"309-321","type":"journal_article","year":"2009","citation":{"short":"C.C. Ooi, C. Schindelhauer, Mobile Networks and Applications (MONET) (2009) 309–321.","ieee":"C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” Mobile Networks and Applications (MONET), pp. 309–321, 2009.","apa":"Ooi, C. C., & Schindelhauer, C. (2009). Minimal Energy Path Planning for Wireless Robots. Mobile Networks and Applications (MONET), 309–321. https://doi.org/10.1007/s11036-008-0150-5","ama":"Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. Mobile Networks and Applications (MONET). 2009:309-321. doi:10.1007/s11036-008-0150-5","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” Mobile Networks and Applications (MONET), 2009, 309–21. https://doi.org/10.1007/s11036-008-0150-5.","bibtex":"@article{Ooi_Schindelhauer_2009, title={Minimal Energy Path Planning for Wireless Robots}, DOI={10.1007/s11036-008-0150-5}, journal={Mobile Networks and Applications (MONET)}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={309–321} }","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” Mobile Networks and Applications (MONET), 2009, pp. 309–21, doi:10.1007/s11036-008-0150-5."},"language":[{"iso":"eng"}],"doi":"10.1007/s11036-008-0150-5","date_updated":"2022-01-06T06:54:13Z","_id":"19830"},{"language":[{"iso":"eng"}],"page":"25-37","citation":{"short":"C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.","ieee":"C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation in mobile wireless networks,” Telecommunication Systems, vol. 43, pp. 25–37, 2009.","apa":"Ooi, C. C., & Schindelhauer, C. (2009). Utilizing detours for energy conservation in mobile wireless networks. Telecommunication Systems, 43, 25–37. https://doi.org/10.1007/s11235-009-9188-3","ama":"Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile wireless networks. Telecommunication Systems. 2009;43:25-37. doi:10.1007/s11235-009-9188-3","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” Telecommunication Systems 43 (2009): 25–37. https://doi.org/10.1007/s11235-009-9188-3.","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” Telecommunication Systems, vol. 43, 2009, pp. 25–37, doi:10.1007/s11235-009-9188-3.","bibtex":"@article{Ooi_Schindelhauer_2009, title={Utilizing detours for energy conservation in mobile wireless networks}, volume={43}, DOI={10.1007/s11235-009-9188-3}, journal={Telecommunication Systems}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={25–37} }"},"type":"journal_article","year":"2009","doi":"10.1007/s11235-009-9188-3","_id":"19831","date_updated":"2022-01-06T06:54:13Z","intvolume":" 43","date_created":"2020-10-01T10:10:10Z","status":"public","publication_status":"published","publication_identifier":{"issn":["1018-4864","1572-9451"]},"volume":43,"department":[{"_id":"63"}],"publication":"Telecommunication Systems","author":[{"full_name":"Ooi, Chia Ching","first_name":"Chia Ching","last_name":"Ooi"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"user_id":"15415","title":"Utilizing detours for energy conservation in mobile wireless networks"},{"publication":"34st International Symposium on Mathematical Foundations of Computer Science","department":[{"_id":"63"}],"author":[{"last_name":"Raptopoulos","full_name":"Raptopoulos, Christoforos L.","first_name":"Christoforos L."},{"full_name":"Nikoletseas, Sotiris E.","first_name":"Sotiris E.","last_name":"Nikoletseas"},{"first_name":"Paul G.","full_name":"Spirakis, Paul G.","last_name":"Spirakis"}],"date_created":"2020-10-06T10:09:51Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781493928637","9781493928644"]},"user_id":"15415","title":"Colouring Non-sparse Random Intersection Graphs","language":[{"iso":"eng"}],"page":"600--611","citation":{"ieee":"C. L. Raptopoulos, S. E. Nikoletseas, and P. G. Spirakis, “Colouring Non-sparse Random Intersection Graphs,” in 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.","short":"C.L. Raptopoulos, S.E. Nikoletseas, P.G. Spirakis, in: 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.","bibtex":"@inproceedings{Raptopoulos_Nikoletseas_Spirakis_2009, title={Colouring Non-sparse Random Intersection Graphs}, DOI={10.1007/978-1-4939-2864-4_597}, 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} }","mla":"Raptopoulos, Christoforos L., et al. “Colouring Non-Sparse Random Intersection Graphs.” 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611, doi:10.1007/978-1-4939-2864-4_597.","chicago":"Raptopoulos, Christoforos L., Sotiris E. Nikoletseas, and Paul G. Spirakis. “Colouring Non-Sparse Random Intersection Graphs.” In 34st International Symposium on Mathematical Foundations of Computer Science, 600--611, 2009. https://doi.org/10.1007/978-1-4939-2864-4_597.","ama":"Raptopoulos CL, Nikoletseas SE, Spirakis PG. Colouring Non-sparse Random Intersection Graphs. In: 34st International Symposium on Mathematical Foundations of Computer Science. ; 2009:600--611. doi:10.1007/978-1-4939-2864-4_597","apa":"Raptopoulos, C. L., Nikoletseas, S. E., & Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In 34st International Symposium on Mathematical Foundations of Computer Science (pp. 600--611). https://doi.org/10.1007/978-1-4939-2864-4_597"},"year":"2009","type":"conference","date_updated":"2022-01-06T06:54:14Z","_id":"19901","doi":"10.1007/978-1-4939-2864-4_597"},{"_id":"19904","date_updated":"2022-01-06T06:54:14Z","doi":"10.1109/IPDPS.2009.5161002","page":"1--11","year":"2009","type":"conference","citation":{"mla":"Nikoletseas, Sotiris E., et al. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.” Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 2009, pp. 1--11, doi:10.1109/IPDPS.2009.5161002.","bibtex":"@inproceedings{Nikoletseas_Raptopoulos_Spirakis_2009, title={Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions}, DOI={10.1109/IPDPS.2009.5161002}, booktitle={ Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium}, author={Nikoletseas, Sotiris E. and Raptopoulos, Christoforos L. and Spirakis, Paul G.}, year={2009}, pages={1--11} }","apa":"Nikoletseas, S. E., Raptopoulos, C. L., & Spirakis, P. G. (2009). Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium (pp. 1--11). https://doi.org/10.1109/IPDPS.2009.5161002","ama":"Nikoletseas SE, Raptopoulos CL, Spirakis PG. Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In: Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium. ; 2009:1--11. doi:10.1109/IPDPS.2009.5161002","chicago":"Nikoletseas, Sotiris E., Christoforos L. Raptopoulos, and Paul G. Spirakis. “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions.” In Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 1--11, 2009. https://doi.org/10.1109/IPDPS.2009.5161002.","ieee":"S. E. Nikoletseas, C. L. Raptopoulos, and P. G. Spirakis, “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions,” in Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 2009, pp. 1--11.","short":"S.E. Nikoletseas, C.L. Raptopoulos, P.G. Spirakis, in: Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, 2009, pp. 1--11."},"language":[{"iso":"eng"}],"title":"Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions","user_id":"15415","publication":" Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium","department":[{"_id":"63"}],"author":[{"first_name":"Sotiris E.","full_name":"Nikoletseas, Sotiris E.","last_name":"Nikoletseas"},{"last_name":"Raptopoulos","full_name":"Raptopoulos, Christoforos L.","first_name":"Christoforos L."},{"last_name":"Spirakis","full_name":"Spirakis, Paul G.","first_name":"Paul G."}],"date_created":"2020-10-06T10:23:53Z","status":"public"},{"title":"Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions","user_id":"15415","status":"public","date_created":"2020-10-06T14:12:26Z","author":[{"first_name":"Deniz","full_name":"Deveci, Deniz","last_name":"Deveci"},{"first_name":"Michael","full_name":"Kortenjan, Michael","last_name":"Kortenjan"},{"last_name":"Schomaker","first_name":"Gunnar","full_name":"Schomaker, Gunnar"}],"department":[{"_id":"63"},{"_id":"70"}],"publication":" Parallel and Distributed Computing and Systems, Nr. 21","date_updated":"2022-01-06T06:54:14Z","_id":"19934","type":"conference","year":"2009","citation":{"short":"D. Deveci, M. Kortenjan, G. Schomaker, in: Parallel and Distributed Computing and Systems, Nr. 21, 2009.","ieee":"D. Deveci, M. Kortenjan, and G. Schomaker, “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions,” in Parallel and Distributed Computing and Systems, Nr. 21, 2009.","ama":"Deveci D, Kortenjan M, Schomaker G. Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In: Parallel and Distributed Computing and Systems, Nr. 21. ; 2009.","apa":"Deveci, D., Kortenjan, M., & Schomaker, G. (2009). Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions. In Parallel and Distributed Computing and Systems, Nr. 21.","chicago":"Deveci, Deniz, Michael Kortenjan, and Gunnar Schomaker. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” In Parallel and Distributed Computing and Systems, Nr. 21, 2009.","mla":"Deveci, Deniz, et al. “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions.” Parallel and Distributed Computing and Systems, Nr. 21, 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} }"},"language":[{"iso":"eng"}]},{"citation":{"apa":"Stradner, J., Hamann, H., Schmickl, T., & Crailsheim, K. (2009). Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware. In 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2009.5354056","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: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems. ; 2009. doi:10.1109/iros.2009.5354056","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 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009. https://doi.org/10.1109/iros.2009.5354056.","mla":"Stradner, Jürgen, et al. “Analysis and Implementation of an Artificial Homeostatic Hormone System: A First Case Study in Robotic Hardware.” 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009, doi:10.1109/iros.2009.5354056.","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={10.1109/iros.2009.5354056}, 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} }","short":"J. Stradner, H. Hamann, T. Schmickl, K. Crailsheim, in: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009.","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 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009."},"type":"conference","year":"2009","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:25Z","_id":"20254","doi":"10.1109/iros.2009.5354056","author":[{"full_name":"Stradner, Jürgen","first_name":"Jürgen","last_name":"Stradner"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Schmickl","full_name":"Schmickl, Thomas","first_name":"Thomas"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}],"publication":"2009 IEEE/RSJ International Conference on Intelligent Robots and Systems","department":[{"_id":"63"},{"_id":"238"}],"publication_status":"published","publication_identifier":{"isbn":["9781424438037"]},"status":"public","date_created":"2020-11-02T14:04:46Z","abstract":[{"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.","lang":"eng"}],"title":"Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware","user_id":"15415"},{"_id":"20255","intvolume":" 6","issue":"9","page":"913-921","year":"2009","citation":{"short":"T. Schmickl, H. Hamann, H. Wörn, K. Crailsheim, Robotics and Autonomous Systems 6 (2009) 913–921.","ieee":"T. Schmickl, H. Hamann, H. Wörn, and K. Crailsheim, “Two different approaches to a macroscopic model of a bio-inspired robotic swarm,” Robotics and Autonomous Systems, vol. 6, no. 9, pp. 913–921, 2009.","ama":"Schmickl T, Hamann H, Wörn H, Crailsheim K. Two different approaches to a macroscopic model of a bio-inspired robotic swarm. Robotics and Autonomous Systems. 2009;6(9):913-921. doi:10.1016/j.robot.2009.06.002","apa":"Schmickl, T., Hamann, H., Wörn, H., & Crailsheim, K. (2009). Two different approaches to a macroscopic model of a bio-inspired robotic swarm. Robotics and Autonomous Systems, 6(9), 913–921. https://doi.org/10.1016/j.robot.2009.06.002","chicago":"Schmickl, Thomas, Heiko Hamann, Heinz Wörn, and Karl Crailsheim. “Two Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.” Robotics and Autonomous Systems 6, no. 9 (2009): 913–21. https://doi.org/10.1016/j.robot.2009.06.002.","bibtex":"@article{Schmickl_Hamann_Wörn_Crailsheim_2009, title={Two different approaches to a macroscopic model of a bio-inspired robotic swarm}, volume={6}, DOI={10.1016/j.robot.2009.06.002}, number={9}, journal={Robotics and Autonomous Systems}, author={Schmickl, Thomas and Hamann, Heiko and Wörn, Heinz and Crailsheim, Karl}, year={2009}, pages={913–921} }","mla":"Schmickl, Thomas, et al. “Two Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.” Robotics and Autonomous Systems, vol. 6, no. 9, 2009, pp. 913–21, doi:10.1016/j.robot.2009.06.002."},"type":"journal_article","abstract":[{"lang":"eng","text":"By compiling macroscopic models we analyze the adaptive behavior in a swarm of autonomous robots generated by a bio-inspired, distributed control algorithm. We developed two macroscopic models by taking two different perspectives: A Stock & Flow model, which is simple to implement and fast to simulate, and a spatially resolved model based on diffusion processes. These two models were compared concerning their prediction quality and their analytical power: One model allowed easy identification of the major feedback loops governing the swarm behavior. The other model allowed analysis of the expected shapes and positions of observable robot clusters. We found a high correlation in the challenges posed by both modeling techniques and we highlighted the inherent problems of inferring emergent macroscopic rules from a microscopic description of swarm behavior."}],"user_id":"15415","publication":"Robotics and Autonomous Systems","author":[{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Heinz","full_name":"Wörn, Heinz","last_name":"Wörn"},{"first_name":"Karl","full_name":"Crailsheim, Karl","last_name":"Crailsheim"}],"date_created":"2020-11-02T14:07:44Z","status":"public","volume":6,"date_updated":"2022-01-06T06:54:25Z","doi":"10.1016/j.robot.2009.06.002","language":[{"iso":"eng"}],"title":"Two different approaches to a macroscopic model of a bio-inspired robotic swarm","department":[{"_id":"63"},{"_id":"238"}],"publication_status":"published","publication_identifier":{"issn":["0921-8890"]}},{"_id":"20259","date_updated":"2022-01-06T06:54:25Z","language":[{"iso":"eng"}],"citation":{"chicago":"Hamann, Heiko, Inge Troch, and F. Breitenecker. “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” In MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.","ama":"Hamann H, Troch I, Breitenecker F. Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In: MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling. ; 2009.","apa":"Hamann, H., Troch, I., & Breitenecker, F. (2009). Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling.","bibtex":"@inproceedings{Hamann_Troch_Breitenecker_2009, title={Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System}, booktitle={MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling}, author={Hamann, Heiko and Troch, Inge and Breitenecker, F.}, year={2009} }","mla":"Hamann, Heiko, et al. “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.","short":"H. Hamann, I. Troch, F. Breitenecker, in: MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.","ieee":"H. Hamann, I. Troch, and F. Breitenecker, “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System,” in MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009."},"type":"conference","year":"2009","user_id":"15415","title":"Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Inge","full_name":"Troch, Inge","last_name":"Troch"},{"first_name":"F.","full_name":"Breitenecker, F.","last_name":"Breitenecker"}],"publication":"MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-11-02T14:18:27Z"},{"department":[{"_id":"63"}],"publication":"Public Service Review: Science and Technology","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Rammig, Franz-Josef","first_name":"Franz-Josef","last_name":"Rammig"}],"date_created":"2020-07-29T13:51:54Z","status":"public","volume":"04","user_id":"15415","title":"Self-Organisation and Self-Optimization","language":[{"iso":"eng"}],"citation":{"mla":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” Public Service Review: Science and Technology, vol. 04, 2009.","bibtex":"@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology}, author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }","chicago":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” Public Service Review: Science and Technology 04 (2009).","ama":"Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization. Public Service Review: Science and Technology. 2009;04.","apa":"Meyer auf der Heide, F., & Rammig, F.-J. (2009). Self-Organisation and Self-Optimization. Public Service Review: Science and Technology, 04.","ieee":"F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,” Public Service Review: Science and Technology, vol. 04, 2009.","short":"F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and Technology 04 (2009)."},"type":"journal_article","year":"2009","intvolume":" 4","_id":"17453","date_updated":"2022-01-06T06:53:12Z"},{"language":[{"iso":"eng"}],"doi":"10.1524/itit.2009.0524","date_updated":"2022-01-06T06:53:57Z","publication_status":"published","publication_identifier":{"issn":["1611-2776"]},"department":[{"_id":"63"}],"title":"Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)","page":"62-65","type":"journal_article","year":"2009","citation":{"ieee":"P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” it - Information Technology, vol. 51, no. 1, pp. 62–65, 2009.","short":"P. Briest, It - Information Technology 51 (2009) 62–65.","bibtex":"@article{Briest_2009, title={Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)}, volume={51}, DOI={10.1524/itit.2009.0524}, number={1}, journal={it - Information Technology}, author={Briest, Patrick}, year={2009}, pages={62–65} }","mla":"Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” It - Information Technology, vol. 51, no. 1, 2009, pp. 62–65, doi:10.1524/itit.2009.0524.","chicago":"Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” It - Information Technology 51, no. 1 (2009): 62–65. https://doi.org/10.1524/itit.2009.0524.","apa":"Briest, P. (2009). Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). It - Information Technology, 51(1), 62–65. https://doi.org/10.1524/itit.2009.0524","ama":"Briest P. Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it - Information Technology. 2009;51(1):62-65. doi:10.1524/itit.2009.0524"},"issue":"1","intvolume":" 51","_id":"19031","volume":51,"date_created":"2020-09-04T12:05:57Z","status":"public","publication":"it - Information Technology","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"}],"user_id":"15415"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2021-09-03T10:55:38Z","author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"last_name":"Hoefer","first_name":"Martin","full_name":"Hoefer, Martin"},{"full_name":"Gualà, Luciano","first_name":"Luciano","last_name":"Gualà"},{"first_name":"Carmine","full_name":"Ventre, Carmine","last_name":"Ventre"}],"department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","title":"On Stackelberg Pricing with Computationally Bounded Consumers","user_id":"15415","place":"Berlin, Heidelberg","abstract":[{"text":"In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability.\r\n\r\nWe consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3.","lang":"eng"}],"citation":{"ieee":"P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","short":"P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","bibtex":"@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On Stackelberg Pricing with Computationally Bounded Consumers}, DOI={10.1007/978-3-642-10841-9_6}, booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }","mla":"Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.","chicago":"Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On Stackelberg Pricing with Computationally Bounded Consumers.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2009. https://doi.org/10.1007/978-3-642-10841-9_6.","ama":"Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally Bounded Consumers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2009. doi:10.1007/978-3-642-10841-9_6","apa":"Briest, P., Hoefer, M., Gualà, L., & Ventre, C. (2009). On Stackelberg Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_6"},"year":"2009","type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-10841-9_6","_id":"23744","date_updated":"2022-01-06T06:55:59Z"},{"_id":"18138","date_updated":"2022-01-06T06:53:26Z","language":[{"iso":"eng"}],"citation":{"ieee":"C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification and Validation during Simulation Runtime,” in European Simulation and Modelling Conference (ESM 2009), 2009.","short":"C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","bibtex":"@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model Verification and Validation during Simulation Runtime}, booktitle={European Simulation and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }","mla":"Laroque, Christoph, et al. “Concepts for Model Verification and Validation during Simulation Runtime.” European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","chicago":"Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts for Model Verification and Validation during Simulation Runtime.” In European Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI, 2009.","apa":"Laroque, C., Fischer, M., & Dangelmaier, W. (2009). Concepts for Model Verification and Validation during Simulation Runtime. In European Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI.","ama":"Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation during Simulation Runtime. In: European Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI; 2009."},"year":"2009","type":"conference","abstract":[{"text":"Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task.","lang":"eng"}],"user_id":"15415","title":"Concepts for Model Verification and Validation during Simulation Runtime","department":[{"_id":"63"}],"publication":"European Simulation and Modelling Conference (ESM 2009)","publisher":"EUROSIS-ETI","author":[{"last_name":"Laroque","first_name":"Christoph","full_name":"Laroque, Christoph"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm"}],"date_created":"2020-08-24T07:28:23Z","status":"public"},{"title":"Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen","user_id":"5786","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Huber","first_name":"Daniel","full_name":"Huber, Daniel"},{"first_name":"Christoph ","full_name":"Laroque, Christoph ","last_name":"Laroque"},{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"}],"department":[{"_id":"63"},{"_id":"26"}],"publication":"Augmented & Virtual Reality in der Produktentstehung","volume":252,"status":"public","date_created":"2020-08-25T14:25:41Z","intvolume":" 252","_id":"18291","date_updated":"2022-01-06T06:53:28Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"chicago":"Suess, Tim, Matthias Fischer, Daniel Huber, Christoph Laroque, and Wilhelm Dangelmaier. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” In Augmented & Virtual Reality in Der Produktentstehung, 252:111--126. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Suess, T., Fischer, M., Huber, D., Laroque, C., & Dangelmaier, W. (2009). Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In Augmented & Virtual Reality in der Produktentstehung (Vol. 252, pp. 111--126). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In: Augmented & Virtual Reality in Der Produktentstehung. Vol 252. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009:111--126.","mla":"Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” Augmented & Virtual Reality in Der Produktentstehung, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","bibtex":"@inbook{Suess_Fischer_Huber_Laroque_Dangelmaier_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}, volume={252}, booktitle={Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Suess, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2009}, pages={111--126}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"T. Suess, M. Fischer, D. Huber, C. Laroque, W. Dangelmaier, in: Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","ieee":"T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in Augmented & Virtual Reality in der Produktentstehung, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126."},"year":"2009","type":"book_chapter","page":"111--126","language":[{"iso":"eng"}]},{"status":"public","date_created":"2020-08-26T08:49:50Z","author":[{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Matthias","full_name":"Hilbig, Matthias","last_name":"Hilbig"},{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"publication":"Proc. 25th European Workshop on Computational Geometry","department":[{"_id":"63"}],"user_id":"15415","title":"Planar Visibility Counting","abstract":[{"lang":"eng","text":"For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others) from p? The present work explores the trade-off between query time\r\nand preprocessing space for these quantities in 2D: exactly, in the approximate\r\ndeterministic, and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space data structure for S that, given p and time O(log n), allows\r\nto approximate the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically is just linear in the size n of the scene S. On the other hand,\r\nwe present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing time and space with similar approximation properties and query\r\ntime O(k*polylog n), where kProc. 25th European Workshop on Computational Geometry. ; 2009:203-206.","apa":"Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler, M. (2009). Planar Visibility Counting. In Proc. 25th European Workshop on Computational Geometry (pp. 203–206).","chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” In Proc. 25th European Workshop on Computational Geometry, 203–6, 2009.","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–06.","bibtex":"@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206} }","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in: Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206.","ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” in Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206."},"page":"203-206","_id":"18346","date_updated":"2022-01-06T06:53:29Z"},{"_id":"16429","date_updated":"2022-01-06T06:52:50Z","doi":"10.1016/j.tcs.2008.04.010","language":[{"iso":"eng"}],"page":"3391-3405","year":"2009","type":"journal_article","citation":{"short":"J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405.","ieee":"J. Kutyłowski and F. Meyer auf der Heide, “Optimal strategies for maintaining a chain of relays between an explorer and a base camp,” Theoretical Computer Science, pp. 3391–3405, 2009.","apa":"Kutyłowski, J., & Meyer auf der Heide, F. (2009). Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010","ama":"Kutyłowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science. 2009:3391-3405. doi:10.1016/j.tcs.2008.04.010","chicago":"Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical Computer Science, 2009, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010.","mla":"Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical Computer Science, 2009, pp. 3391–405, doi:10.1016/j.tcs.2008.04.010.","bibtex":"@article{Kutyłowski_Meyer auf der Heide_2009, title={Optimal strategies for maintaining a chain of relays between an explorer and a base camp}, DOI={10.1016/j.tcs.2008.04.010}, journal={Theoretical Computer Science}, author={Kutyłowski, Jarosław and Meyer auf der Heide, Friedhelm}, year={2009}, pages={3391–3405} }"},"user_id":"15415","title":"Optimal strategies for maintaining a chain of relays between an explorer and a base camp","department":[{"_id":"63"}],"publication":"Theoretical Computer Science","author":[{"last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław","first_name":"Jarosław"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_created":"2020-04-06T13:52:18Z","status":"public","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published"},{"user_id":"15415","title":"Power-aware online file allocation in mobile ad hoc networks","author":[{"full_name":"Mehler, Jan","first_name":"Jan","last_name":"Mehler"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-06T13:53:57Z","publication_status":"published","publication_identifier":{"isbn":["9781605586069"]},"date_updated":"2022-01-06T06:52:50Z","_id":"16430","doi":"10.1145/1583991.1584072","language":[{"iso":"eng"}],"citation":{"short":"J. Mehler, F. Meyer auf der Heide, in: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.","ieee":"J. Mehler and F. Meyer auf der Heide, “Power-aware online file allocation in mobile ad hoc networks,” in Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09, 2009.","chicago":"Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” In Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009. https://doi.org/10.1145/1583991.1584072.","apa":"Mehler, J., & Meyer auf der Heide, F. (2009). Power-aware online file allocation in mobile ad hoc networks. In Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991.1584072","ama":"Mehler J, Meyer auf der Heide F. Power-aware online file allocation in mobile ad hoc networks. In: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09. ; 2009. doi:10.1145/1583991.1584072","mla":"Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009, doi:10.1145/1583991.1584072.","bibtex":"@inproceedings{Mehler_Meyer auf der Heide_2009, title={Power-aware online file allocation in mobile ad hoc networks}, DOI={10.1145/1583991.1584072}, booktitle={Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, author={Mehler, Jan and Meyer auf der Heide, Friedhelm}, year={2009} }"},"type":"conference","year":"2009"},{"date_updated":"2022-01-06T06:52:50Z","_id":"16431","doi":"10.1145/1583991","citation":{"ieee":"F. Meyer auf der Heide and M. A. Bender, Eds., Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. 2009.","short":"F. Meyer auf der Heide, M.A. Bender, eds., Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.","mla":"Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09. 2009, doi:10.1145/1583991.","bibtex":"@book{Meyer auf der Heide_Bender_2009, title={Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, DOI={10.1145/1583991}, year={2009} }","apa":"Meyer auf der Heide, F., & Bender, M. A. (Eds.). (2009). Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991","ama":"Meyer auf der Heide F, Bender MA, eds. Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09.; 2009. doi:10.1145/1583991","chicago":"Meyer auf der Heide, Friedhelm, and Michael A. Bender, eds. Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009. https://doi.org/10.1145/1583991."},"type":"conference_editor","year":"2009","language":[{"iso":"eng"}],"title":"Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09","user_id":"15415","department":[{"_id":"63"}],"publication_identifier":{"isbn":["9781605586069"]},"publication_status":"published","editor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Bender","full_name":"Bender, Michael A.","first_name":"Michael A."}],"date_created":"2020-04-06T13:55:23Z","status":"public"},{"page":"545-569","type":"journal_article","year":"2009","citation":{"chicago":"Bienkowski, Marcin, Jaroslaw Byrka, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Optimal Algorithms for Page Migration in Dynamic Networks.” Journal of Discrete Algorithms, 2009, 545–69. https://doi.org/10.1016/j.jda.2008.07.006.","apa":"Bienkowski, M., Byrka, J., Korzeniowski, M., & Meyer auf der Heide, F. (2009). Optimal algorithms for page migration in dynamic networks. Journal of Discrete Algorithms, 545–569. https://doi.org/10.1016/j.jda.2008.07.006","ama":"Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F. Optimal algorithms for page migration in dynamic networks. Journal of Discrete Algorithms. 2009:545-569. doi:10.1016/j.jda.2008.07.006","mla":"Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic Networks.” Journal of Discrete Algorithms, 2009, pp. 545–69, doi:10.1016/j.jda.2008.07.006.","bibtex":"@article{Bienkowski_Byrka_Korzeniowski_Meyer auf der Heide_2009, title={Optimal algorithms for page migration in dynamic networks}, DOI={10.1016/j.jda.2008.07.006}, journal={Journal of Discrete Algorithms}, author={Bienkowski, Marcin and Byrka, Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2009}, pages={545–569} }","short":"M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal of Discrete Algorithms (2009) 545–569.","ieee":"M. Bienkowski, J. Byrka, M. Korzeniowski, and F. Meyer auf der Heide, “Optimal algorithms for page migration in dynamic networks,” Journal of Discrete Algorithms, pp. 545–569, 2009."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","_id":"16398","doi":"10.1016/j.jda.2008.07.006","department":[{"_id":"63"}],"publication":"Journal of Discrete Algorithms","author":[{"first_name":"Marcin","full_name":"Bienkowski, Marcin","last_name":"Bienkowski"},{"last_name":"Byrka","full_name":"Byrka, Jaroslaw","first_name":"Jaroslaw"},{"last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication_status":"published","publication_identifier":{"issn":["1570-8667"]},"date_created":"2020-04-03T10:40:45Z","status":"public","title":"Optimal algorithms for page migration in dynamic networks","user_id":"15415"},{"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090114013"}]},"user_id":"5786","title":"Distributed Resource Allocation and Management in Heterogeneous Networks","status":"public","date_created":"2020-09-22T08:10:41Z","volume":259,"publication_identifier":{"isbn":["978-3-939350-78-1"]},"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Schomaker","first_name":"Gunnar","full_name":"Schomaker, Gunnar"}],"department":[{"_id":"63"},{"_id":"26"}],"_id":"19615","intvolume":" 259","date_updated":"2022-01-06T06:54:08Z","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"type":"dissertation","citation":{"short":"G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","ieee":"G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous Networks, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","chicago":"Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous Networks. Vol. 259. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","ama":"Schomaker G. Distributed Resource Allocation and Management in Heterogeneous Networks. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008.","apa":"Schomaker, G. (2008). Distributed Resource Allocation and Management in Heterogeneous Networks (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Schomaker_2008, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Distributed Resource Allocation and Management in Heterogeneous Networks}, volume={259}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schomaker, Gunnar}, year={2008}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008."},"year":"2008","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"publication_status":"published","publication_identifier":{"isbn":["9783540705741","9783540705758"],"issn":["0302-9743","1611-3349"]},"date_created":"2020-09-25T09:45:40Z","status":"public","publication":"Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)","department":[{"_id":"63"}],"author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"}],"title":"Uniform Budgets and the Envy-Free Pricing Problem","user_id":"15415","year":"2008","type":"conference","citation":{"ieee":"P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.","short":"P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.","bibtex":"@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing Problem}, DOI={10.1007/978-3-540-70575-8_66}, booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }","mla":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008, doi:10.1007/978-3-540-70575-8_66.","chicago":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008. https://doi.org/10.1007/978-3-540-70575-8_66.","ama":"Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP). ; 2008. doi:10.1007/978-3-540-70575-8_66","apa":"Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP). https://doi.org/10.1007/978-3-540-70575-8_66"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-540-70575-8_66","date_updated":"2022-01-06T06:54:10Z","_id":"19686"},{"place":"Cham","user_id":"15415","title":"On the Approximability of Combinatorial Exchange Problems","department":[{"_id":"63"}],"publication":"Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)","author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"first_name":"Piotr","full_name":"Krysta, Piotr","last_name":"Krysta"},{"full_name":"Babaioff, Moshe","first_name":"Moshe","last_name":"Babaioff"}],"date_created":"2020-09-25T09:49:43Z","status":"public","publication_status":"published","date_updated":"2022-01-06T06:54:10Z","_id":"19687","doi":"https://doi.org/10.1007/978-3-540-79309-0_9","language":[{"iso":"eng"}],"citation":{"mla":"Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.” Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 2008, doi:https://doi.org/10.1007/978-3-540-79309-0_9.","bibtex":"@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the Approximability of Combinatorial Exchange Problems}, DOI={https://doi.org/10.1007/978-3-540-79309-0_9}, booktitle={Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)}, author={Briest, Patrick and Krysta, Piotr and Babaioff, Moshe}, year={2008} }","chicago":"Briest, Patrick, Piotr Krysta, and Moshe Babaioff. “On the Approximability of Combinatorial Exchange Problems.” In Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT). Cham, 2008. https://doi.org/10.1007/978-3-540-79309-0_9.","apa":"Briest, P., Krysta, P., & Babaioff, M. (2008). On the Approximability of Combinatorial Exchange Problems. In Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT). Cham. https://doi.org/10.1007/978-3-540-79309-0_9","ama":"Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange Problems. In: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT). Cham; 2008. doi:https://doi.org/10.1007/978-3-540-79309-0_9","ieee":"P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial Exchange Problems,” in Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 2008.","short":"P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), Cham, 2008."},"type":"conference","year":"2008"},{"status":"public","date_created":"2020-09-25T09:52:57Z","author":[{"first_name":"Patrick","full_name":"Briest, Patrick","last_name":"Briest"},{"full_name":"Goldberg, Paul W.","first_name":"Paul W.","last_name":"Goldberg"},{"last_name":"Roeglin","full_name":"Roeglin, Heiko","first_name":"Heiko"}],"department":[{"_id":"63"}],"user_id":"15415","title":"Approximate Equilibria in Games with Few Players","abstract":[{"lang":"eng","text":"We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria) in normal form games, where the number of players is a small\r\nconstant. We consider the approach of looking for solutions with constant\r\nsupport size. It is known from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2. In this paper we extend those results to the\r\nk-player case, and find that epsilon = 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results for the 2-player case may be used\r\nin order to slightly improve upon the epsilon = 1-1/k obtained in the k-player\r\ncase."}],"external_id":{"arxiv":["0804.4524 "]},"language":[{"iso":"eng"}],"year":"2008","citation":{"bibtex":"@book{Briest_Goldberg_Roeglin_2008, title={Approximate Equilibria in Games with Few Players}, author={Briest, Patrick and Goldberg, Paul W. and Roeglin, Heiko}, year={2008} }","mla":"Briest, Patrick, et al. Approximate Equilibria in Games with Few Players. 2008.","apa":"Briest, P., Goldberg, P. W., & Roeglin, H. (2008). Approximate Equilibria in Games with Few Players.","ama":"Briest P, Goldberg PW, Roeglin H. Approximate Equilibria in Games with Few Players.; 2008.","chicago":"Briest, Patrick, Paul W. Goldberg, and Heiko Roeglin. Approximate Equilibria in Games with Few Players, 2008.","ieee":"P. Briest, P. W. Goldberg, and H. Roeglin, Approximate Equilibria in Games with Few Players. 2008.","short":"P. Briest, P.W. Goldberg, H. Roeglin, Approximate Equilibria in Games with Few Players, 2008."},"type":"report","date_updated":"2022-01-06T06:54:10Z","_id":"19688"},{"author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"full_name":"Mahlmann, Peter","first_name":"Peter","last_name":"Mahlmann"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"publication":"The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop","status":"public","date_created":"2020-09-30T13:24:15Z","abstract":[{"text":"Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, resource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algorithms such that the overlay network can be a connected random graph or use a random graph as backbone. Random graphs are expander graphs have logarithmic diameter, high node connectivity, excellent communication properties, and are expander graphs with high probability. In summary: they are an excellent choice to improve the stability and robustness of a dynamic network.","lang":"eng"}],"user_id":"5786","title":"Random Graphs for Peer-to-Peer Overlays","language":[{"iso":"eng"}],"citation":{"mla":"Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer Overlays.” The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, no. 222, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.","bibtex":"@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer Overlays}, number={222}, booktitle={The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer, Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }","apa":"Schindelhauer, C., & Mahlmann, P. (2008). Random Graphs for Peer-to-Peer Overlays. The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 222, 1–22.","ama":"Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In: The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.","chicago":"Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer Overlays.” In The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 1–22. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","ieee":"C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,” in The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.","short":"C. Schindelhauer, P. Mahlmann, in: The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22."},"type":"conference","year":"2008","page":"1-22","date_updated":"2022-01-06T06:54:13Z","_id":"19812","issue":"222"},{"publication_status":"published","publication_identifier":{"issn":["1571-5736"],"isbn":["9780387848389","9780387848396"]},"date_created":"2020-09-30T13:27:54Z","status":"public","department":[{"_id":"63"}],"publication":"MWCN'08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)","author":[{"full_name":"Ooi, Chia Ching","first_name":"Chia Ching","last_name":"Ooi"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"publisher":"Springer","title":"Detours Save Energy in Mobile Wireless Networks","user_id":"15415","abstract":[{"lang":"eng","text":"Autonomous robotic systems have been gaining the attention of research community in mobile ad hoc network since the past few years. While motion cost and communications cost constitute the primary energy consumers, each of them is investigated independently. By taking into account the power consumption of both entities, the overall energy efficiency of a system can be further improved. In this paper, the energy optimization problem of radio communication and motion is examined. We consider a hybrid wireless network that consists of a single autonomous mobile node and multiple relay nodes. The mobile node interacts with the relays within its vicinity by continuously communicating high-bandwidth data, e.g. triggered by a multimedia application like video surveillance. The goal is to find the best path such that the energy consumption for both mobility and communications is minimized. We introduce the Radio-Energy-Aware (REA) path computation strategy by utilizing node mobility. Given the starting point, the target point and the position of the relays, our simulation results show that the proposed strategy improves the energy efficiency of mobile node compared to the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. "}],"type":"conference","year":"2008","citation":{"ieee":"C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,” in MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), 2008.","short":"C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), Springer, 2008.","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile Wireless Networks.” MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), Springer, 2008, doi:10.1007/978-0-387-84839-6_6.","bibtex":"@inproceedings{Ooi_Schindelhauer_2008, title={Detours Save Energy in Mobile Wireless Networks}, DOI={10.1007/978-0-387-84839-6_6}, booktitle={MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}, publisher={Springer}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }","ama":"Ooi CC, Schindelhauer C. Detours Save Energy in Mobile Wireless Networks. In: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer; 2008. doi:10.1007/978-0-387-84839-6_6","apa":"Ooi, C. C., & Schindelhauer, C. (2008). Detours Save Energy in Mobile Wireless Networks. In MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer. https://doi.org/10.1007/978-0-387-84839-6_6","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile Wireless Networks.” In MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer, 2008. https://doi.org/10.1007/978-0-387-84839-6_6."},"language":[{"iso":"eng"}],"doi":"10.1007/978-0-387-84839-6_6","date_updated":"2022-01-06T06:54:13Z","_id":"19813"},{"_id":"19832","date_updated":"2022-01-06T06:54:13Z","doi":"10.1007/978-3-642-00644-9_4","type":"conference","year":"2008","citation":{"mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots.” ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008, doi:10.1007/978-3-642-00644-9_4.","bibtex":"@inproceedings{Ooi_Schindelhauer_2008, title={Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots}, DOI={10.1007/978-3-642-00644-9_4}, booktitle={ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }","ama":"Ooi CC, Schindelhauer C. Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots. In: ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008). ; 2008. doi:10.1007/978-3-642-00644-9_4","apa":"Ooi, C. C., & Schindelhauer, C. (2008). Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots. In ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008). https://doi.org/10.1007/978-3-642-00644-9_4","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots.” In ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008. https://doi.org/10.1007/978-3-642-00644-9_4.","ieee":"C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots,” in ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008.","short":"C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008."},"language":[{"iso":"eng"}],"title":"Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots","user_id":"15415","author":[{"first_name":"Chia Ching","full_name":"Ooi, Chia Ching","last_name":"Ooi"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"publication":"ARS'08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)","department":[{"_id":"63"}],"publication_identifier":{"isbn":["9783642006432","9783642006449"]},"publication_status":"published","status":"public","date_created":"2020-10-01T10:14:06Z"},{"date_updated":"2022-01-06T06:54:16Z","_id":"19950","type":"mastersthesis","year":"2008","citation":{"mla":"Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten. 2008.","bibtex":"@book{Pietrzyk_2008, title={Lokale Strategien zur Optimierung von Kommunikationsketten}, author={Pietrzyk, Peter}, year={2008} }","chicago":"Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten, 2008.","ama":"Pietrzyk P. Lokale Strategien Zur Optimierung von Kommunikationsketten.; 2008.","apa":"Pietrzyk, P. (2008). Lokale Strategien zur Optimierung von Kommunikationsketten.","ieee":"P. Pietrzyk, Lokale Strategien zur Optimierung von Kommunikationsketten. 2008.","short":"P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten, 2008."},"language":[{"iso":"eng"}],"ddc":["000"],"title":"Lokale Strategien zur Optimierung von Kommunikationsketten","user_id":"15415","author":[{"last_name":"Pietrzyk","first_name":"Peter","full_name":"Pietrzyk, Peter"}],"department":[{"_id":"63"}],"file_date_updated":"2020-10-07T14:22:49Z","file":[{"file_name":"pub-hni-3364.pdf","date_created":"2020-10-07T14:22:49Z","access_level":"closed","file_size":638802,"creator":"koala","file_id":"19951","content_type":"application/pdf","date_updated":"2020-10-07T14:22:49Z","relation":"main_file","success":1}],"status":"public","has_accepted_license":"1","date_created":"2020-10-07T14:23:26Z"},{"department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"date_created":"2020-11-02T14:23:36Z","status":"public","publication_identifier":{"issn":["1867-4925","1867-4933"],"isbn":["9783642133763","9783642133770"]},"publication_status":"published","user_id":"15415","title":"Space-Time Continuous Models of Swarm Robotic Systems","language":[{"iso":"eng"}],"citation":{"short":"H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems, 2008.","ieee":"H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems. 2008.","chicago":"Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems, 2008. https://doi.org/10.1007/978-3-642-13377-0.","ama":"Hamann H. Space-Time Continuous Models of Swarm Robotic Systems.; 2008. doi:10.1007/978-3-642-13377-0","apa":"Hamann, H. (2008). Space-Time Continuous Models of Swarm Robotic Systems. https://doi.org/10.1007/978-3-642-13377-0","bibtex":"@book{Hamann_2008, title={Space-Time Continuous Models of Swarm Robotic Systems}, DOI={10.1007/978-3-642-13377-0}, author={Hamann, Heiko}, year={2008} }","mla":"Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems. 2008, doi:10.1007/978-3-642-13377-0."},"year":"2008","type":"dissertation","date_updated":"2022-01-06T06:54:25Z","_id":"20262","doi":"10.1007/978-3-642-13377-0"},{"date_created":"2021-10-15T09:34:19Z","status":"public","department":[{"_id":"63"}],"publication":"arXiv:0802.2027","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"},{"last_name":"Koolen","full_name":"Koolen, Wouter M.","first_name":"Wouter M."}],"title":"Kolmogorov Complexity Theory over the Reals","user_id":"15415","abstract":[{"lang":"eng","text":"Kolmogorov Complexity constitutes an integral part of computability theory,\r\ninformation theory, and computational complexity theory -- in the discrete\r\nsetting of bits and Turing machines. Over real numbers, on the other hand, the\r\nBSS-machine (aka real-RAM) has been established as a major model of\r\ncomputation. This real realm has turned out to exhibit natural counterparts to\r\nmany notions and results in classical complexity and recursion theory; although\r\nusually with considerably different proofs. The present work investigates\r\nsimilarities and differences between discrete and real Kolmogorov Complexity as\r\nintroduced by Montana and Pardo (1998)."}],"type":"preprint","year":"2008","citation":{"bibtex":"@article{Ziegler_Koolen_2008, title={Kolmogorov Complexity Theory over the Reals}, journal={arXiv:0802.2027}, author={Ziegler, Martin and Koolen, Wouter M.}, year={2008} }","mla":"Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the Reals.” ArXiv:0802.2027, 2008.","chicago":"Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the Reals.” ArXiv:0802.2027, 2008.","apa":"Ziegler, M., & Koolen, W. M. (2008). Kolmogorov Complexity Theory over the Reals. In arXiv:0802.2027.","ama":"Ziegler M, Koolen WM. Kolmogorov Complexity Theory over the Reals. arXiv:08022027. Published online 2008.","ieee":"M. Ziegler and W. M. Koolen, “Kolmogorov Complexity Theory over the Reals,” arXiv:0802.2027. 2008.","short":"M. Ziegler, W.M. Koolen, ArXiv:0802.2027 (2008)."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:57:18Z","_id":"26235"},{"citation":{"short":"S. Köhler, M. Ziegler, in: Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–156.","ieee":"S. Köhler and M. Ziegler, “On the Stability of Fast Polynomial Arithmetic,” in Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–156.","chicago":"Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial Arithmetic.” In Proc. 8th Conference on Real Numbers and Computers, 147–56, 2008.","apa":"Köhler, S., & Ziegler, M. (2008). On the Stability of Fast Polynomial Arithmetic. Proc. 8th Conference on Real Numbers and Computers, 147–156.","ama":"Köhler S, Ziegler M. On the Stability of Fast Polynomial Arithmetic. In: Proc. 8th Conference on Real Numbers and Computers. ; 2008:147-156.","mla":"Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial Arithmetic.” Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–56.","bibtex":"@inproceedings{Köhler_Ziegler_2008, title={On the Stability of Fast Polynomial Arithmetic}, booktitle={Proc. 8th Conference on Real Numbers and Computers}, author={Köhler, Sven and Ziegler, Martin}, year={2008}, pages={147–156} }"},"year":"2008","type":"conference","page":"147-156","language":[{"iso":"eng"}],"_id":"26243","date_updated":"2022-01-06T06:57:18Z","status":"public","date_created":"2021-10-15T09:57:36Z","author":[{"last_name":"Köhler","first_name":"Sven","full_name":"Köhler, Sven"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"publication":"Proc. 8th Conference on Real Numbers and Computers","department":[{"_id":"63"}],"title":"On the Stability of Fast Polynomial Arithmetic","user_id":"15415","abstract":[{"text":"Operations on univariate dense polynomials—multiplication, division with remainder, multipoint\r\nevaluation—constitute central primitives entering as build-up blocks into many higher applications and\r\nalgorithms. Fast Fourier Transform permits to accelerate them from naive quadratic to running time\r\nO(n·polylogn), that is softly linear in the degree n of the input. This is routinely employed in complexity\r\ntheoretic considerations and, over integers and finite fields, in practical number theoretic calculations.\r\nThe present work explores the benefit of fast polynomial arithmetic over the field of real numbers\r\nwhere the precision of approximation becomes crucial. To this end, we study the computability of the\r\nabove operations in the sense of Recursive Analysis as an effective refinement of continuity. This theo-\r\nretical worst-case stability analysis is then complemented by an empirical evaluation: We use GMP and\r\nthe iRRAM to find the precision required for the intermediate calculations in order to achieve a desired\r\noutput accuracy.","lang":"eng"}]},{"_id":"26255","date_updated":"2022-01-06T06:57:18Z","language":[{"iso":"eng"}],"type":"journal_article","citation":{"ieee":"M. Ziegler, “Physically-Relativized Church-Turing Hypotheses,” Applied Mathematics and Computation, 2008.","short":"M. Ziegler, Applied Mathematics and Computation (2008).","mla":"Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied Mathematics and Computation, 2008.","bibtex":"@article{Ziegler_2008, title={Physically-Relativized Church-Turing Hypotheses}, journal={Applied Mathematics and Computation}, author={Ziegler, Martin}, year={2008} }","apa":"Ziegler, M. (2008). Physically-Relativized Church-Turing Hypotheses. Applied Mathematics and Computation.","ama":"Ziegler M. Physically-Relativized Church-Turing Hypotheses. Applied Mathematics and Computation. Published online 2008.","chicago":"Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied Mathematics and Computation, 2008."},"year":"2008","user_id":"15415","title":"Physically-Relativized Church-Turing Hypotheses","abstract":[{"text":"We turn the physical Church-Turing Hypothesis from an ambiguous source of sensational\r\nspeculations into a (collection of) sound and well-defined scientific problem(s):\r\nExamining recent controversies and causes for misunderstanding concerning the state of the Church-\r\nTuring Hypothesis (CTH), it is suggested to study the CTH ‘sharpened’ relative to an arbitrary but\r\nspecific physical theory—rather than vaguely referring to “nature” in general. For this purpose we\r\ncombine physical structuralism with computational complexity theory. The benefits of this approach\r\nare illustrated by some exemplary results on computability and complexity in computational physics.","lang":"eng"}],"external_id":{"arxiv":["0805.1292"]},"status":"public","date_created":"2021-10-15T10:10:04Z","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"department":[{"_id":"63"},{"_id":"26"}],"publication":"Applied Mathematics and Computation"},{"date_updated":"2022-01-06T06:57:18Z","_id":"26262","page":"145","citation":{"short":"M. Ziegler, in: Verhandlungen Der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.","ieee":"M. Ziegler, “A Meta-Theory of Physics and Computation,” in Verhandlungen der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.","apa":"Ziegler, M. (2008). A Meta-Theory of Physics and Computation. In Verhandlungen der Deutschen Physikalischen Gesellschaft (p. 145). Deutsche Physikalische Gesellschaft (DPG).","ama":"Ziegler M. A Meta-Theory of Physics and Computation. In: Verhandlungen Der Deutschen Physikalischen Gesellschaft. Deutsche Physikalische Gesellschaft (DPG); 2008:145.","chicago":"Ziegler, Martin. “A Meta-Theory of Physics and Computation.” In Verhandlungen Der Deutschen Physikalischen Gesellschaft, 145. Deutsche Physikalische Gesellschaft (DPG), 2008.","mla":"Ziegler, Martin. “A Meta-Theory of Physics and Computation.” Verhandlungen Der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.","bibtex":"@inbook{Ziegler_2008, title={A Meta-Theory of Physics and Computation}, booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft}, publisher={Deutsche Physikalische Gesellschaft (DPG)}, author={Ziegler, Martin}, year={2008}, pages={145} }"},"year":"2008","type":"book_chapter","language":[{"iso":"eng"}],"title":"A Meta-Theory of Physics and Computation","user_id":"15415","date_created":"2021-10-15T10:35:55Z","status":"public","publication":"Verhandlungen der Deutschen Physikalischen Gesellschaft","department":[{"_id":"63"},{"_id":"26"}],"author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"publisher":"Deutsche Physikalische Gesellschaft (DPG)"},{"date_created":"2021-10-15T12:42:15Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0885-064X"]},"publication":"Journal of Complexity","department":[{"_id":"63"},{"_id":"26"}],"author":[{"last_name":"Meer","first_name":"Klaus","full_name":"Meer, Klaus"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"user_id":"15415","title":"An explicit solution to Post's Problem over the reals","language":[{"iso":"eng"}],"page":"3-15","year":"2008","citation":{"short":"K. Meer, M. Ziegler, Journal of Complexity (2008) 3–15.","ieee":"K. Meer and M. Ziegler, “An explicit solution to Post’s Problem over the reals,” Journal of Complexity, pp. 3–15, 2008, doi: 10.1016/j.jco.2006.09.004.","chicago":"Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” Journal of Complexity, 2008, 3–15. https://doi.org/10.1016/j.jco.2006.09.004.","ama":"Meer K, Ziegler M. An explicit solution to Post’s Problem over the reals. Journal of Complexity. Published online 2008:3-15. doi:10.1016/j.jco.2006.09.004","apa":"Meer, K., & Ziegler, M. (2008). An explicit solution to Post’s Problem over the reals. Journal of Complexity, 3–15. https://doi.org/10.1016/j.jco.2006.09.004","mla":"Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” Journal of Complexity, 2008, pp. 3–15, doi:10.1016/j.jco.2006.09.004.","bibtex":"@article{Meer_Ziegler_2008, title={An explicit solution to Post’s Problem over the reals}, DOI={10.1016/j.jco.2006.09.004}, journal={Journal of Complexity}, author={Meer, Klaus and Ziegler, Martin}, year={2008}, pages={3–15} }"},"type":"journal_article","doi":"10.1016/j.jco.2006.09.004","date_updated":"2022-01-06T06:57:18Z","_id":"26280"},{"year":"2008","citation":{"bibtex":"@inproceedings{Suess_Huber_Fischer_Laroque_Dangelmaier_2008, title={A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations}, DOI={10.1109/ispa.2008.30}, booktitle={IEEE International Symposium on Parallel and Distributed Processing with Applications}, author={Suess, Tim and Huber, Daniel and Fischer, Matthias and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2008} }","mla":"Suess, Tim, et al. “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.” IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008, doi:10.1109/ispa.2008.30.","apa":"Suess, T., Huber, D., Fischer, M., Laroque, C., & Dangelmaier, W. (2008). A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations. IEEE International Symposium on Parallel and Distributed Processing with Applications. https://doi.org/10.1109/ispa.2008.30","ama":"Suess T, Huber D, Fischer M, Laroque C, Dangelmaier W. A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations. In: IEEE International Symposium on Parallel and Distributed Processing with Applications. ; 2008. doi:10.1109/ispa.2008.30","chicago":"Suess, Tim, Daniel Huber, Matthias Fischer, Christoph Laroque, and Wilhelm Dangelmaier. “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.” In IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008. https://doi.org/10.1109/ispa.2008.30.","ieee":"T. Suess, D. Huber, M. Fischer, C. Laroque, and W. Dangelmaier, “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations,” 2008, doi: 10.1109/ispa.2008.30.","short":"T. Suess, D. Huber, M. Fischer, C. Laroque, W. Dangelmaier, in: IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008."},"type":"conference","language":[{"iso":"eng"}],"_id":"17416","date_updated":"2022-01-06T06:53:11Z","doi":"10.1109/ispa.2008.30","author":[{"first_name":"Tim","full_name":"Suess, Tim","last_name":"Suess"},{"full_name":"Huber, Daniel","first_name":"Daniel","last_name":"Huber"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"}],"publication":"IEEE International Symposium on Parallel and Distributed Processing with Applications","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9780769534718"]},"status":"public","date_created":"2020-07-27T12:56:15Z","abstract":[{"lang":"eng","text":"In this paper we present a system for the simultaneous visualization of several parallel executed simulation replications. By aggregating the scenes of multiple similar simulations into one single scene it is possible to make a visual statistical analysis of a set of discrete event simulations as well as to easily compare different system parameterizations. The aim of our system is to enhance the model analysis, verification and validation process in terms of speed and ease. The parallel execution of several simulations of complex models and the visualization of these cannot be done on one computer, thus a parallel approach is necessary. Our system uses a thin-client and multiple processors on a PC-cluster. The rendering and the simulation execution are done on processors of the cluster. The client is used only for the visualization of the images transmitted by the cluster and for user interaction.\r\n"}],"title":"A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations","user_id":"15415"},{"language":[{"iso":"eng"}],"type":"book","citation":{"short":"F. Meyer auf der Heide, The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Paderborn, 2008.","ieee":"F. Meyer auf der Heide, The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), vol. 222. Paderborn: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.","chicago":"Meyer auf der Heide, Friedhelm. The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS). Vol. 222. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.","ama":"Meyer auf der Heide F. The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS). Vol 222. Paderborn: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn; 2008.","apa":"Meyer auf der Heide, F. (2008). The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS) (Vol. 222). Paderborn: Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn.","mla":"Meyer auf der Heide, Friedhelm. The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS). Vol. 222, Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, 2008.","bibtex":"@book{Meyer auf der Heide_2008, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS)}, volume={222}, publisher={Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn}, author={Meyer auf der Heide, Friedhelm}, year={2008}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }"},"year":"2008","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_updated":"2022-01-06T06:53:15Z","_id":"17566","intvolume":" 222","date_created":"2020-08-03T14:19:28Z","status":"public","volume":222,"publication_identifier":{"isbn":["ISBN 978-3-939350-41-5"]},"alternative_title":[" Proceedings of the Final Workshop, Barcelona, February 27-28, 2008"],"department":[{"_id":"63"}],"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publisher":"Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn","user_id":"15415","title":"The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS)","place":"Paderborn"},{"language":[{"iso":"eng"}],"page":"2012-2020","type":"conference","citation":{"ieee":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, and T. Suess, “Aggregated 3D-visualization of a distributed simulation experiment of a queuing system,” in 2008 Winter Simulation Conference, 2008, pp. 2012–2020, doi: 10.1109/wsc.2008.4736296.","short":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.","mla":"Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” 2008 Winter Simulation Conference, 2008, pp. 2012–20, doi:10.1109/wsc.2008.4736296.","bibtex":"@inproceedings{Dangelmaier_Fischer_Huber_Laroque_Suess_2008, place={Miami, FL., USA}, title={Aggregated 3D-visualization of a distributed simulation experiment of a queuing system}, DOI={10.1109/wsc.2008.4736296}, booktitle={2008 Winter Simulation Conference}, author={Dangelmaier, Wilhelm and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}, year={2008}, pages={2012–2020} }","chicago":"Dangelmaier, Wilhelm, Matthias Fischer, Daniel Huber, Christoph Laroque, and Tim Suess. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” In 2008 Winter Simulation Conference, 2012–20. Miami, FL., USA, 2008. https://doi.org/10.1109/wsc.2008.4736296.","apa":"Dangelmaier, W., Fischer, M., Huber, D., Laroque, C., & Suess, T. (2008). Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. 2008 Winter Simulation Conference, 2012–2020. https://doi.org/10.1109/wsc.2008.4736296","ama":"Dangelmaier W, Fischer M, Huber D, Laroque C, Suess T. Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. In: 2008 Winter Simulation Conference. ; 2008:2012-2020. doi:10.1109/wsc.2008.4736296"},"year":"2008","date_updated":"2022-01-06T06:53:22Z","_id":"17868","doi":"10.1109/wsc.2008.4736296","department":[{"_id":"63"}],"publication":"2008 Winter Simulation Conference","author":[{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"full_name":"Huber, Daniel","first_name":"Daniel","last_name":"Huber"},{"full_name":"Laroque, Christoph","first_name":"Christoph","last_name":"Laroque"},{"first_name":"Tim","full_name":"Suess, Tim","last_name":"Suess"}],"date_created":"2020-08-12T13:39:37Z","status":"public","publication_identifier":{"isbn":["9781424427079"]},"publication_status":"published","abstract":[{"text":"The paper describes an approach for an aggregated animation of a simulation experiment in an interactive 3D environment, visualizing multiple, distributed simulation runs. Although the general approach of a 3-dimensional visualization of material flow simulation helps to understand the dynamic behavior of a system better as well as faster, it remains unclear, how typical the animated simulation represents the model, if there is a stochastic influence for even some parameters. By the integrated visualization of multiple distributed simulation runs, this uncertainty can be solved, which will be shown in this paper for a typical simulation study of a queuing system. ","lang":"eng"}],"place":"Miami, FL., USA","user_id":"15415","title":"Aggregated 3D-visualization of a distributed simulation experiment of a queuing system"},{"title":"The Kinetic Facility Location Problem","user_id":"15415","publication_status":"published","publication_identifier":{"isbn":["9783540699002","9783540699033"],"issn":["0302-9743","1611-3349"]},"date_created":"2020-09-04T10:04:49Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)","author":[{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"},{"full_name":"Lammersen, Christiane","first_name":"Christiane","last_name":"Lammersen"}],"doi":"10.1007/978-3-540-69903-3_34","date_updated":"2022-01-06T06:53:57Z","_id":"19003","page":"378-389","type":"conference","year":"2008","citation":{"chicago":"Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic Facility Location Problem.” In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 378–89, 2008. https://doi.org/10.1007/978-3-540-69903-3_34.","apa":"Degener, B., Gehweiler, J., & Lammersen, C. (2008). The Kinetic Facility Location Problem. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT) (pp. 378–389). https://doi.org/10.1007/978-3-540-69903-3_34","ama":"Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT). ; 2008:378-389. doi:10.1007/978-3-540-69903-3_34","mla":"Degener, Bastian, et al. “The Kinetic Facility Location Problem.” Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89, doi:10.1007/978-3-540-69903-3_34.","bibtex":"@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility Location Problem}, DOI={10.1007/978-3-540-69903-3_34}, booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}, author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008}, pages={378–389} }","short":"B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.","ieee":"B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389."},"language":[{"iso":"eng"}]}]