[{"department":[{"_id":"63"}],"type":"bachelorsthesis","date_created":"2018-11-07T09:20:59Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"ama":"Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","mla":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","chicago":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","apa":"Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.","ieee":"M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018."},"user_id":"477","_id":"5403","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:51Z","author":[{"last_name":"Geromel","first_name":"Marcel","full_name":"Geromel, Marcel"}],"status":"public","title":"Mobile Facility Leasing","year":"2018"},{"department":[{"_id":"63"}],"type":"bachelorsthesis","date_created":"2018-11-07T09:23:17Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"chicago":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","apa":"Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn.","ieee":"P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn, 2018.","ama":"Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn; 2018.","bibtex":"@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }","mla":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018."},"user_id":"477","_id":"5404","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","author":[{"full_name":"Kolpaczki, Patrick Irenäus","last_name":"Kolpaczki","first_name":"Patrick Irenäus"}],"status":"public","year":"2018","title":"Online Algorithmen für das k-Page Migration Problem"},{"date_created":"2018-03-13T10:26:16Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"chicago":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>.","ama":"Jung D. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>","short":"D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018.","bibtex":"@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>}, publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }","mla":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>.","apa":"Jung, D. (2018). <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>","ieee":"D. Jung, <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018."},"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - Subproject A1"}],"abstract":[{"lang":"eng","text":"My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors."}],"related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-271"}]},"_id":"1209","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-271","user_id":"1112","publication_identifier":{"isbn":["978-3-942647-99-1"]},"author":[{"full_name":"Jung, Daniel","first_name":"Daniel","last_name":"Jung","id":"37827"}],"year":"2018","status":"public","title":"Local Strategies for Swarm Formations on a Grid","date_updated":"2024-07-12T12:05:00Z"},{"date_created":"2020-09-21T13:52:09Z","place":"Universität Paderborn","type":"dissertation","department":[{"_id":"63"}],"citation":{"bibtex":"@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter tractable problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>}, author={Li, Shouwei}, year={2017} }","ama":"Li S. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>","mla":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>.","short":"S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017.","chicago":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>.","ieee":"S. Li, <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn, 2017.","apa":"Li, S. (2017). <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>"},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"related_material":{"link":[{"url":"10.17619/UNIPB/1-252 ","relation":"confirmation"}]},"_id":"19604","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.17619/UNIPB/1-252","title":"Parallel fixed parameter tractable problems","status":"public","year":"2017","author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"}],"date_updated":"2022-01-06T06:54:07Z"},{"type":"dissertation","department":[{"_id":"63"}],"date_created":"2017-11-14T14:13:21Z","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-230"}]},"citation":{"ama":"Podlipyan P. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>","bibtex":"@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }","mla":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>.","chicago":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>.","short":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017.","apa":"Podlipyan, P. (2017). <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>","ieee":"P. Podlipyan, <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"user_id":"15415","doi":"10.17619/UNIPB/1-230","_id":"703","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:26Z","year":"2017","status":"public","title":"Local Algorithms for the Continuous Gathering Problem","author":[{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}]},{"ddc":["000"],"doi":"10.17619/UNIPB/1-231","user_id":"14052","_id":"704","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T07:03:27Z","author":[{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"year":"2017","title":"Scheduling with Scarce Resources","status":"public","department":[{"_id":"63"}],"type":"dissertation","date_created":"2017-11-15T07:51:07Z","file":[{"file_size":1491627,"access_level":"closed","file_name":"thesisStable.pdf","date_updated":"2018-11-14T15:18:37Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5673","creator":"feldi","date_created":"2018-11-14T15:18:37Z"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"apa":"Riechers, S. (2017). <i>Scheduling with Scarce Resources</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>","ieee":"S. Riechers, <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017.","short":"S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.","chicago":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>.","mla":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>.","ama":"Riechers S. <i>Scheduling with Scarce Resources</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>","bibtex":"@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }"},"file_date_updated":"2018-11-14T15:18:37Z"},{"user_id":"477","publisher":"Universität Paderborn","_id":"688","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:23Z","author":[{"full_name":"Kutzias, Damian","first_name":"Damian","last_name":"Kutzias"}],"title":"Friendship Processes in Network Creation Games","year":"2016","status":"public","department":[{"_id":"63"}],"type":"mastersthesis","date_created":"2017-11-14T06:50:35Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"ama":"Kutzias D. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn; 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","mla":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","chicago":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","apa":"Kutzias, D. (2016). <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn.","ieee":"D. Kutzias, <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016."}},{"citation":{"ieee":"J. S. Schaefer, <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","apa":"Schaefer, J. S. (2016). <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn.","chicago":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016.","mla":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }","ama":"Schaefer JS. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn; 2016."},"supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-11-14T06:51:37Z","type":"mastersthesis","department":[{"_id":"63"}],"status":"public","title":"Routing Algorithms on Delayed Networks for Disaster Management Support","year":"2016","author":[{"first_name":"Johannes Sebastian","last_name":"Schaefer","full_name":"Schaefer, Johannes Sebastian","id":"30291"}],"date_updated":"2022-01-06T07:03:23Z","_id":"689","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"ieee":"A. Cord-Landwehr, <i>Selfish Network Creation - On Variants of Network Creation Games</i>, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","apa":"Cord-Landwehr, A. (2016). <i>Selfish Network Creation - On Variants of Network Creation Games</i> (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","short":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","mla":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","bibtex":"@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Cord-Landwehr A. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016."},"supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"file_date_updated":"2018-03-21T12:52:03Z","volume":353,"user_id":"5786","ddc":["040"],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"154","has_accepted_license":"1","status":"public","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","date_created":"2017-10-17T12:41:22Z","file":[{"creator":"florida","date_created":"2018-03-21T12:52:03Z","relation":"main_file","date_updated":"2018-03-21T12:52:03Z","file_name":"154-dissertation.pdf","access_level":"closed","file_size":800101,"file_id":"1551","content_type":"application/pdf","success":1}],"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089"}]},"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":"       353","date_updated":"2022-01-06T06:52:23Z","author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"}],"publication_identifier":{"isbn":["978-3-942647-72-4"]},"year":"2016","title":"Selfish Network Creation - On Variants of Network Creation Games"},{"author":[{"id":"37612","full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian"}],"year":"2015","title":"Online Resource Leasing","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:57:26Z","_id":"267","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","ddc":["040"],"user_id":"15415","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"mla":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","ama":"Markarian C. <i>Online Resource Leasing</i>. Universität Paderborn; 2015.","bibtex":"@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }","apa":"Markarian, C. (2015). <i>Online Resource Leasing</i>. Universität Paderborn.","ieee":"C. Markarian, <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","chicago":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","short":"C. Markarian, Online Resource Leasing, Universität Paderborn, 2015."},"file_date_updated":"2018-03-21T09:33:41Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656","relation":"confirmation"}]},"date_created":"2017-10-17T12:41:44Z","file":[{"date_created":"2018-03-21T09:33:41Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1479","access_level":"closed","file_size":1328685,"file_name":"267-Dissertation_-_Markarian.pdf","date_updated":"2018-03-21T09:33:41Z","relation":"main_file"}],"department":[{"_id":"63"}],"type":"dissertation"},{"year":"2015","status":"public","title":"Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen","author":[{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"}],"date_updated":"2022-01-06T06:59:02Z","has_accepted_license":"1","_id":"317","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"14052","ddc":["040"],"file_date_updated":"2018-03-21T09:20:34Z","citation":{"bibtex":"@book{Jähn_2015, title={Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen}, publisher={Universität Paderborn}, author={Jähn, Claudius}, year={2015} }","chicago":"Jähn, Claudius. <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn, 2015.","short":"C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität Paderborn, 2015.","ama":"Jähn C. <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn; 2015.","ieee":"C. Jähn, <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn, 2015.","apa":"Jähn, C. (2015). <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn.","mla":"Jähn, Claudius. <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn, 2015."},"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"file":[{"creator":"florida","date_created":"2018-03-21T09:20:34Z","date_updated":"2018-03-21T09:20:34Z","relation":"main_file","file_size":20442332,"access_level":"closed","file_name":"317-Dissertation_ClaudiusJaehn.pdf","success":1,"content_type":"application/pdf","file_id":"1462"}],"date_created":"2017-10-17T12:41:53Z","type":"dissertation","department":[{"_id":"63"}]},{"date_created":"2017-10-17T12:41:44Z","file":[{"date_created":"2018-03-21T09:30:02Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1476","access_level":"closed","file_size":448614,"file_name":"270-Dissertation_-_Abshoff.pdf","date_updated":"2018-03-21T09:30:02Z","relation":"main_file"}],"department":[{"_id":"63"}],"type":"dissertation","citation":{"ieee":"S. Abshoff, <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn, 2015.","apa":"Abshoff, S. (2015). <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn.","short":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015.","chicago":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","mla":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","bibtex":"@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff, Sebastian}, year={2015} }","ama":"Abshoff S. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn; 2015."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"file_date_updated":"2018-03-21T09:30:02Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"270","publisher":"Universität Paderborn","user_id":"477","ddc":["040"],"author":[{"last_name":"Abshoff","first_name":"Sebastian","full_name":"Abshoff, Sebastian"}],"year":"2015","status":"public","title":"On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks","has_accepted_license":"1","date_updated":"2022-01-06T06:57:32Z"},{"date_created":"2020-09-04T13:20:12Z","place":"Universität Paderborn","department":[{"_id":"63"}],"type":"dissertation","citation":{"ieee":"R. Petring, <i>Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn, 2014.","apa":"Petring, R. (2014). <i>Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn.","chicago":"Petring, Ralf. <i>Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn, 2014.","short":"R. Petring, Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit, Universität Paderborn, 2014.","mla":"Petring, Ralf. <i>Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit</i>. 2014.","bibtex":"@book{Petring_2014, place={Universität Paderborn}, title={Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit}, author={Petring, Ralf}, year={2014} }","ama":"Petring R. <i>Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn; 2014."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12816","relation":"confirmation"}]},"language":[{"iso":"eng"}],"_id":"19039","user_id":"15415","author":[{"first_name":"Ralf","last_name":"Petring","full_name":"Petring, Ralf"}],"year":"2014","status":"public","title":"Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit","date_updated":"2022-01-06T06:53:57Z"},{"citation":{"apa":"Kling, P. (2014). <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn.","ieee":"P. Kling, <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","chicago":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","short":"P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn, 2014.","mla":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","ama":"Kling P. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn; 2014.","bibtex":"@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität Paderborn}, author={Kling, Peter}, year={2014} }"},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"file_date_updated":"2018-03-16T11:31:29Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"lang":"eng","text":"In meiner Dissertation besch{\\\"a}ftige ich mich mit dem Entwurf und der Analyse energieeffizienter Schedulingalgorithmen, insbesondere f{\\\"u}r sogenannte Speed-Scaling Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW! und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\\\"u}ckzuf{\\\"u}hren. Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\\\"o}ße fristgerecht abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch des Prozessors wird durch eine konvexe Funktion $\\POW\\colon\\R_{\\geq0}\\to\\R_{\\geq0}$ modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine Dissertation betrachtet verschiedene Varianten des urspr{\\\"u}nglichen Speed-Scaling Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden und erstrecken sich {\\\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel 3 und 4 betrachten verschiedene \\emph{Price-Collecting} Varianten des Originalproblems. Hier d{\\\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\\\"a}ngige Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen Forschungsfragen in diesem Gebiet dar. F{\\\"u}r eine relaxierte Form dieser Frage entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\\\"a}t.- Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht direkt zur Speed-Scaling Literatur z{\\\"a}hlt. Hier geht es stattdessen um ein allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\\\"a}t des Problems und entwerfe verschiedene Approximationsalgorithmen."}],"date_created":"2017-10-17T12:42:15Z","file":[{"date_created":"2018-03-16T11:31:29Z","creator":"florida","file_id":"1356","content_type":"application/pdf","success":1,"file_name":"431-Peter_Kling_PhDThesis_01.pdf","file_size":792106,"access_level":"closed","relation":"main_file","date_updated":"2018-03-16T11:31:29Z"}],"department":[{"_id":"63"}],"type":"dissertation","author":[{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"}],"status":"public","title":"Energy-efficient Scheduling Algorithms","year":"2014","has_accepted_license":"1","date_updated":"2022-01-06T07:00:52Z","publisher":"Universität Paderborn","_id":"431","user_id":"477","ddc":["040"]},{"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12683"}]},"citation":{"mla":"Eikel, Benjamin. <i>Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes</i>. 2013.","ama":"Eikel B. <i>Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes</i>. Universität Paderborn; 2013.","bibtex":"@book{Eikel_2013, place={Universität Paderborn}, title={Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes}, author={Eikel, Benjamin}, year={2013} }","apa":"Eikel, B. (2013). <i>Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes</i>. Universität Paderborn.","ieee":"B. Eikel, <i>Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes</i>. Universität Paderborn, 2013.","chicago":"Eikel, Benjamin. <i>Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes</i>. Universität Paderborn, 2013.","short":"B. Eikel, Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes, Universität Paderborn, 2013."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"type":"dissertation","department":[{"_id":"63"}],"date_created":"2020-07-29T09:11:23Z","place":"Universität Paderborn","date_updated":"2022-01-06T06:53:12Z","title":"Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes","year":"2013","status":"public","author":[{"full_name":"Eikel, Benjamin","first_name":"Benjamin","last_name":"Eikel"}],"user_id":"15415","_id":"17440","language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"type":"dissertation","date_created":"2017-10-17T12:42:32Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1302","date_updated":"2018-03-15T10:44:13Z","relation":"main_file","access_level":"closed","file_size":790821,"file_name":"514-DissertationPietrzyk.pdf","date_created":"2018-03-15T10:44:13Z","creator":"florida"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"abstract":[{"text":"Diese Arbeit besch{\\\"a}ftigt sich mit dem Facility Location Problem. Dies ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen Ressourcen zur Verf{\\\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht werden k{\\\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin, dass man einerseits m{\\\"o}glichst wenige Ressourcen zur Verf{\\\"u}gung stellen m{\\\"o}chte, andererseits daf{\\\"u}r sorgen muss, dass sich Nutzer nicht all zu weit weg von Ressourcen befinden. Dies w{\\\"u}rde n{\\\"a}mlich hohe Verbindungskosten nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten des Problems modelliert und neue Algorithmen f{\\\"u}r sie entwickelt und bez{\\\"u}glich ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist, sondern Schritt f{\\\"u}r Schritt enth{\\\"u}llt wird. Die Schwierigkeit hierbei besteht darin unwiderrufliche Entscheidungen treffen zu m{\\\"u}ssen ohne dabei die Zukunft zu kennen und trotzdem eine zu jeder Zeit gute L{\\\"o}sung angeben zu k{\\\"o}nnen. Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\\\"a}t, die z.B. in Sensornetzwerken von großer Bedeutung ist. Hier soll eine L{\\\"o}sung verteilt und nur mit Hilfe von lokalen Information berechnet werden. Schließlich besch{\\\"a}ftigt sich die dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\\\"a}nkte Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der Kompetitivit{\\\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\\\"a}tzung der primalen L{\\\"o}sung mit Hilfe einer L{\\\"o}sung des zugeh{\\\"o}rigen dualen Problems. F{\\\"u}r die Modellierung von Lokalit{\\\"a}t wird das weitverbreitete LOCAL Modell verwendet. In diesem Modell werden f{\\\"u}r die Algorithmen subpolynomielle obere Laufzeitschranken gezeigt.","lang":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"mla":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","bibtex":"@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location}, publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }","ama":"Pietrzyk P. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn; 2013.","ieee":"P. Pietrzyk, <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","apa":"Pietrzyk, P. (2013). <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn.","chicago":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","short":"P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität Paderborn, 2013."},"file_date_updated":"2018-03-15T10:44:13Z","ddc":["040"],"user_id":"477","_id":"514","publisher":"Universität Paderborn","has_accepted_license":"1","date_updated":"2022-01-06T07:01:38Z","author":[{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"}],"year":"2013","title":"Local and Online Algorithms for Facility Location","status":"public"},{"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"601","volume":302,"ddc":["040"],"user_id":"5786","status":"public","has_accepted_license":"1","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"ama":"Kempkes B. <i>Local Strategies for Robot Formation Problems</i>. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012.","bibtex":"@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local strategies for robot formation problems}, volume={302}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes, Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","chicago":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","short":"B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","apa":"Kempkes, B. (2012). <i>Local strategies for robot formation problems</i> (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Kempkes, <i>Local strategies for robot formation problems</i>, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012."},"file_date_updated":"2018-03-15T08:16:44Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-942647-21-2"]},"author":[{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"}],"year":"2012","title":"Local strategies for robot formation problems","intvolume":"       302","date_updated":"2022-01-06T07:02:50Z","date_created":"2017-10-17T12:42:49Z","file":[{"creator":"florida","date_created":"2018-03-15T08:16:44Z","relation":"main_file","date_updated":"2018-03-15T08:16:44Z","file_name":"601-Kempkes-PhD.pdf","access_level":"closed","file_size":3805310,"file_id":"1252","content_type":"application/pdf","success":1}],"department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","abstract":[{"lang":"eng","text":"Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\\\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\\\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\\\"o}nnen. Daf{\\\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\\\"u}r die ben{\\\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\\\"a}llen wird außerdem die ben{\\\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\\\"o}tigen w{\\\"u}rde. So werden kompetititve Faktoren hergeleitet."}]},{"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007030135"}]},"citation":{"mla":"Korzeniowski, Miroslaw. <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Korzeniowski M. <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>. Vol 289. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","bibtex":"@book{Korzeniowski_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Dynamic Load Balancing in Peer-to-Peer Networks}, volume={289}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Korzeniowski, Miroslaw}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Korzeniowski, M. (2011). <i>Dynamic Load Balancing in Peer-to-Peer Networks</i> (Vol. 289). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Korzeniowski, <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>, vol. 289. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"M. Korzeniowski, Dynamic Load Balancing in Peer-to-Peer Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","chicago":"Korzeniowski, Miroslaw. <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>. Vol. 289. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-22T09:22:32Z","date_updated":"2022-01-06T06:54:08Z","intvolume":"       289","status":"public","year":"2011","title":"Dynamic Load Balancing in Peer-to-Peer Networks","author":[{"full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw","last_name":"Korzeniowski"}],"publication_identifier":{"isbn":["978-3-942647-08-3"]},"user_id":"5786","volume":289,"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19619","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"ieee":"J. Mehler, <i>Power-Aware Online File Allocation in Dynamic Networks</i>, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","apa":"Mehler, J. (2011). <i>Power-Aware Online File Allocation in Dynamic Networks</i> (Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","short":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","chicago":"Mehler, Jan. <i>Power-Aware Online File Allocation in Dynamic Networks</i>. Vol. 287. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","mla":"Mehler, Jan. <i>Power-Aware Online File Allocation in Dynamic Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Mehler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Power-Aware Online File Allocation in Dynamic Networks}, volume={287}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mehler, Jan}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Mehler J. <i>Power-Aware Online File Allocation in Dynamic Networks</i>. Vol 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011."},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20101020011","relation":"confirmation"}]},"date_created":"2020-09-04T06:58:58Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","author":[{"full_name":"Mehler, Jan","last_name":"Mehler","first_name":"Jan"}],"publication_identifier":{"isbn":["978-3-942647-06-9"]},"title":"Power-Aware Online File Allocation in Dynamic Networks","status":"public","year":"2011","intvolume":"       287","date_updated":"2022-01-06T06:53:56Z","_id":"18974","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"volume":287,"user_id":"5786"},{"user_id":"15415","language":[{"iso":"eng"}],"_id":"19040","date_updated":"2022-01-06T06:53:57Z","year":"2011","status":"public","title":"Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen","author":[{"full_name":"Effert, Sascha","last_name":"Effert","first_name":"Sascha"}],"type":"dissertation","department":[{"_id":"63"}],"place":"Universität Paderborn","date_created":"2020-09-04T13:31:29Z","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385"}]},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"ieee":"S. Effert, <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn, 2011.","apa":"Effert, S. (2011). <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn.","chicago":"Effert, Sascha. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn, 2011.","short":"S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen, Universität Paderborn, 2011.","mla":"Effert, Sascha. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. 2011.","bibtex":"@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert, Sascha}, year={2011} }","ama":"Effert S. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn; 2011."}}]