[{"year":"2020","citation":{"mla":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","bibtex":"@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}, publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }","short":"A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020.","apa":"Guggenmos, A. (2020). <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn.","ama":"Guggenmos A. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn; 2020.","chicago":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","ieee":"A. Guggenmos, <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020."},"title":"Algorithmen für selbststabilisierende Skip+-Delaunaygraphen","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:50Z","author":[{"first_name":"Andreas","full_name":"Guggenmos, Andreas","last_name":"Guggenmos"}],"date_created":"2020-08-31T07:14:51Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"18648","user_id":"477","department":[{"_id":"79"}]},{"type":"mastersthesis","status":"public","department":[{"_id":"79"}],"user_id":"477","_id":"15770","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"language":[{"iso":"eng"}],"citation":{"apa":"Warner, D. (2020). <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn.","mla":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","short":"D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.","bibtex":"@book{Warner_2020, title={On the complexity of local transformations in SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020} }","ama":"Warner D. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn; 2020.","chicago":"Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>. Universität Paderborn, 2020.","ieee":"D. Warner, <i>On the complexity of local transformations in SDN overlays</i>. Universität Paderborn, 2020."},"year":"2020","author":[{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2020-02-04T13:47:02Z","date_updated":"2022-01-06T06:52:32Z","publisher":"Universität Paderborn","title":"On the complexity of local transformations in SDN overlays"},{"date_updated":"2022-01-06T06:53:20Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2020-08-11T11:06:28Z","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"title":"Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems","year":"2019","citation":{"apa":"N., N. (2019). <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>.","bibtex":"@book{N._2019, title={Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems}, author={N., N.}, year={2019} }","short":"N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.","mla":"N., N. <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>. 2019.","ama":"N. N. <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>.; 2019.","ieee":"N. N., <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>. 2019.","chicago":"N., N. <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>, 2019."},"_id":"17809","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"title":"Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_created":"2019-06-19T11:31:38Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:33Z","citation":{"short":"N. N., Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves, Universität Paderborn, 2019.","mla":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","apa":"N., N. (2019). <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn.","ieee":"N. N., <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn; 2019."},"year":"2019","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"10271","status":"public","type":"mastersthesis"},{"status":"public","type":"dissertation","_id":"1138","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"477","year":"2018","citation":{"chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>.","ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018.","ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }"},"title":"Distributed Algorithms for Overlay Networks and Programmable Matter","doi":"10.17619/UNIPB/1-265","date_updated":"2022-01-06T06:51:00Z","publisher":"Universität Paderborn","author":[{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"}],"date_created":"2018-01-31T06:04:03Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}]},{"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"18030","user_id":"477","department":[{"_id":"79"}],"status":"public","type":"bachelorsthesis","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"date_created":"2020-08-18T08:44:22Z","year":"2018","citation":{"apa":"N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","bibtex":"@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={N., N.}, year={2018} }","mla":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","short":"N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","ama":"N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018.","chicago":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ieee":"N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018."}},{"user_id":"15504","department":[{"_id":"79"}],"_id":"18031","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"date_created":"2020-08-18T08:45:09Z","date_updated":"2022-01-06T06:53:25Z","title":"Gathering Strategien für mobile Roboterschwärme im Gitternetz","citation":{"ieee":"N. N., <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>. 2018.","chicago":"N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>, 2018.","ama":"N. N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>.; 2018.","apa":"N., N. (2018). <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>.","mla":"N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>. 2018.","short":"N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.","bibtex":"@book{N._2018, title={Gathering Strategien für mobile Roboterschwärme im Gitternetz}, author={N., N.}, year={2018} }"},"year":"2018"},{"title":"Decontaminating Planar Regions with Finite Automaton Robots and Tiles","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2020-08-18T08:45:53Z","date_updated":"2022-01-06T06:53:25Z","citation":{"mla":"N., N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>. 2018.","bibtex":"@book{N._2018, title={Decontaminating Planar Regions with Finite Automaton Robots and Tiles}, author={N., N.}, year={2018} }","short":"N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles, 2018.","apa":"N., N. (2018). <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>.","ama":"N. N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>.; 2018.","ieee":"N. N., <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>. 2018.","chicago":"N., N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>, 2018."},"year":"2018","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"18032","status":"public","type":"bachelorsthesis"},{"language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18033","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","type":"bachelorsthesis","title":"Load-Balanced Routing in Hybriden Kommunikationsnetzwerken","date_created":"2020-08-18T08:46:50Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"full_name":"Wulfes, Robin","last_name":"Wulfes","first_name":"Robin"}],"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","citation":{"short":"R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität Paderborn, 2018.","bibtex":"@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}, publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }","mla":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","apa":"Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn.","ieee":"R. Wulfes, <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","chicago":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","ama":"Wulfes R. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn; 2018."},"year":"2018"},{"year":"2018","citation":{"apa":"Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","short":"M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","mla":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","bibtex":"@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }","ieee":"M. Jochmaring, <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","chicago":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ama":"Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","author":[{"last_name":"Jochmaring","full_name":"Jochmaring, Moritz","first_name":"Moritz"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2018-11-06T06:21:37Z","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","type":"bachelorsthesis","status":"public","_id":"5368","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}]},{"type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"18026","user_id":"477","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"year":"2017","citation":{"apa":"Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn.","mla":"Burkhardt, Michél. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","bibtex":"@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität Paderborn}, author={Burkhardt, Michél }, year={2017} }","short":"M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.","ieee":"M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","chicago":"Burkhardt, Michél . <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","ama":"Burkhardt M. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn; 2017."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","author":[{"first_name":"Michél ","full_name":"Burkhardt, Michél ","last_name":"Burkhardt"}],"date_created":"2020-08-18T08:39:19Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Untersuchungen zum Cone-Hashing"},{"year":"2017","citation":{"ama":"Banh NC. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017.","ieee":"N. C. Banh, <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017.","chicago":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","apa":"Banh, N. C. (2017). <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn.","short":"N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","mla":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","bibtex":"@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017} }"},"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","date_created":"2020-08-18T08:40:19Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"Ngoc Chi","full_name":"Banh, Ngoc Chi","last_name":"Banh"}],"title":"An Asynchronous Adaption of a Churn-resistant Overlay Network","type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"18027","user_id":"477","department":[{"_id":"79"}],"language":[{"iso":"eng"}]},{"citation":{"ieee":"A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","chicago":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","ama":"Schenk A. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn; 2017.","short":"A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen, Universität Paderborn, 2017.","bibtex":"@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas}, year={2017} }","mla":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","apa":"Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn."},"year":"2017","title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","date_created":"2020-08-18T08:41:42Z","author":[{"first_name":"Andreas","full_name":"Schenk, Andreas","last_name":"Schenk"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18028","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"citation":{"ama":"Beckendorf B. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn; 2017.","ieee":"B. Beckendorf, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","chicago":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","apa":"Beckendorf, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn.","short":"B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017.","bibtex":"@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn}, year={2017} }","mla":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017."},"year":"2017","title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"first_name":"Björn","full_name":"Beckendorf, Björn","last_name":"Beckendorf"}],"date_created":"2020-08-18T08:42:36Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18029","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"81","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2017-10-17T12:41:07Z","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:50Z","title":"MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained","citation":{"short":"L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained, Universität Paderborn, 2017.","mla":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.","bibtex":"@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2017} }","apa":"Luo, L. (2017). <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained</i>. Universität Paderborn.","ieee":"L. Luo, <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained</i>. Universität Paderborn, 2017.","chicago":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.","ama":"Luo L. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn; 2017."},"year":"2017"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:52Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Thim Frederik","id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann"}],"date_created":"2017-10-17T12:41:03Z","title":"Self-* Algorithms for Distributed Systems","doi":"10.17619/UNIPB/1-150","year":"2017","citation":{"apa":"Strothmann, T. F. (2017). <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>","bibtex":"@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017} }","mla":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>.","short":"T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn, 2017.","ama":"Strothmann TF. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>","ieee":"T. F. Strothmann, <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017.","chicago":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>."},"_id":"61","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"type":"mastersthesis","status":"public","user_id":"38705","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"699","language":[{"iso":"eng"}],"citation":{"short":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.","bibtex":"@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2017} }","mla":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","apa":"Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn.","ama":"Sundermeier J. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn; 2017.","chicago":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","ieee":"J. Sundermeier, <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017."},"year":"2017","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2017-11-14T08:03:45Z","author":[{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:25Z","title":"Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions"},{"language":[{"iso":"eng"}],"_id":"700","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"477","status":"public","type":"mastersthesis","title":"A Self-Stabilizing Protocol for Graphs of Diameter Two","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:26Z","date_created":"2017-11-14T08:04:35Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"Till","full_name":"Knollmann, Till","last_name":"Knollmann"}],"year":"2017","citation":{"apa":"Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn.","bibtex":"@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017} }","mla":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","short":"T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität Paderborn, 2017.","chicago":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","ieee":"T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","ama":"Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn; 2017."}},{"date_updated":"2022-01-06T07:03:26Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Thorsten","full_name":"Götte, Thorsten","id":"34727","last_name":"Götte"}],"date_created":"2017-11-14T09:32:39Z","title":"Self-Stabilizing Spanners for Tree Metrics","year":"2017","citation":{"ama":"Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn; 2017.","ieee":"T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","chicago":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","bibtex":"@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2017} }","mla":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","short":"T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn, 2017.","apa":"Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn."},"_id":"701","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"title":"Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem","date_updated":"2022-01-06T06:53:25Z","author":[{"last_name":"Heuchler","full_name":"Heuchler, Sebastian","first_name":"Sebastian"}],"date_created":"2020-08-18T08:38:22Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"year":"2016","citation":{"chicago":"Heuchler, Sebastian. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>, 2016.","ieee":"S. Heuchler, <i>Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem</i>. 2016.","ama":"Heuchler S. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>.; 2016.","apa":"Heuchler, S. (2016). <i>Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem</i>.","short":"S. Heuchler, Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.","bibtex":"@book{Heuchler_2016, title={Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem}, author={Heuchler, Sebastian}, year={2016} }","mla":"Heuchler, Sebastian. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>. 2016."},"language":[{"iso":"eng"}],"_id":"18025","department":[{"_id":"79"}],"user_id":"15504","status":"public","type":"bachelorsthesis"}]