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