[{"year":"2018","citation":{"apa":"N., N. (2018). <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>.","short":"N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles, 2018.","bibtex":"@book{N._2018, title={Decontaminating Planar Regions with Finite Automaton Robots and Tiles}, author={N., N.}, year={2018} }","mla":"N., N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>. 2018.","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."},"date_updated":"2022-01-06T06:53:25Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"date_created":"2020-08-18T08:45:53Z","title":"Decontaminating Planar Regions with Finite Automaton Robots and Tiles","type":"bachelorsthesis","status":"public","_id":"18032","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}]},{"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"18033","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"last_name":"Wulfes","full_name":"Wulfes, Robin","first_name":"Robin"}],"date_created":"2020-08-18T08:46:50Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"Load-Balanced Routing in Hybriden Kommunikationsnetzwerken","citation":{"apa":"Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn.","mla":"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.","bibtex":"@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}, publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }","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"},{"date_updated":"2022-01-06T07:02:38Z","publisher":"Springer International Publishing","date_created":"2018-11-19T15:35:45Z","author":[{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"},{"full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann"}],"title":"Forming Tile Shapes with Simple Robots","doi":"10.1007/978-3-030-00030-1_8","publication_status":"published","year":"2018","page":"122-138","citation":{"apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., &#38; Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i> (pp. 122–138). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">https://doi.org/10.1007/978-3-030-00030-1_8</a>","mla":"Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>, Springer International Publishing, 2018, pp. 122–38, doi:<a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">10.1007/978-3-030-00030-1_8</a>.","bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018, title={Forming Tile Shapes with Simple Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">10.1007/978-3-030-00030-1_8</a>}, booktitle={Proceedings of the 24th International Conference on DNA Computing and Molecular Programming}, publisher={Springer International Publishing}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={122–138} }","short":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–138.","ieee":"R. Gmyr <i>et al.</i>, “Forming Tile Shapes with Simple Robots,” in <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>, 2018, pp. 122–138.","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes with Simple Robots.” In <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>, 122–38. Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">https://doi.org/10.1007/978-3-030-00030-1_8</a>.","ama":"Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple Robots. In: <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>. Springer International Publishing; 2018:122-138. doi:<a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">10.1007/978-3-030-00030-1_8</a>"},"_id":"5764","department":[{"_id":"79"},{"_id":"66"}],"user_id":"11319","language":[{"iso":"eng"}],"publication":"Proceedings of the 24th International Conference on DNA Computing and Molecular Programming","type":"conference","status":"public"},{"year":"2018","citation":{"bibtex":"@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander} }","mla":"Blömer, Johannes, et al. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","apa":"Blömer, J., Bobolz, J., Scheideler, C., &#38; Setzer, A. (n.d.). <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>, n.d.","ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>. .","ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>."},"has_accepted_license":"1","publication_status":"draft","title":"Provably Anonymous Communication Based on Trusted Execution Environments","date_updated":"2022-01-06T07:02:43Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Jan","id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer","first_name":"Alexander"}],"date_created":"2018-11-25T08:08:40Z","abstract":[{"lang":"eng","text":"In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.\r\nFor this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.\r\nIn our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. \r\nOur techniques are very general and can be used as a basis for future constructions with similar goals."}],"status":"public","file":[{"file_name":"draft-2018.pdf","access_level":"closed","file_id":"6435","file_size":470968,"creator":"jbobolz","date_created":"2018-12-31T09:55:30Z","date_updated":"2018-12-31T09:55:30Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"type":"working_paper","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-12-31T09:55:30Z","_id":"5820","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"user_id":"27207"},{"status":"public","type":"journal_article","alternative_title":["Special Issue of SIROCCO 2015"],"file_date_updated":"2019-01-11T10:20:16Z","user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"5984","citation":{"apa":"Scheideler, C. (2018). Preface. <i>Theor. Comput. Sci.</i>, <i>751</i>, 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>","short":"C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.","bibtex":"@article{Scheideler_2018, title={Preface}, volume={751}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }","mla":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i>, vol. 751, 2018, p. 1, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>.","ama":"Scheideler C. Preface. <i>Theor Comput Sci</i>. 2018;751:1. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>","chicago":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i> 751 (2018): 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>.","ieee":"C. Scheideler, “Preface,” <i>Theor. Comput. Sci.</i>, vol. 751, p. 1, 2018."},"intvolume":"       751","page":"1","has_accepted_license":"1","doi":"10.1016/j.tcs.2018.11.004","author":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"volume":751,"date_updated":"2022-01-06T07:02:49Z","file":[{"access_level":"closed","file_name":"Preface.pdf","file_id":"6620","file_size":112676,"date_created":"2019-01-11T10:20:16Z","creator":"florida","date_updated":"2019-01-11T10:20:16Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Theor. Comput. Sci.","language":[{"iso":"eng"}],"ddc":["040"],"year":"2018","title":"Preface","date_created":"2018-11-30T08:08:23Z"},{"file_date_updated":"2018-12-12T15:12:02Z","language":[{"iso":"eng"}],"ddc":["004"],"department":[{"_id":"79"}],"user_id":"477","_id":"5985","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"status":"public","file":[{"date_updated":"2018-12-12T15:12:02Z","date_created":"2018-12-12T15:12:02Z","creator":"ups","file_size":1420210,"file_name":"p1-scheideler.pdf","file_id":"6194","access_level":"closed","content_type":"application/pdf","relation":"main_file"}],"publication":"Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018","type":"conference","doi":"10.1145/3229774.3229781","title":"Relays: Towards a Link Layer for Robust and Secure Fog Computing","author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-11-30T08:11:27Z","date_updated":"2022-01-06T07:02:49Z","page":"1-2","citation":{"short":"C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2.","bibtex":"@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for Robust and Secure Fog Computing}, DOI={<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>}, booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }","mla":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>, 2018, pp. 1–2, doi:<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>.","apa":"Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. In <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i> (pp. 1–2). <a href=\"https://doi.org/10.1145/3229774.3229781\">https://doi.org/10.1145/3229774.3229781</a>","ieee":"C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,” in <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>, 2018, pp. 1–2.","chicago":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” In <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>, 1–2, 2018. <a href=\"https://doi.org/10.1145/3229774.3229781\">https://doi.org/10.1145/3229774.3229781</a>.","ama":"Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing. In: <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>. ; 2018:1-2. doi:<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>"},"year":"2018","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"_id":"5986","department":[{"_id":"79"}],"user_id":"15504","status":"public","publication":"43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK","type":"conference","title":"Shape Recognition by a Finite Automaton Robot","doi":"10.4230/LIPIcs.MFCS.2018.52","date_updated":"2022-01-06T07:02:49Z","date_created":"2018-11-30T08:13:58Z","author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Kristian","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","id":"32229"},{"first_name":"Irina","full_name":"Kostitsyna, Irina","last_name":"Kostitsyna"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"},{"full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"year":"2018","page":"52:1-52:15","citation":{"ama":"Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape Recognition by a Finite Automaton Robot. In: <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>. ; 2018:52:1-52:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">10.4230/LIPIcs.MFCS.2018.52</a>","ieee":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler, “Shape Recognition by a Finite Automaton Robot,” in <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>, 2018, pp. 52:1-52:15.","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.” In <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>, 52:1-52:15, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">https://doi.org/10.4230/LIPIcs.MFCS.2018.52</a>.","bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018, title={Shape Recognition by a Finite Automaton Robot}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">10.4230/LIPIcs.MFCS.2018.52</a>}, booktitle={43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}, year={2018}, pages={52:1-52:15} }","mla":"Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>, 2018, pp. 52:1-52:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">10.4230/LIPIcs.MFCS.2018.52</a>.","short":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, in: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., &#38; Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i> (pp. 52:1-52:15). <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">https://doi.org/10.4230/LIPIcs.MFCS.2018.52</a>"}},{"year":"2018","date_created":"2018-09-17T13:12:18Z","publisher":"Springer, Cham","title":"A Self-Stabilizing Hashed Patricia Trie","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5277","access_level":"closed","file_name":"ASelf-stabilizingHashedPatrici.pdf","file_size":500005,"date_created":"2018-11-02T14:38:37Z","creator":"ups","date_updated":"2018-11-02T14:38:37Z"}],"abstract":[{"text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.","lang":"eng"}],"external_id":{"arxiv":["1809.04923"]},"language":[{"iso":"eng"}],"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"ddc":["000"],"has_accepted_license":"1","intvolume":"     11201","citation":{"ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>.","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.","apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>"},"volume":11201,"author":[{"first_name":"Till","id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T07:01:02Z","conference":{"end_date":"2018-11-07","location":"Tokyo","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2018-11-04"},"doi":"10.1007/978-3-030-03232-6_1","type":"conference","status":"public","editor":[{"first_name":"Taisuke","full_name":"Izumi, Taisuke","last_name":"Izumi"},{"first_name":"Petr","full_name":"Kuznetsov, Petr","last_name":"Kuznetsov"}],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"39241","series_title":"Lecture Notes of Computer Science","_id":"4411","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2018-11-02T14:38:37Z"},{"has_accepted_license":"1","year":"2018","citation":{"apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Helsinki: Springer.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Springer, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer; 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Helsinki, 2018."},"publisher":"Springer","date_updated":"2022-01-06T07:01:11Z","author":[{"first_name":"Daniel","full_name":"Jung, Daniel","id":"37827","last_name":"Jung"},{"first_name":"Christina","last_name":"Kolb","id":"43647","full_name":"Kolb, Christina"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"date_created":"2018-10-02T07:06:05Z","title":"Competitive Routing in Hybrid Communication Networks","conference":{"start_date":"2018-08-23","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","location":"Helsinki","end_date":"2018-08-24"},"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","type":"conference","abstract":[{"lang":"eng","text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n"}],"status":"public","file":[{"date_created":"2019-01-11T10:32:38Z","creator":"ups","date_updated":"2019-01-11T10:32:38Z","access_level":"closed","file_name":"23hybrid.pdf","file_id":"6621","file_size":349034,"content_type":"application/pdf","relation":"main_file","success":1}],"_id":"4563","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"38705","keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"ddc":["000"],"file_date_updated":"2019-01-11T10:32:38Z","language":[{"iso":"eng"}]},{"date_created":"2018-10-02T07:34:47Z","author":[{"last_name":"Jung","full_name":"Jung, Daniel","id":"37827","first_name":"Daniel"},{"full_name":"Kolb, Christina","id":"43647","last_name":"Kolb","first_name":"Christina"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Jannik","full_name":"Sundermeier, Jannik","id":"38705","last_name":"Sundermeier"}],"publisher":"ACM Press","date_updated":"2022-01-06T07:01:12Z","doi":"10.1145/3210377.3210663","conference":{"start_date":"2018-07-17","name":"SPAA'18","location":"Wien","end_date":"2018-07-18"},"title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781450357999"]},"citation":{"ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>.","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>"},"year":"2018","user_id":"38705","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4565","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:48:10Z","ddc":["000"],"type":"conference","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T13:48:10Z","creator":"ups","date_updated":"2018-11-02T13:48:10Z","file_id":"5254","access_level":"closed","file_name":"p231-jung-1.pdf","file_size":1025077}],"status":"public"},{"abstract":[{"lang":"eng","text":"\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic searchability provides guarantees when searching for nodes while the recovery process is going on.\r\n\tMore precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively.\r\n\tThe latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.\r\n\tWe propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur protocol can easily be extended to higher dimensions and offers routing in $\\mathcal O(\\log n)$ hops for any search request.\r\n"}],"file":[{"date_created":"2018-10-31T13:24:17Z","creator":"mfeldma2","date_updated":"2018-10-31T13:24:17Z","access_level":"closed","file_id":"5210","file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf","file_size":329823,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","ddc":["040"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1808.10300"]},"year":"2018","title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","publisher":"Springer, Cham","date_created":"2018-09-04T14:15:39Z","status":"public","type":"conference","file_date_updated":"2018-10-31T13:24:17Z","_id":"4351","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"23538","page":"16-31 ","intvolume":"     11201","citation":{"ama":"Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>","chicago":"Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>.","ieee":"M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2018, vol. 11201, pp. 16–31.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31}, collection={Lecture Notes in Computer Science} }","short":"M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>.","apa":"Feldmann, M., Kolb, C., &#38; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201, pp. 16–31). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>"},"has_accepted_license":"1","publication_identifier":{"unknown":["978-3-030-03231-9"]},"doi":"10.1007/978-3-030-03232-6_2","date_updated":"2022-01-06T07:00:58Z","volume":11201,"author":[{"first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael","id":"23538"},{"first_name":"Christina","full_name":"Kolb, Christina","id":"43647","last_name":"Kolb"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}]},{"type":"conference","publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","file_id":"5863","access_level":"closed","file_size":1122875,"creator":"tillk","date_created":"2018-11-27T10:03:33Z","date_updated":"2018-11-27T10:03:33Z"}],"status":"public","abstract":[{"text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe  network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.","lang":"eng"}],"user_id":"14955","department":[{"_id":"63"},{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4375","file_date_updated":"2018-11-27T10:03:33Z","language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"has_accepted_license":"1","citation":{"apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>","bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>"},"year":"2018","author":[{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"},{"last_name":"Sundermeier","full_name":"Sundermeier, Jannik","id":"38705","first_name":"Jannik"}],"date_created":"2018-09-11T05:26:59Z","date_updated":"2022-01-06T07:01:00Z","doi":"10.1007/978-3-030-19759-9_4","conference":{"end_date":"2018-08-21","location":"Helsinki","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","start_date":"2018-08-20"},"title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension"},{"type":"conference","status":"public","department":[{"_id":"79"}],"user_id":"11108","_id":"5216","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"file_date_updated":"2018-10-31T16:09:48Z","has_accepted_license":"1","publication_status":"published","citation":{"ieee":"C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018.","chicago":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">https://doi.org/10.1007/978-3-030-03232-6_16</a>.","ama":"Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>","bibtex":"@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian and Setzer, Alexander}, year={2018} }","short":"C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.","mla":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>.","apa":"Scheideler, C., &#38; Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. Tokyo, Japan. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">https://doi.org/10.1007/978-3-030-03232-6_16</a>"},"author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander"}],"date_updated":"2022-01-06T07:01:47Z","doi":"10.1007/978-3-030-03232-6_16","conference":{"location":"Tokyo, Japan","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)"},"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","file":[{"file_size":369818,"file_name":"Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf","access_level":"closed","file_id":"5223","date_updated":"2018-10-31T16:09:48Z","date_created":"2018-10-31T15:51:45Z","creator":"asetzer","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests."}],"language":[{"iso":"eng"}],"ddc":["040"],"year":"2018","date_created":"2018-10-31T13:33:05Z","title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks"},{"citation":{"chicago":"Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.","ieee":"T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018, vol. 11201, pp. 50–64.","ama":"Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64.","short":"T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64.","bibtex":"@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64}, collection={Lecture Notes in Computer Science} }","mla":"Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, vol. 11201, Springer, 2018, pp. 50–64.","apa":"Götte, T., Scheideler, C., &#38; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i> (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer."},"intvolume":"     11201","page":"50-64","has_accepted_license":"1","conference":{"name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","location":"Tokyo, Japan"},"author":[{"last_name":"Götte","full_name":"Götte, Thorsten","id":"34727","first_name":"Thorsten"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"}],"volume":11201,"date_updated":"2022-01-06T07:01:47Z","status":"public","type":"conference","file_date_updated":"2018-10-31T15:59:26Z","user_id":"477","series_title":"Lecture Notes in Computer Science","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"5222","year":"2018","title":"On Underlay-Aware Self-Stabilizing Overlay Networks","date_created":"2018-10-31T15:44:30Z","publisher":"Springer","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"thgoette","date_created":"2018-10-31T15:59:26Z","date_updated":"2018-10-31T15:59:26Z","file_name":"sss18_camera.pdf","file_id":"5224","access_level":"closed","file_size":367812}],"abstract":[{"lang":"eng","text":"We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. "}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","language":[{"iso":"eng"}],"ddc":["040"]},{"type":"bachelorsthesis","status":"public","_id":"5368","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2018","citation":{"ama":"Jochmaring M. <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.","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.","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} }","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."},"date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","author":[{"first_name":"Moritz","last_name":"Jochmaring","full_name":"Jochmaring, Moritz"}],"supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-11-06T06:21:37Z","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten"},{"_id":"3872","user_id":"15504","department":[{"_id":"79"}],"type":"journal_article","publication":"Distributed Computing","abstract":[{"text":"This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.","lang":"eng"}],"status":"public","publisher":"Springer Nature","date_updated":"2022-01-06T06:59:47Z","date_created":"2018-08-10T07:05:12Z","author":[{"first_name":"Adrian","full_name":"Ogierman, Adrian","last_name":"Ogierman"},{"first_name":"Andrea","last_name":"Richa","full_name":"Richa, Andrea"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"volume":31,"title":"Sade: competitive MAC under adversarial SINR","doi":"10.1007/s00446-017-0307-1","publication_status":"published","publication_identifier":{"issn":["0178-2770","1432-0452"]},"issue":"3","year":"2017","citation":{"apa":"Ogierman, A., Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. <i>Distributed Computing</i>, <i>31</i>(3), 241–254. <a href=\"https://doi.org/10.1007/s00446-017-0307-1\">https://doi.org/10.1007/s00446-017-0307-1</a>","bibtex":"@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive MAC under adversarial SINR}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>}, number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2017}, pages={241–254} }","short":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing 31 (2017) 241–254.","mla":"Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” <i>Distributed Computing</i>, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>.","ama":"Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC under adversarial SINR. <i>Distributed Computing</i>. 2017;31(3):241-254. doi:<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>","ieee":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive MAC under adversarial SINR,” <i>Distributed Computing</i>, vol. 31, no. 3, pp. 241–254, 2017.","chicago":"Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” <i>Distributed Computing</i> 31, no. 3 (2017): 241–54. <a href=\"https://doi.org/10.1007/s00446-017-0307-1\">https://doi.org/10.1007/s00446-017-0307-1</a>."},"page":"241-254","intvolume":"        31"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"18026","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2020-08-18T08:39:19Z","author":[{"last_name":"Burkhardt","full_name":"Burkhardt, Michél ","first_name":"Michél "}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"Untersuchungen zum Cone-Hashing","citation":{"chicago":"Burkhardt, Michél . <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","ieee":"M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","ama":"Burkhardt M. <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} }","short":"M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.","apa":"Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn."},"year":"2017"},{"citation":{"ama":"Banh NC. <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.","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.","short":"N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, 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} }","mla":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017."},"year":"2017","author":[{"last_name":"Banh","full_name":"Banh, Ngoc Chi","first_name":"Ngoc Chi"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2020-08-18T08:40:19Z","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"An Asynchronous Adaption of a Churn-resistant Overlay Network","type":"bachelorsthesis","status":"public","department":[{"_id":"79"}],"user_id":"477","_id":"18027","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"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.","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} }","apa":"Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn."},"year":"2017","date_created":"2020-08-18T08:41:42Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"full_name":"Schenk, Andreas","last_name":"Schenk","first_name":"Andreas"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","type":"bachelorsthesis","status":"public","department":[{"_id":"79"}],"user_id":"477","_id":"18028","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}]},{"title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"full_name":"Beckendorf, Björn","last_name":"Beckendorf","first_name":"Björn"}],"date_created":"2020-08-18T08:42:36Z","year":"2017","citation":{"bibtex":"@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn}, year={2017} }","short":"B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017.","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.","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.","ieee":"B. Beckendorf, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017."},"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"18029","user_id":"477","department":[{"_id":"79"}],"status":"public","type":"bachelorsthesis"}]