[{"project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","grant_number":"160364472"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"}],"date_created":"2023-06-12T13:06:58Z","status":"public","department":[{"_id":"63"}],"author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","last_name":"Castenow","id":"38705"}],"user_id":"38705","title":"Local Protocols for Contracting and Expanding Robot Formation Problems","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"citation":{"ieee":"J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems. 2023.","short":"J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.","mla":"Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems. 2023, doi:10.17619/UNIPB/1-1750.","bibtex":"@book{Castenow_2023, title={Local Protocols for Contracting and Expanding Robot Formation Problems}, DOI={10.17619/UNIPB/1-1750}, author={Castenow, Jannik}, year={2023} }","chicago":"Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems, 2023. https://doi.org/10.17619/UNIPB/1-1750.","ama":"Castenow J. Local Protocols for Contracting and Expanding Robot Formation Problems.; 2023. doi:10.17619/UNIPB/1-1750","apa":"Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot Formation Problems. https://doi.org/10.17619/UNIPB/1-1750"},"type":"dissertation","year":"2023","doi":"10.17619/UNIPB/1-1750","date_updated":"2023-06-13T07:43:11Z","_id":"45580"},{"user_id":"39241","title":"Online Algorithms for Allocating Heterogeneous Resources","status":"public","date_created":"2023-06-12T13:05:04Z","project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"}],"author":[{"last_name":"Knollmann","id":"39241","first_name":"Till","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696"}],"department":[{"_id":"63"}],"doi":"10.17619/UNIPB/1-1751","_id":"45579","date_updated":"2023-06-12T21:03:14Z","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"year":"2023","type":"dissertation","citation":{"ieee":"T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources. 2023.","short":"T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.","bibtex":"@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous Resources}, DOI={10.17619/UNIPB/1-1751}, author={Knollmann, Till}, year={2023} }","mla":"Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources. 2023, doi:10.17619/UNIPB/1-1751.","chicago":"Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources, 2023. https://doi.org/10.17619/UNIPB/1-1751.","apa":"Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources. https://doi.org/10.17619/UNIPB/1-1751","ama":"Knollmann T. Online Algorithms for Allocating Heterogeneous Resources.; 2023. doi:10.17619/UNIPB/1-1751"}},{"department":[{"_id":"63"}],"author":[{"last_name":"Pukrop","id":"44428","first_name":"Simon","full_name":"Pukrop, Simon"}],"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)"}],"date_created":"2023-06-27T05:24:19Z","status":"public","title":"On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling","user_id":"15504","year":"2023","type":"dissertation","citation":{"mla":"Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023, doi:10.17619/UNIPB/1-1768 .","bibtex":"@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling}, DOI={10.17619/UNIPB/1-1768 }, author={Pukrop, Simon}, year={2023} }","ama":"Pukrop S. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.; 2023. doi:10.17619/UNIPB/1-1768 ","apa":"Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. https://doi.org/10.17619/UNIPB/1-1768 ","chicago":"Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023. https://doi.org/10.17619/UNIPB/1-1768 .","ieee":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023.","short":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023."},"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"_id":"45781","date_updated":"2023-07-14T09:27:44Z","doi":"10.17619/UNIPB/1-1768 "},{"date_updated":"2023-04-27T15:34:17Z","_id":"44234","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"year":"2021","type":"bachelorsthesis","citation":{"short":"T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.","ieee":"T. F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021.","chicago":"Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.","ama":"Berger TF. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.; 2021.","apa":"Berger, T. F. (2021). Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.","bibtex":"@book{Berger_2021, title={Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation}, author={Berger, Thilo Frederik}, year={2021} }","mla":"Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021."},"user_id":"39241","title":"Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"date_created":"2023-04-27T15:34:07Z","status":"public","department":[{"_id":"63"}],"author":[{"last_name":"Berger","full_name":"Berger, Thilo Frederik","first_name":"Thilo Frederik"}]},{"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"year":"2021","citation":{"mla":"Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms. 2021.","bibtex":"@book{Pranger_2021, title={Online k-Facility Reallocation using k-Server Algorithms}, author={Pranger, Sebastian}, year={2021} }","chicago":"Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms, 2021.","apa":"Pranger, S. (2021). Online k-Facility Reallocation using k-Server Algorithms.","ama":"Pranger S. Online K-Facility Reallocation Using k-Server Algorithms.; 2021.","ieee":"S. Pranger, Online k-Facility Reallocation using k-Server Algorithms. 2021.","short":"S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021."},"type":"bachelorsthesis","date_updated":"2023-04-27T15:31:57Z","_id":"44233","date_created":"2023-04-27T15:31:26Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"status":"public","department":[{"_id":"63"}],"author":[{"last_name":"Pranger","first_name":"Sebastian","full_name":"Pranger, Sebastian"}],"user_id":"39241","title":"Online k-Facility Reallocation using k-Server Algorithms"},{"place":"Universität Paderborn","user_id":"15415","title":"Mobile Resource Allocation","ddc":["000"],"file":[{"file_size":633652,"file_id":"15634","creator":"florida","content_type":"application/pdf","date_updated":"2020-01-24T08:19:38Z","relation":"main_file","success":1,"file_name":"DissertationFeldkord.pdf","date_created":"2020-01-24T08:19:38Z","access_level":"closed"}],"department":[{"_id":"63"}],"file_date_updated":"2020-01-24T08:19:38Z","author":[{"full_name":"Feldkord, Björn","first_name":"Björn","id":"22704","last_name":"Feldkord"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2020-01-23T14:20:25Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:52:31Z","_id":"15631","doi":"10.17619/UNIPB/1-869","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"type":"dissertation","citation":{"short":"B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.","ieee":"B. Feldkord, Mobile Resource Allocation. Universität Paderborn, 2020.","chicago":"Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-869.","ama":"Feldkord B. Mobile Resource Allocation. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-869","apa":"Feldkord, B. (2020). Mobile Resource Allocation. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-869","mla":"Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.","bibtex":"@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={10.17619/UNIPB/1-869}, author={Feldkord, Björn}, year={2020} }"},"year":"2020"},{"date_created":"2020-09-04T07:39:47Z","status":"public","department":[{"_id":"63"}],"author":[{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"}],"title":"Big Data: Sublinear Algorithms for Distributed Data Streams","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-766"}]},"user_id":"15415","place":"Universität Paderborn","citation":{"ieee":"M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019.","short":"M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams, Universität Paderborn, 2019.","mla":"Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.","bibtex":"@book{Malatyali_2019, place={Universität Paderborn}, title={Big Data: Sublinear Algorithms for Distributed Data Streams}, DOI={10.17619/UNIPB/1-766}, author={Malatyali, Manuel}, year={2019} }","chicago":"Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-766.","ama":"Malatyali M. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-766","apa":"Malatyali, M. (2019). Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-766"},"type":"dissertation","year":"2019","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"doi":"10.17619/UNIPB/1-766","date_updated":"2022-01-06T06:53:56Z","_id":"18975"},{"department":[{"_id":"63"}],"author":[{"full_name":"Mäcker, Alexander","first_name":"Alexander","id":"13536","last_name":"Mäcker"}],"date_created":"2019-11-07T14:17:05Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","place":"Universität Paderborn","title":"On Scheduling with Setup Times","ddc":["000"],"user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-828"}]},"citation":{"mla":"Mäcker, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828.","bibtex":"@book{Mäcker_2019, place={Universität Paderborn}, title={On Scheduling with Setup Times}, DOI={10.17619/UNIPB/1-828}, author={Mäcker, Alexander}, year={2019} }","chicago":"Mäcker, Alexander. On Scheduling with Setup Times. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-828.","apa":"Mäcker, A. (2019). On Scheduling with Setup Times. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-828","ama":"Mäcker A. On Scheduling with Setup Times. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-828","ieee":"A. Mäcker, On Scheduling with Setup Times. Universität Paderborn, 2019.","short":"A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019."},"year":"2019","type":"dissertation","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:08Z","_id":"14851","doi":"10.17619/UNIPB/1-828"},{"type":"mastersthesis","year":"2019","citation":{"mla":"Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","bibtex":"@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2019} }","chicago":"Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","apa":"Pukrop, S. (2019). Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn.","ama":"Pukrop S. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn; 2019.","ieee":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","short":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine, Universität Paderborn, 2019."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:37Z","_id":"10344","publisher":"Universität Paderborn","author":[{"last_name":"Pukrop","full_name":"Pukrop, Simon","first_name":"Simon"}],"department":[{"_id":"63"}],"status":"public","date_created":"2019-07-04T07:21:19Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"title":"Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine","user_id":"477"},{"file":[{"relation":"main_file","date_updated":"2021-09-29T12:21:24Z","content_type":"application/pdf","creator":"liedtke","file_id":"25124","file_size":6746519,"access_level":"local","date_created":"2021-09-29T12:21:24Z","file_name":"Bachelor - Thesis.pdf"}],"author":[{"id":"55557","last_name":"Liedtke","full_name":"Liedtke, David Jan","first_name":"David Jan"}],"department":[{"_id":"63"}],"file_date_updated":"2021-09-29T12:21:24Z","has_accepted_license":"1","status":"public","date_created":"2021-09-29T12:30:40Z","abstract":[{"lang":"eng","text":"We consider a group of $n$ autonomous mobile robots of which $m$ are stationary thus cannot move. Robots are represented by points in the Euclidean plane. They have no memory, do not communicate or share a common coordinate system and they move solely based on the positioning of other robots within their limited viewing range of 1. The goal is to gather the robots inside of the convex hull of all stationary robots. A variant of this problem, the general gathering problem, has been studied in various different time models. In this work, we consider a continuous time model, where robots continuously observe their neighbors, compute the next target of movement and move with a speed limit of 1 at any time. Regarding the robots' local strategy, we only study contracting algorithms in which every robot that is positioned on the border of the convex hull of all robots moves into this hull. We present a time bound of $\\mathcal{O}(nd)$ for any general contracting algorithms in a configuration with only a single stationary robot. For configurations with more stationary robots, we prove that robots converge against the convex hull of all stationary robots and that no upper bound on the runtime exists. For the specific contracting algorithms Go-To-The-Left, Go-On-Bisector and Go-To-The-Middle, we provide linear time bounds."}],"user_id":"55557","ddc":["000"],"title":"Influence of Stationary Robots on Continuous Robot Formation Problems","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Liedtke_2018, title={Influence of Stationary Robots on Continuous Robot Formation Problems}, author={Liedtke, David Jan}, year={2018} }","mla":"Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.","ama":"Liedtke DJ. Influence of Stationary Robots on Continuous Robot Formation Problems.; 2018.","apa":"Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot Formation Problems.","chicago":"Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.","ieee":"D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.","short":"D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems, 2018."},"type":"bachelorsthesis","year":"2018","date_updated":"2022-01-06T06:56:52Z","_id":"25121"},{"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2018-11-07T09:20:59Z","publisher":"Universität Paderborn","author":[{"full_name":"Geromel, Marcel","first_name":"Marcel","last_name":"Geromel"}],"department":[{"_id":"63"}],"user_id":"477","title":"Mobile Facility Leasing","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"year":"2018","type":"bachelorsthesis","citation":{"short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","ieee":"M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.","chicago":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.","ama":"Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018.","apa":"Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","mla":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018."},"_id":"5403","date_updated":"2022-01-06T07:01:51Z"},{"title":"Online Algorithmen für das k-Page Migration Problem","user_id":"477","author":[{"last_name":"Kolpaczki","full_name":"Kolpaczki, Patrick Irenäus","first_name":"Patrick Irenäus"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"status":"public","date_created":"2018-11-07T09:23:17Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_updated":"2022-01-06T07:01:51Z","_id":"5404","year":"2018","type":"bachelorsthesis","citation":{"ieee":"P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. Universität Paderborn, 2018.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, 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. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","chicago":"Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","ama":"Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018.","apa":"Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}]},{"abstract":[{"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.","lang":"eng"}],"title":"Local Strategies for Swarm Formations on a Grid","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-271"}]},"user_id":"15415","department":[{"_id":"63"}],"author":[{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"}],"publisher":"Universität Paderborn","publication_identifier":{"isbn":["978-3-942647-99-1"]},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2018-03-13T10:26:16Z","status":"public","date_updated":"2022-01-06T06:51:17Z","_id":"1209","doi":"10.17619/UNIPB/1-271","year":"2018","citation":{"short":"D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018.","ieee":"D. Jung, Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018.","ama":"Jung D. Local Strategies for Swarm Formations on a Grid. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-271","apa":"Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-271","chicago":"Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.","bibtex":"@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid}, DOI={10.17619/UNIPB/1-271}, publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }","mla":"Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-271."},"type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}]},{"related_material":{"link":[{"url":"10.17619/UNIPB/1-252 ","relation":"confirmation"}]},"user_id":"15415","title":"Parallel fixed parameter tractable problems","place":"Universität Paderborn","status":"public","date_created":"2020-09-21T13:52:09Z","author":[{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"}],"department":[{"_id":"63"}],"doi":"10.17619/UNIPB/1-252","_id":"19604","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"}],"year":"2017","citation":{"chicago":"Li, Shouwei. Parallel Fixed Parameter Tractable Problems. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-252.","apa":"Li, S. (2017). Parallel fixed parameter tractable problems. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-252","ama":"Li S. Parallel Fixed Parameter Tractable Problems. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-252","mla":"Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.","bibtex":"@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter tractable problems}, DOI={10.17619/UNIPB/1-252}, author={Li, Shouwei}, year={2017} }","short":"S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017.","ieee":"S. Li, Parallel fixed parameter tractable problems. Universität Paderborn, 2017."},"type":"dissertation"},{"citation":{"short":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017.","ieee":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017.","chicago":"Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-230.","ama":"Podlipyan P. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-230","apa":"Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-230","mla":"Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230.","bibtex":"@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={10.17619/UNIPB/1-230}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }"},"year":"2017","type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"doi":"10.17619/UNIPB/1-230","_id":"703","date_updated":"2022-01-06T07:03:26Z","status":"public","date_created":"2017-11-14T14:13:21Z","author":[{"full_name":"Podlipyan, Pavel","first_name":"Pavel","last_name":"Podlipyan"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"title":"Local Algorithms for the Continuous Gathering Problem","user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-230"}]}},{"doi":"10.17619/UNIPB/1-231","date_updated":"2022-01-06T07:03:27Z","_id":"704","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":{"chicago":"Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-231.","ama":"Riechers S. Scheduling with Scarce Resources. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-231","apa":"Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-231","bibtex":"@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={10.17619/UNIPB/1-231}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }","mla":"Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-231.","short":"S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.","ieee":"S. Riechers, Scheduling with Scarce Resources. Universität Paderborn, 2017."},"year":"2017","user_id":"14052","title":"Scheduling with Scarce Resources","ddc":["000"],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-11-15T07:51:07Z","has_accepted_license":"1","status":"public","file":[{"file_name":"thesisStable.pdf","date_created":"2018-11-14T15:18:37Z","access_level":"closed","file_id":"5673","creator":"feldi","file_size":1491627,"success":1,"relation":"main_file","date_updated":"2018-11-14T15:18:37Z","content_type":"application/pdf"}],"department":[{"_id":"63"}],"file_date_updated":"2018-11-14T15:18:37Z","author":[{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"publisher":"Universität Paderborn"},{"department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"full_name":"Kutzias, Damian","first_name":"Damian","last_name":"Kutzias"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-11-14T06:50:35Z","status":"public","title":"Friendship Processes in Network Creation Games","user_id":"477","type":"mastersthesis","citation":{"ieee":"D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","mla":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","chicago":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","ama":"Kutzias D. Friendship Processes in Network Creation Games. Universität Paderborn; 2016.","apa":"Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn."},"year":"2016","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"_id":"688","date_updated":"2022-01-06T07:03:23Z"},{"department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"id":"30291","last_name":"Schaefer","full_name":"Schaefer, Johannes Sebastian","first_name":"Johannes Sebastian"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-11-14T06:51:37Z","status":"public","title":"Routing Algorithms on Delayed Networks for Disaster Management Support","user_id":"477","year":"2016","citation":{"bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }","mla":"Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","ama":"Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn; 2016.","apa":"Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn.","chicago":"Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","ieee":"J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016."},"type":"mastersthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_updated":"2022-01-06T07:03:23Z","_id":"689"},{"volume":353,"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:22Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"}],"file_date_updated":"2018-03-21T12:52:03Z","file":[{"file_name":"154-dissertation.pdf","date_created":"2018-03-21T12:52:03Z","access_level":"closed","file_size":800101,"file_id":"1551","creator":"florida","date_updated":"2018-03-21T12:52:03Z","content_type":"application/pdf","relation":"main_file","success":1}],"ddc":["040"],"user_id":"5786","citation":{"short":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","ieee":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","chicago":"Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","apa":"Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016.","mla":"Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. 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} }"},"type":"dissertation","year":"2016","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"intvolume":" 353","_id":"154","publication_identifier":{"isbn":["978-3-942647-72-4"]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"26"}],"title":"Selfish Network Creation - On Variants of Network Creation Games","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","date_updated":"2022-01-06T06:52:23Z"},{"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656","relation":"confirmation"}]},"user_id":"15415","ddc":["040"],"title":"Online Resource Leasing","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:44Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file":[{"file_size":1328685,"file_id":"1479","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-21T09:33:41Z","relation":"main_file","success":1,"date_created":"2018-03-21T09:33:41Z","file_name":"267-Dissertation_-_Markarian.pdf","access_level":"closed"}],"publisher":"Universität Paderborn","author":[{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"}],"department":[{"_id":"63"}],"file_date_updated":"2018-03-21T09:33:41Z","date_updated":"2022-01-06T06:57:26Z","_id":"267","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"bibtex":"@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }","mla":"Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015.","chicago":"Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015.","apa":"Markarian, C. (2015). Online Resource Leasing. Universität Paderborn.","ama":"Markarian C. Online Resource Leasing. Universität Paderborn; 2015.","ieee":"C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.","short":"C. Markarian, Online Resource Leasing, Universität Paderborn, 2015."},"year":"2015","type":"dissertation"},{"department":[{"_id":"63"}],"file_date_updated":"2018-03-21T09:20:34Z","publisher":"Universität Paderborn","author":[{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"}],"file":[{"date_created":"2018-03-21T09:20:34Z","file_name":"317-Dissertation_ClaudiusJaehn.pdf","access_level":"closed","file_id":"1462","creator":"florida","file_size":20442332,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-21T09:20:34Z"}],"date_created":"2017-10-17T12:41:53Z","status":"public","has_accepted_license":"1","title":"Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen","ddc":["040"],"user_id":"14052","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} }","mla":"Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.","ama":"Jähn C. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn; 2015.","apa":"Jähn, C. (2015). Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn.","chicago":"Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.","ieee":"C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.","short":"C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität Paderborn, 2015."},"year":"2015","type":"dissertation","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"ger"}],"_id":"317","date_updated":"2022-01-06T06:59:02Z"},{"title":"On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks","ddc":["040"],"user_id":"477","publisher":"Universität Paderborn","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"}],"file_date_updated":"2018-03-21T09:30:02Z","department":[{"_id":"63"}],"file":[{"creator":"florida","file_id":"1476","file_size":448614,"relation":"main_file","success":1,"date_updated":"2018-03-21T09:30:02Z","content_type":"application/pdf","date_created":"2018-03-21T09:30:02Z","file_name":"270-Dissertation_-_Abshoff.pdf","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:44Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"270","date_updated":"2022-01-06T06:57:32Z","type":"dissertation","year":"2015","citation":{"chicago":"Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn, 2015.","apa":"Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn.","ama":"Abshoff S. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn; 2015.","mla":"Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. 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} }","short":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015.","ieee":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn, 2015."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}]},{"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":{"short":"R. Petring, Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit, Universität Paderborn, 2014.","ieee":"R. Petring, Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit. Universität Paderborn, 2014.","chicago":"Petring, Ralf. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit. Universität Paderborn, 2014.","apa":"Petring, R. (2014). Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit. Universität Paderborn.","ama":"Petring R. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit. Universität Paderborn; 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} }","mla":"Petring, Ralf. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit. 2014."},"year":"2014","_id":"19039","date_updated":"2022-01-06T06:53:57Z","author":[{"last_name":"Petring","first_name":"Ralf","full_name":"Petring, Ralf"}],"department":[{"_id":"63"}],"status":"public","date_created":"2020-09-04T13:20:12Z","place":"Universität Paderborn","user_id":"15415","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12816","relation":"confirmation"}]},"title":"Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit"},{"date_updated":"2022-01-06T07:00:52Z","_id":"431","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"year":"2014","citation":{"ieee":"P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn, 2014.","short":"P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn, 2014.","mla":"Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn, 2014.","bibtex":"@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität Paderborn}, author={Kling, Peter}, year={2014} }","chicago":"Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn, 2014.","ama":"Kling P. Energy-Efficient Scheduling Algorithms. Universität Paderborn; 2014.","apa":"Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität Paderborn."},"type":"dissertation","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."}],"user_id":"477","ddc":["040"],"title":"Energy-efficient Scheduling Algorithms","file":[{"creator":"florida","file_id":"1356","file_size":792106,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-16T11:31:29Z","file_name":"431-Peter_Kling_PhDThesis_01.pdf","date_created":"2018-03-16T11:31:29Z","access_level":"closed"}],"file_date_updated":"2018-03-16T11:31:29Z","department":[{"_id":"63"}],"author":[{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:15Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","has_accepted_license":"1"},{"user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12683"}]},"title":"Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes","place":"Universität Paderborn","date_created":"2020-07-29T09:11:23Z","status":"public","department":[{"_id":"63"}],"author":[{"full_name":"Eikel, Benjamin","first_name":"Benjamin","last_name":"Eikel"}],"_id":"17440","date_updated":"2022-01-06T06:53:12Z","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Eikel, Benjamin. Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes. Universität Paderborn, 2013.","ama":"Eikel B. Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes. Universität Paderborn; 2013.","apa":"Eikel, B. (2013). Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes. Universität Paderborn.","mla":"Eikel, Benjamin. Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes. 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} }","short":"B. Eikel, Spherical Visibility Sampling : Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes, Universität Paderborn, 2013.","ieee":"B. Eikel, Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes. Universität Paderborn, 2013."},"year":"2013","type":"dissertation"},{"citation":{"mla":"Pietrzyk, Peter. Local and Online Algorithms for Facility Location. 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} }","apa":"Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location. Universität Paderborn.","ama":"Pietrzyk P. Local and Online Algorithms for Facility Location. Universität Paderborn; 2013.","chicago":"Pietrzyk, Peter. Local and Online Algorithms for Facility Location. Universität Paderborn, 2013.","ieee":"P. Pietrzyk, Local and Online Algorithms for Facility Location. Universität Paderborn, 2013.","short":"P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität Paderborn, 2013."},"type":"dissertation","year":"2013","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-01-06T07:01:38Z","_id":"514","file_date_updated":"2018-03-15T10:44:13Z","department":[{"_id":"63"}],"author":[{"full_name":"Pietrzyk, Peter","first_name":"Peter","last_name":"Pietrzyk"}],"publisher":"Universität Paderborn","file":[{"file_name":"514-DissertationPietrzyk.pdf","date_created":"2018-03-15T10:44:13Z","access_level":"closed","file_size":790821,"creator":"florida","file_id":"1302","content_type":"application/pdf","date_updated":"2018-03-15T10:44:13Z","relation":"main_file","success":1}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:32Z","status":"public","has_accepted_license":"1","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"}],"ddc":["040"],"title":"Local and Online Algorithms for Facility Location","user_id":"477"},{"user_id":"5786","ddc":["040"],"abstract":[{"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.","lang":"eng"}],"date_created":"2017-10-17T12:42:49Z","has_accepted_license":"1","status":"public","volume":302,"file":[{"date_created":"2018-03-15T08:16:44Z","file_name":"601-Kempkes-PhD.pdf","access_level":"closed","file_id":"1252","creator":"florida","file_size":3805310,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T08:16:44Z"}],"file_date_updated":"2018-03-15T08:16:44Z","author":[{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"601","intvolume":" 302","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"citation":{"short":"B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","ieee":"B. Kempkes, Local strategies for robot formation problems, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","chicago":"Kempkes, Barbara. Local Strategies for Robot Formation Problems. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","apa":"Kempkes, B. (2012). Local strategies for robot formation problems (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Kempkes B. Local Strategies for Robot Formation Problems. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012.","mla":"Kempkes, Barbara. Local Strategies for Robot Formation Problems. 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} }"},"year":"2012","type":"dissertation","title":"Local strategies for robot formation problems","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_identifier":{"isbn":["978-3-942647-21-2"]},"department":[{"_id":"63"},{"_id":"26"}],"date_updated":"2022-01-06T07:02:50Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"department":[{"_id":"63"},{"_id":"26"}],"author":[{"last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2020-09-22T09:22:32Z","status":"public","publication_identifier":{"isbn":["978-3-942647-08-3"]},"volume":289,"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007030135"}]},"user_id":"5786","title":"Dynamic Load Balancing in Peer-to-Peer Networks","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"year":"2011","type":"dissertation","citation":{"mla":"Korzeniowski, Miroslaw. Dynamic Load Balancing in Peer-to-Peer Networks. 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} }","chicago":"Korzeniowski, Miroslaw. Dynamic Load Balancing in Peer-to-Peer Networks. Vol. 289. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Korzeniowski M. Dynamic Load Balancing in Peer-to-Peer Networks. Vol 289. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","apa":"Korzeniowski, M. (2011). Dynamic Load Balancing in Peer-to-Peer Networks (Vol. 289). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Korzeniowski, Dynamic Load Balancing in Peer-to-Peer Networks, 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."},"date_updated":"2022-01-06T06:54:08Z","_id":"19619","intvolume":" 289"},{"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20101020011"}]},"user_id":"5786","title":"Power-Aware Online File Allocation in Dynamic Networks","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"first_name":"Jan","full_name":"Mehler, Jan","last_name":"Mehler"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-04T06:58:58Z","publication_identifier":{"isbn":["978-3-942647-06-9"]},"volume":287,"intvolume":" 287","_id":"18974","date_updated":"2022-01-06T06:53:56Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"type":"dissertation","citation":{"ama":"Mehler J. Power-Aware Online File Allocation in Dynamic Networks. Vol 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","apa":"Mehler, J. (2011). Power-Aware Online File Allocation in Dynamic Networks (Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks. Vol. 287. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. 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} }","mla":"Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"year":"2011"},{"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"citation":{"ieee":"S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn, 2011.","short":"S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen, Universität Paderborn, 2011.","bibtex":"@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert, Sascha}, year={2011} }","mla":"Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. 2011.","chicago":"Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. Universität Paderborn, 2011.","apa":"Effert, S. (2011). Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn.","ama":"Effert S. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. Universität Paderborn; 2011."},"year":"2011","type":"dissertation","_id":"19040","date_updated":"2022-01-06T06:53:57Z","department":[{"_id":"63"}],"author":[{"full_name":"Effert, Sascha","first_name":"Sascha","last_name":"Effert"}],"date_created":"2020-09-04T13:31:29Z","status":"public","place":"Universität Paderborn","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385","relation":"confirmation"}]},"user_id":"15415","title":"Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen"},{"department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"first_name":"Kamil","full_name":"Swierkot, Kamil","last_name":"Swierkot"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:43:01Z","status":"public","user_id":"477","title":"Complexity Classes for Local Computation","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"citation":{"short":"K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011.","ieee":"K. Swierkot, Complexity Classes for Local Computation. Universität Paderborn, 2011.","apa":"Swierkot, K. (2011). Complexity Classes for Local Computation. Universität Paderborn.","ama":"Swierkot K. Complexity Classes for Local Computation. Universität Paderborn; 2011.","chicago":"Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","mla":"Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011."},"type":"mastersthesis","year":"2011","_id":"663","date_updated":"2022-01-06T07:03:13Z"},{"date_updated":"2022-01-06T06:53:54Z","_id":"18910","intvolume":" 282","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","type":"dissertation","year":"2010","citation":{"ieee":"M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Bienkowski, Marcin. Page Migration in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","bibtex":"@book{Bienkowski_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Page migration in dynamic networks}, volume={282}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bienkowski, Marcin}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"Bienkowski, Marcin. Page Migration in Dynamic Networks. Vol. 282. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Bienkowski M. Page Migration in Dynamic Networks. Vol 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","apa":"Bienkowski, M. (2010). Page migration in dynamic networks (Vol. 282). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Page migration in dynamic networks","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2005010135"}]},"user_id":"5786","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"}],"department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["978-3-942647-01-4"]},"volume":282,"status":"public","date_created":"2020-09-03T07:52:47Z"},{"author":[{"last_name":"Dynia","first_name":"Miroslaw","full_name":"Dynia, Miroslaw"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"volume":284,"publication_identifier":{"isbn":["978-3-942647-03-8"]},"status":"public","date_created":"2020-09-03T10:21:10Z","title":"Collective graph exploration","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080225031","relation":"confirmation"}]},"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","year":"2010","citation":{"short":"M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Dynia, Miroslaw. Collective Graph Exploration. Vol. 284. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Dynia M. Collective Graph Exploration. Vol 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","apa":"Dynia, M. (2010). Collective graph exploration (Vol. 284). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Dynia_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Collective graph exploration}, volume={284}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dynia, Miroslaw}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Dynia, Miroslaw. Collective Graph Exploration. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:53:54Z","_id":"18927","intvolume":" 284"},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"ieee":"P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","bibtex":"@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann, Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Mahlmann P. Peer-to-Peer Networks Based on Random Graphs. Vol 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","apa":"Mahlmann, P. (2010). Peer-to-peer networks based on random graphs (Vol. 283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Vol. 283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"year":"2010","type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"_id":"19041","date_updated":"2022-01-06T06:53:57Z","intvolume":" 283","author":[{"first_name":"Peter","full_name":"Mahlmann, Peter","last_name":"Mahlmann"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"volume":283,"publication_identifier":{"isbn":["978-3-942647-02-1"]},"status":"public","date_created":"2020-09-04T14:05:30Z","title":"Peer-to-peer networks based on random graphs","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100421015"}]},"user_id":"5786"},{"department":[{"_id":"63"},{"_id":"26"}],"author":[{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":278,"publication_identifier":{"isbn":["978-3-939350-97-2 "]},"date_created":"2020-09-04T14:08:57Z","status":"public","title":"Local, distributed approximation algorithms for geometric assignment problems","user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100429011"}]},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","year":"2010","citation":{"short":"B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"B. Degener, Local, distributed approximation algorithms for geometric assignment problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","apa":"Degener, B. (2010). Local, distributed approximation algorithms for geometric assignment problems (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Degener B. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","bibtex":"@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local, distributed approximation algorithms for geometric assignment problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"type":"dissertation","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"_id":"19042","intvolume":" 278","date_updated":"2022-01-06T06:53:57Z"},{"status":"public","date_created":"2020-09-21T14:07:23Z","volume":261,"author":[{"last_name":"Lürwer-Brüggemeier","first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090212010"}]},"user_id":"5786","title":"Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"type":"dissertation","year":"2009","citation":{"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.","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.","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.","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.","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.","short":"K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":" 261","_id":"19605","date_updated":"2022-01-06T06:54:07Z"},{"_id":"19614","date_updated":"2022-01-06T06:54:08Z","intvolume":" 260","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"citation":{"short":"M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ieee":"M. Mense, On Fault-Tolerant Data Placement in Storage Networks, vol. 260. 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.","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."},"year":"2009","type":"dissertation","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-20090206016","relation":"confirmation"}]},"user_id":"5786","title":"On Fault-Tolerant Data Placement in Storage Networks","status":"public","date_created":"2020-09-22T08:05:15Z","volume":260,"publication_identifier":{"isbn":["978-3-939350-79-8"]},"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Mense","full_name":"Mense, Mario","first_name":"Mario"}],"department":[{"_id":"63"},{"_id":"26"}]},{"type":"dissertation","year":"2009","citation":{"ieee":"M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","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.","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.","ama":"Kortenjan M. Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes. Vol 258. 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."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":" 258","_id":"19617","date_updated":"2022-01-06T06:54:08Z","publication_identifier":{"isbn":["978-3-939350-77-4"]},"volume":258,"date_created":"2020-09-22T08:42:22Z","status":"public","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Kortenjan","first_name":"Michael","full_name":"Kortenjan, Michael"}],"title":"Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20081218010"}]},"user_id":"5786"},{"date_updated":"2022-01-06T06:54:08Z","_id":"19618","intvolume":" 257","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","type":"dissertation","citation":{"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.","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.","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.","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} }","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."},"year":"2009","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"title":"Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip","user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080623016","relation":"confirmation"}]},"department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"}],"volume":257,"publication_identifier":{"isbn":["978-3-939350-76-7"]},"date_created":"2020-09-22T08:44:45Z","status":"public"},{"user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090114013"}]},"title":"Distributed Resource Allocation and Management in Heterogeneous Networks","date_created":"2020-09-22T08:10:41Z","status":"public","publication_identifier":{"isbn":["978-3-939350-78-1"]},"volume":259,"department":[{"_id":"63"},{"_id":"26"}],"author":[{"last_name":"Schomaker","full_name":"Schomaker, Gunnar","first_name":"Gunnar"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":" 259","_id":"19615","date_updated":"2022-01-06T06:54:08Z","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"citation":{"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.","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.","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.","ieee":"G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous Networks, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","short":"G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008."},"year":"2008","type":"dissertation","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"date_updated":"2022-01-06T06:54:08Z","_id":"19612","intvolume":" 186","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Vol. 186. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","apa":"Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Klein J. Efficient Collision Detection for Point and Polygon Based Models. Vol 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","bibtex":"@book{Klein_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Collision Detection for Point and Polygon Based Models}, volume={186}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Klein, Jan}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"J. Klein, Efficient Collision Detection for Point and Polygon Based Models, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ieee":"J. Klein, Efficient Collision Detection for Point and Polygon Based Models, vol. 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."},"type":"dissertation","year":"2006","user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101248"}]},"title":"Efficient Collision Detection for Point and Polygon Based Models","author":[{"full_name":"Klein, Jan","first_name":"Jan","last_name":"Klein"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-22T07:48:45Z","volume":186,"publication_identifier":{"isbn":["3-939350-05-2"]}},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"year":"2006","citation":{"ieee":"S. Rührup, Position-based Routing Strategies, vol. 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"S. Rührup, Position-Based Routing Strategies, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","bibtex":"@book{Rührup_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Position-based Routing Strategies}, volume={203}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Rührup, Stefan}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Rührup, Stefan. Position-Based Routing Strategies. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","chicago":"Rührup, Stefan. Position-Based Routing Strategies. Vol. 203. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","apa":"Rührup, S. (2006). Position-based Routing Strategies (Vol. 203). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Rührup S. Position-Based Routing Strategies. Vol 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006."},"type":"dissertation","intvolume":" 203","_id":"19613","date_updated":"2022-01-06T06:54:08Z","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Rührup","full_name":"Rührup, Stefan","first_name":"Stefan"}],"date_created":"2020-09-22T07:51:17Z","status":"public","publication_identifier":{"isbn":["978-3-939350-22-4"]},"volume":203,"user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301169","relation":"confirmation"}]},"title":"Position-based Routing Strategies"},{"date_updated":"2022-01-06T06:53:56Z","_id":"18972","intvolume":" 190","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","type":"dissertation","year":"2006","citation":{"mla":"Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","bibtex":"@book{Damerow_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Average and Smoothed Complexity of Geometric Structures}, volume={190}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Damerow, Valentina}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures. Vol. 190. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Damerow V. Average and Smoothed Complexity of Geometric Structures. Vol 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","apa":"Damerow, V. (2006). Average and Smoothed Complexity of Geometric Structures (Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"V. Damerow, Average and Smoothed Complexity of Geometric Structures, vol. 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"V. Damerow, Average and Smoothed Complexity of Geometric Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."},"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"title":"Average and Smoothed Complexity of Geometric Structures","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007022210","relation":"confirmation"}]},"user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"}],"publication_identifier":{"isbn":["3-939350-09-5"]},"volume":190,"date_created":"2020-09-04T06:47:03Z","status":"public"},{"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"}],"department":[{"_id":"63"},{"_id":"26"}],"volume":168,"publication_identifier":{"isbn":["3-935433-77-8"]},"status":"public","date_created":"2020-09-22T07:40:37Z","title":"Geometric Spanners for Topology Control in Wireless Networks","user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101556"}]},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"bibtex":"@book{Volbert_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Geometric Spanners for Topology Control in Wireless Networks}, volume={168}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Volbert, Klaus}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","chicago":"Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Vol. 168. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","ama":"Volbert K. Geometric Spanners for Topology Control in Wireless Networks. Vol 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005.","apa":"Volbert, K. (2005). Geometric Spanners for Topology Control in Wireless Networks (Vol. 168). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","short":"K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005."},"year":"2005","type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:54:08Z","_id":"19611","intvolume":" 168"},{"user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20050101109"}]},"title":"Design, analysis, and evaluation of a data structure for distributed virtual environments","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"}],"date_created":"2020-07-27T12:01:54Z","status":"public","volume":164,"publication_identifier":{"isbn":["3-935433-73-5"]},"intvolume":" 164","_id":"17413","date_updated":"2022-01-06T06:53:11Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","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":"2005","citation":{"short":"M. Fischer, Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","ieee":"M. Fischer, Design, analysis, and evaluation of a data structure for distributed virtual environments, vol. 164. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","apa":"Fischer, M. (2005). Design, analysis, and evaluation of a data structure for distributed virtual environments (Vol. 164). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Fischer M. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Vol 164. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005.","chicago":"Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Vol. 164. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","bibtex":"@book{Fischer_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Design, analysis, and evaluation of a data structure for distributed virtual environments}, volume={164}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer, Matthias}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005."}},{"user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20030101262"}]},"title":"Data Management and Routing in General Networks","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-03T14:44:08Z","publication_identifier":{"isbn":["3-935433-63-8"]},"volume":154,"_id":"18967","date_updated":"2022-01-06T06:53:56Z","intvolume":" 154","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Räcke_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Management and Routing in General Networks}, volume={154}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Räcke, Harald}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Räcke, Harald. Data Management and Routing in General Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","chicago":"Räcke, Harald. Data Management and Routing in General Networks. Vol. 154. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","ama":"Räcke H. Data Management and Routing in General Networks. Vol 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005.","apa":"Räcke, H. (2005). Data Management and Routing in General Networks (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"H. Räcke, Data Management and Routing in General Networks, vol. 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","short":"H. Räcke, Data Management and Routing in General Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005."},"year":"2005","type":"dissertation"},{"title":"Data Distribution Algorithms for Storage Networks","user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20040101385","relation":"confirmation"}]},"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"}],"department":[{"_id":"26"},{"_id":"63"}],"volume":153,"publication_identifier":{"isbn":["3-935433-62-X"]},"status":"public","date_created":"2020-09-22T08:37:39Z","_id":"19616","date_updated":"2022-01-06T06:54:08Z","intvolume":" 153","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"short":"K. Salzwedel, Data Distribution Algorithms for Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.","ieee":"K. Salzwedel, Data Distribution Algorithms for Storage Networks, vol. 153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.","apa":"Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Salzwedel K. Data Distribution Algorithms for Storage Networks. Vol 153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2004.","chicago":"Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Vol. 153. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.","bibtex":"@book{Salzwedel_2004, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Distribution Algorithms for Storage Networks}, volume={153}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Salzwedel, Kay}, year={2004}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004."},"type":"dissertation","year":"2004","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}]},{"intvolume":" 119","_id":"18573","date_updated":"2022-01-06T06:53:40Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Sohler, Christian. Property Testing and Geometry. Vol. 119. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","ama":"Sohler C. Property Testing and Geometry. Vol 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003.","apa":"Sohler, C. (2003). Property Testing and Geometry (Vol. 119). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Sohler_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Property Testing and Geometry}, volume={119}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Sohler, Christian}, year={2003}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Sohler, Christian. Property Testing and Geometry. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","short":"C. Sohler, Property Testing and Geometry, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","ieee":"C. Sohler, Property Testing and Geometry, vol. 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003."},"type":"dissertation","year":"2003","user_id":"5786","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101281"}]},"title":"Property Testing and Geometry","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-08-28T13:11:56Z","publication_identifier":{"isbn":["3-935433-28-X"]},"volume":119},{"date_updated":"2022-01-06T06:53:26Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"ger"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101320","relation":"confirmation"}]},"title":"Zur Berechenbarkeit reeller geometrischer Probleme","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-935433-24-7"]},"_id":"18169","intvolume":" 115","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"type":"dissertation","citation":{"short":"M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","ieee":"M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","chicago":"Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","ama":"Ziegler M. Zur Berechenbarkeit reeller geometrischer Probleme. Vol 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002.","apa":"Ziegler, M. (2002). Zur Berechenbarkeit reeller geometrischer Probleme (Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","bibtex":"@book{Ziegler_2002, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Zur Berechenbarkeit reeller geometrischer Probleme}, volume={115}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ziegler, Martin}, year={2002}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"year":"2002","abstract":[{"lang":"ger","text":"Die Implementierung von Algorithmen zur Lösung geometrischer Probleme im Euklidischen Raum (z.B. Berechnung der konvexen Hülle oder des Durchschnitts zweier Polyeder) stellt sich oftmals als hochgradig nichttrivial heraus. Ob und unter welchen Voraussetzungen die verursachenden numerischen Instabilitäten überhaupt ini den Griff zu kriegen oder vielmehr dem Problem inhärent sind, untersucht diese Arbeit in einem auf Turing zurückgehenden Rechenmodell. Im Gegensatz zu algebraischen Ansätzen geht jenes nicht von der Verfügbarkeit exakter Tests auf z.B. Gleichheit reeller Zahlen aus, sondern berücksichtigt die auf Digitalcomputern tatsächlich realisierbare Approximation durch rationale Zahlen. In diesem Rahmen werden beweisbar stabile Algorithmen zum Lösen linearer Gleichungssysteme, zur Matrix-Diagonalisierung und zur linearen wie nichtlinearen Optimierung präsentiert. Als wichtiges technisches Hilfsmittel dient ein neuer Berechenbarkeitsbegriff für reguläre unendliche Mengen reller Zahlen, der sich aus dem systematischen Vergleich verschiedener der Literatur entnommener ad-hoc Ansätze ergibt."},{"text":"Quite often, the implementation of well-known algorithms for solving geometric problems in Euclidean space (such as convex hull computation or intersecting two polyhedra) turns out to be a highly nontrivial task. Whether and under what prerequisites the underlying numerical numerical instabilities can be avoided or are rather inherent to the problem is investigated by the present work in a model of computation dating back to Alan Turing himself. Other than algebraic approaches, this does not rely on (volatile) exact tests for, e.g., equality of real numbers but reflects the property of actual digital computers to only approximate real numbers by rationals. In this framework, we devise and present provably stable algorithms for solving systems of linear equations, matrix diagonalization, and lineare as well as non-linear optimization. As major technical tool, a new notion of computability for regular infinite sets of real numbers is introduced that arises from formalizing and systematically comparing several ad-hoc notions found in previous literature.","lang":"eng"}],"user_id":"5786","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","status":"public","date_created":"2020-08-24T11:36:55Z","volume":115},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"short":"K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","ieee":"K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, vol. 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","ama":"Schröder K. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Vol 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2001.","apa":"Schröder, K. (2001). Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing (Vol. 89). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Vol. 89. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","bibtex":"@book{Schröder_2001, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing}, volume={89}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schröder, Klaus}, year={2001}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001."},"type":"dissertation","year":"2001","_id":"19622","date_updated":"2022-01-06T06:54:08Z","intvolume":" 89","department":[{"_id":"63"},{"_id":"26"}],"author":[{"last_name":"Schröder","first_name":"Klaus","full_name":"Schröder, Klaus"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2020-09-22T10:18:39Z","status":"public","volume":89,"publication_identifier":{"isbn":["3-931466-88-4"]},"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20010101222","relation":"confirmation"}]},"user_id":"5786","title":"Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing"}]