[{"publisher":"Elsevier","date_updated":"2022-01-06T06:59:08Z","date_created":"2017-10-17T12:41:55Z","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"title":"A deterministic worst-case message complexity optimal solution for resource discovery","doi":"10.1016/j.tcs.2014.11.027","has_accepted_license":"1","year":"2015","citation":{"ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>. 2015:67-79. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, 2015, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” <i>Theoretical Computer Science</i>, pp. 67–79, 2015.","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, Elsevier, 2015, pp. 67–79, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>"},"page":"67-79","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"327","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:38:02Z","type":"journal_article","publication":"Theoretical Computer Science","abstract":[{"text":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.","lang":"eng"}],"file":[{"creator":"florida","date_created":"2018-03-20T07:38:02Z","date_updated":"2018-03-20T07:38:02Z","file_id":"1427","access_level":"closed","file_name":"327-KKS15-TOCS_01.pdf","file_size":398044,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public"},{"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"}],"date_created":"2017-10-17T12:41:51Z","date_updated":"2022-01-06T06:58:53Z","publisher":"Universität Paderborn","title":"Dynamics and Efficiency in Topological Self-Stabilization","has_accepted_license":"1","citation":{"short":"A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization, Universität Paderborn, 2015.","mla":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","bibtex":"@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos, Andreas}, year={2015} }","apa":"Koutsopoulos, A. (2015). <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn.","ama":"Koutsopoulos A. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn; 2015.","chicago":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"A. Koutsopoulos, <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015."},"year":"2015","user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"304","file_date_updated":"2018-03-20T07:46:19Z","ddc":["040"],"type":"dissertation","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":2275834,"access_level":"closed","file_id":"1441","file_name":"304-Dissertation_-_Koutsopoulos.pdf","date_updated":"2018-03-20T07:46:19Z","date_created":"2018-03-20T07:46:19Z","creator":"florida"}],"status":"public"},{"citation":{"apa":"Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn.","short":"S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015.","bibtex":"@book{Kniesburges_2015, title={Distributed Data Structures and the Power of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges, Sebastian}, year={2015} }","mla":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ama":"Kniesburges S. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn; 2015.","chicago":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"S. Kniesburges, <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn, 2015."},"year":"2015","has_accepted_license":"1","title":"Distributed Data Structures and the Power of topological Self-Stabilization","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"}],"date_created":"2017-10-17T12:41:51Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:54Z","file":[{"file_size":1709094,"file_name":"305-Dissertation_-_Kniesburges.pdf","file_id":"1206","access_level":"closed","date_updated":"2018-03-13T09:14:43Z","date_created":"2018-03-13T09:14:43Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"dissertation","file_date_updated":"2018-03-13T09:14:43Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"305"},{"title":"Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:41:46Z","author":[{"last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael","first_name":"Michael"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:45Z","citation":{"chicago":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","ieee":"M. Feldmann, <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","ama":"Feldmann M. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn; 2015.","apa":"Feldmann, M. (2015). <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn.","mla":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","bibtex":"@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann, Michael}, year={2015} }","short":"M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs, Universität Paderborn, 2015."},"year":"2015","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"278","status":"public","type":"mastersthesis"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","date_created":"2020-08-17T08:18:04Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"last_name":"Götte","full_name":"Götte, Thorsten","id":"34727","first_name":"Thorsten"}],"title":"Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot","year":"2015","citation":{"ieee":"T. Götte, <i>Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","chicago":"Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","ama":"Götte T. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn; 2015.","mla":"Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","bibtex":"@book{Götte_2015, title={Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2015} }","short":"T. Götte, Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot, Universität Paderborn, 2015.","apa":"Götte, T. (2015). <i>Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn."},"_id":"18003","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"}],"type":"bachelorsthesis","status":"public"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"18004","department":[{"_id":"79"}],"user_id":"15504","year":"2015","citation":{"short":"D. Isenberg, 3D-Nesting in Der SLM-Technologie, 2015.","bibtex":"@book{Isenberg_2015, title={3D-Nesting in der SLM-Technologie}, author={Isenberg, Daniel}, year={2015} }","mla":"Isenberg, Daniel. <i>3D-Nesting in Der SLM-Technologie</i>. 2015.","apa":"Isenberg, D. (2015). <i>3D-Nesting in der SLM-Technologie</i>.","ama":"Isenberg D. <i>3D-Nesting in Der SLM-Technologie</i>.; 2015.","chicago":"Isenberg, Daniel. <i>3D-Nesting in Der SLM-Technologie</i>, 2015.","ieee":"D. Isenberg, <i>3D-Nesting in der SLM-Technologie</i>. 2015."},"title":"3D-Nesting in der SLM-Technologie","date_updated":"2022-01-06T06:53:25Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"full_name":"Isenberg, Daniel","last_name":"Isenberg","first_name":"Daniel"}],"date_created":"2020-08-17T08:18:44Z"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"18005","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","author":[{"first_name":"Christian","last_name":"Korfmacher","full_name":"Korfmacher, Christian"}],"date_created":"2020-08-17T08:19:47Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"Implementierung und Analyse von Cone-DHT","citation":{"apa":"Korfmacher, C. (2015). <i>Implementierung und Analyse von Cone-DHT</i>. Universität Paderborn.","mla":"Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","bibtex":"@book{Korfmacher_2015, title={Implementierung und Analyse von Cone-DHT}, publisher={Universität Paderborn}, author={Korfmacher, Christian}, year={2015} }","short":"C. Korfmacher, Implementierung Und Analyse von Cone-DHT, Universität Paderborn, 2015.","chicago":"Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","ieee":"C. Korfmacher, <i>Implementierung und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","ama":"Korfmacher C. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn; 2015."},"year":"2015"},{"language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18006","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","type":"bachelorsthesis","title":"Implementierung eines selbststabilisierenden verteilten Stacks","date_created":"2020-08-17T08:20:59Z","author":[{"id":"38705","full_name":"Sundermeier, Jannik","last_name":"Sundermeier","first_name":"Jannik"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","citation":{"ieee":"J. Sundermeier, <i>Implementierung eines selbststabilisierenden verteilten Stacks</i>. Universität Paderborn, 2015.","chicago":"Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>. Universität Paderborn, 2015.","ama":"Sundermeier J. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>. Universität Paderborn; 2015.","bibtex":"@book{Sundermeier_2015, title={Implementierung eines selbststabilisierenden verteilten Stacks}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2015} }","mla":"Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>. Universität Paderborn, 2015.","short":"J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks, Universität Paderborn, 2015.","apa":"Sundermeier, J. (2015). <i>Implementierung eines selbststabilisierenden verteilten Stacks</i>. Universität Paderborn."},"year":"2015"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"18024","user_id":"477","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"Till","id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696"}],"date_created":"2020-08-18T08:37:33Z","title":"Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix","year":"2015","citation":{"bibtex":"@book{Knollmann_2015, title={Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2015} }","short":"T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.","mla":"Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015.","apa":"Knollmann, T. (2015). <i>Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix</i>. Universität Paderborn.","ama":"Knollmann T. <i>Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn; 2015.","ieee":"T. Knollmann, <i>Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix</i>. Universität Paderborn, 2015.","chicago":"Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015."}},{"year":"2015","citation":{"short":"Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015, pp. 117--132.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015, series={Lecture Notes in Computer Science}, title={Leader Election and Shape Formation with Self-organizing Programmable Matter}, volume={9211}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">10.1007/978-3-319-21999-8_8</a>}, booktitle={DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian}, year={2015}, pages={117--132}, collection={Lecture Notes in Computer Science} }","mla":"Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.” <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>, vol. 9211, 2015, pp. 117--132, doi:<a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">10.1007/978-3-319-21999-8_8</a>.","apa":"Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &#38; Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. In <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i> (Vol. 9211, pp. 117--132). <a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">https://doi.org/10.1007/978-3-319-21999-8_8</a>","ama":"Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler C. Leader Election and Shape Formation with Self-organizing Programmable Matter. In: <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>. Vol 9211. Lecture Notes in Computer Science. ; 2015:117--132. doi:<a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">10.1007/978-3-319-21999-8_8</a>","ieee":"Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and C. Scheideler, “Leader Election and Shape Formation with Self-organizing Programmable Matter,” in <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>, 2015, vol. 9211, pp. 117--132.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi, Andrea W. Richa, and Christian Scheideler. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.” In <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>, 9211:117--132. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">https://doi.org/10.1007/978-3-319-21999-8_8</a>."},"page":"117--132","intvolume":"      9211","publication_identifier":{"isbn":["978-3-319-21998-1"]},"title":"Leader Election and Shape Formation with Self-organizing Programmable Matter","doi":"10.1007/978-3-319-21999-8_8","date_updated":"2022-01-06T06:53:36Z","author":[{"first_name":"Zahra","last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann"},{"full_name":"A. Bazzi, Rida","last_name":"A. Bazzi","first_name":"Rida"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2018-03-28T05:49:12Z","volume":9211,"status":"public","type":"conference","publication":"DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings","language":[{"iso":"eng"}],"_id":"1850","series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"79"}]},{"language":[{"iso":"eng"}],"_id":"1851","department":[{"_id":"79"}],"user_id":"15504","status":"public","publication":"Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015","type":"conference","title":"An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems","doi":"10.1145/2800795.2800829","date_updated":"2022-01-06T06:53:36Z","publisher":"ACM","date_created":"2018-03-28T05:50:25Z","author":[{"full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh","first_name":"Zahra"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann"}],"year":"2015","page":"21:1--21:2","citation":{"mla":"Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.” <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>, ACM, 2015, pp. 21:1--21:2, doi:<a href=\"https://doi.org/10.1145/2800795.2800829\">10.1145/2800795.2800829</a>.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2015, title={An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems}, DOI={<a href=\"https://doi.org/10.1145/2800795.2800829\">10.1145/2800795.2800829</a>}, booktitle={Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={21:1--21:2} }","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2.","apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i> (pp. 21:1--21:2). ACM. <a href=\"https://doi.org/10.1145/2800795.2800829\">https://doi.org/10.1145/2800795.2800829</a>","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In: <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>. ACM; 2015:21:1--21:2. doi:<a href=\"https://doi.org/10.1145/2800795.2800829\">10.1145/2800795.2800829</a>","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.” In <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>, 21:1--21:2. ACM, 2015. <a href=\"https://doi.org/10.1145/2800795.2800829\">https://doi.org/10.1145/2800795.2800829</a>.","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems,” in <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>, 2015, pp. 21:1--21:2."},"publication_identifier":{"isbn":["978-1-4503-3674-1"]}},{"language":[{"iso":"eng"}],"_id":"1852","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"conference","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\'{a}}n, Spain, July 21 - 23, 2015","title":"Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter","doi":"10.1145/2767386.2767451","publisher":"ACM","date_updated":"2022-01-06T06:53:36Z","author":[{"first_name":"Zahra","last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"first_name":"Thim Frederik","id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann"},{"first_name":"Rida","last_name":"A. Bazzi","full_name":"A. Bazzi, Rida"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-28T05:52:44Z","year":"2015","citation":{"apa":"Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &#38; Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i> (pp. 67--69). ACM. <a href=\"https://doi.org/10.1145/2767386.2767451\">https://doi.org/10.1145/2767386.2767451</a>","short":"Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69.","mla":"Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, ACM, 2015, pp. 67--69, doi:<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015, title={Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian}, year={2015}, pages={67--69} }","ieee":"Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and C. Scheideler, “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, 2015, pp. 67--69.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi, Andrea W. Richa, and Christian Scheideler. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, 67--69. ACM, 2015. <a href=\"https://doi.org/10.1145/2767386.2767451\">https://doi.org/10.1145/2767386.2767451</a>.","ama":"Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler C. Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>. ACM; 2015:67--69. doi:<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>"},"page":"67--69","publication_identifier":{"isbn":["978-1-4503-3617-8"]}},{"publication_identifier":{"isbn":["978-1-4503-3588-1"]},"year":"2015","page":"77--79","citation":{"chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, 77--79. ACM, 2015. <a href=\"https://doi.org/10.1145/2755573.2755614\">https://doi.org/10.1145/2755573.2755614</a>.","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, 2015, pp. 77--79.","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>. ACM; 2015:77--79. doi:<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>","mla":"Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, ACM, 2015, pp. 77--79, doi:<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>.","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79.","bibtex":"@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, title={Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>}, booktitle={Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015}, publisher={ACM}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={77--79} }","apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i> (pp. 77--79). ACM. <a href=\"https://doi.org/10.1145/2755573.2755614\">https://doi.org/10.1145/2755573.2755614</a>"},"date_updated":"2022-01-06T06:53:36Z","publisher":"ACM","author":[{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann","first_name":"Thim Frederik"}],"date_created":"2018-03-28T05:57:20Z","title":"Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks","doi":"10.1145/2755573.2755614","publication":"Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015","type":"conference","status":"public","_id":"1853","department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["978-3-319-25257-5"]},"citation":{"chicago":"Scheideler, Christian, ed. <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-25258-2\">https://doi.org/10.1007/978-3-319-25258-2</a>.","ieee":"C. Scheideler, Ed., <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. 2015.","ama":"Scheideler C, ed. <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>.; 2015. doi:<a href=\"https://doi.org/10.1007/978-3-319-25258-2\">10.1007/978-3-319-25258-2</a>","mla":"Scheideler, Christian, editor. <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. 2015, doi:<a href=\"https://doi.org/10.1007/978-3-319-25258-2\">10.1007/978-3-319-25258-2</a>.","bibtex":"@book{Scheideler_2015, series={Lecture Notes in Computer Science}, title={Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-25258-2\">10.1007/978-3-319-25258-2</a>}, year={2015}, collection={Lecture Notes in Computer Science} }","short":"C. Scheideler, ed., Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings, 2015.","apa":"Scheideler, C. (Ed.). (2015). <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. <a href=\"https://doi.org/10.1007/978-3-319-25258-2\">https://doi.org/10.1007/978-3-319-25258-2</a>"},"year":"2015","date_created":"2018-03-28T06:09:00Z","date_updated":"2022-01-06T06:53:36Z","doi":"10.1007/978-3-319-25258-2","title":"Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings","type":"conference_editor","status":"public","editor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"79"}],"_id":"1854"},{"publication":"Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)","type":"conference","status":"public","file":[{"creator":"florida","date_created":"2018-03-20T07:18:12Z","date_updated":"2018-03-20T07:18:12Z","file_id":"1404","access_level":"closed","file_name":"367-cts_conf.pdf","file_size":647997,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"Online social networks are attracting billions of nowadays, both on a global scale as well as in social enterprise networks. Using distributed hash tables and peer-to-peer technology allows online social networks to be operated securely and efficiently only by using the resources of the user devices, thus alleviating censorship or data misuse by a single network operator. In this paper, we address the challenges that arise in implementing reliably and conveniently to use distributed data structures, such as lists or sets, in such a distributed hash-tablebased online social network. We present a secure, distributed list data structure that manages the list entries in several buckets in the distributed hash table. The list entries are authenticated, integrity is maintained and access control for single users and also groups is integrated. The approach for secure distributed lists is also applied for prefix trees and sets, and implemented and evaluated in a peer-to-peer framework for social networks. Evaluation shows that the distributed data structure is convenient and efficient to use and that the requirements on security hold.","lang":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"367","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-20T07:18:12Z","language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","page":"396-405","citation":{"apa":"Janiuk, J., Mäcker, A., &#38; Graffi, K. (2014). Secure Distributed Data Structures for Peer-to-Peer-based Social Networks. In <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i> (pp. 396–405). <a href=\"https://doi.org/10.1109/CTS.2014.6867595\">https://doi.org/10.1109/CTS.2014.6867595</a>","bibtex":"@inproceedings{Janiuk_Mäcker_Graffi_2014, title={Secure Distributed Data Structures for Peer-to-Peer-based Social Networks}, DOI={<a href=\"https://doi.org/10.1109/CTS.2014.6867595\">10.1109/CTS.2014.6867595</a>}, booktitle={Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)}, author={Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman}, year={2014}, pages={396–405} }","short":"J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.","mla":"Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based Social Networks.” <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>, 2014, pp. 396–405, doi:<a href=\"https://doi.org/10.1109/CTS.2014.6867595\">10.1109/CTS.2014.6867595</a>.","ama":"Janiuk J, Mäcker A, Graffi K. Secure Distributed Data Structures for Peer-to-Peer-based Social Networks. In: <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>. ; 2014:396-405. doi:<a href=\"https://doi.org/10.1109/CTS.2014.6867595\">10.1109/CTS.2014.6867595</a>","chicago":"Janiuk, Jens, Alexander Mäcker, and Kalman Graffi. “Secure Distributed Data Structures for Peer-to-Peer-Based Social Networks.” In <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>, 396–405, 2014. <a href=\"https://doi.org/10.1109/CTS.2014.6867595\">https://doi.org/10.1109/CTS.2014.6867595</a>.","ieee":"J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for Peer-to-Peer-based Social Networks,” in <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>, 2014, pp. 396–405."},"year":"2014","author":[{"first_name":"Jens","last_name":"Janiuk","full_name":"Janiuk, Jens"},{"id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker","first_name":"Alexander"},{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"}],"date_created":"2017-10-17T12:42:03Z","date_updated":"2022-01-06T06:59:29Z","doi":"10.1109/CTS.2014.6867595","title":"Secure Distributed Data Structures for Peer-to-Peer-based Social Networks"},{"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":269941,"access_level":"closed","file_id":"1401","file_name":"371-RoBuSt-OPODIS.pdf","date_updated":"2018-03-20T07:16:32Z","creator":"florida","date_created":"2018-03-20T07:16:32Z"}],"abstract":[{"lang":"eng","text":"In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \\gamma n^{1/\\log\\log n} crashed servers, with \\gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS."}],"publication":"Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)","type":"conference","file_date_updated":"2018-03-20T07:16:32Z","ddc":["040"],"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","_id":"371","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"page":"107--122","citation":{"apa":"Scheideler, C., Setzer, A., &#38; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 107--122). <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>","bibtex":"@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt: A Crash-Failure-Resistant Distributed Storage System}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>}, booktitle={Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel, Martina}, year={2014}, pages={107--122}, collection={LNCS} }","short":"C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.","mla":"Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122, doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>.","ama":"Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In: <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2014:107--122. doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>","ieee":"C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant Distributed Storage System,” in <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122.","chicago":"Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 107--122. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>."},"year":"2014","has_accepted_license":"1","doi":"10.1007/978-3-319-14472-6_8","title":"RoBuSt: A Crash-Failure-Resistant Distributed Storage System","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"},{"first_name":"Martina","last_name":"Eikel","full_name":"Eikel, Martina"}],"date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:31Z"},{"type":"journal_article","publication":"Theory of Computing Systems","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":310961,"access_level":"closed","file_id":"1396","file_name":"378-re-chord_journal.pdf","date_updated":"2018-03-20T07:13:36Z","creator":"florida","date_created":"2018-03-20T07:13:36Z"}],"status":"public","abstract":[{"text":"The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again.","lang":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"378","file_date_updated":"2018-03-20T07:13:36Z","ddc":["040"],"issue":"3","has_accepted_license":"1","citation":{"short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612} }","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3, Springer, 2014, pp. 591–612, doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>, (3), 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3 (2014): 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” <i>Theory of Computing Systems</i>, no. 3, pp. 591–612, 2014.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>. 2014;(3):591-612. doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>"},"page":"591-612","year":"2014","date_created":"2017-10-17T12:42:05Z","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:59:35Z","publisher":"Springer","doi":"10.1007/s00224-012-9431-2","title":"Re-Chord: A Self-stabilizing Chord Overlay Network"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-20T07:02:33Z","date_updated":"2018-03-20T07:02:33Z","access_level":"closed","file_name":"387-a24-awerbuch_2_.pdf","file_id":"1388","file_size":521454}],"status":"public","abstract":[{"lang":"eng","text":"This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing."}],"type":"journal_article","publication":"Transactions on Algorithms","file_date_updated":"2018-03-20T07:02:33Z","ddc":["040"],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"387","citation":{"apa":"Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>, (4). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>","short":"B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014).","bibtex":"@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles of Robust Medium Access and an Application to Leader Election}, DOI={<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>}, number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014} }","mla":"Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>.","chicago":"Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4 (2014). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>.","ieee":"B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles of Robust Medium Access and an Application to Leader Election,” <i>Transactions on Algorithms</i>, no. 4, 2014.","ama":"Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>. 2014;(4). doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>"},"year":"2014","issue":"4","has_accepted_license":"1","doi":"10.1145/2635818","title":"Principles of Robust Medium Access and an Application to Leader Election","date_created":"2017-10-17T12:42:07Z","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Richa","full_name":"Richa, Andrea W.","first_name":"Andrea W."},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"full_name":"Zhang, Jin","last_name":"Zhang","first_name":"Jin"}],"date_updated":"2022-01-06T06:59:47Z","publisher":"ACM"},{"citation":{"ama":"Luo L. <i>Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn; 2014.","chicago":"Luo, Linghui. <i>Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","ieee":"L. Luo, <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","apa":"Luo, L. (2014). <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn.","bibtex":"@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2014} }","mla":"Luo, Linghui. <i>Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","short":"L. Luo, Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen, Universität Paderborn, 2014."},"year":"2014","author":[{"full_name":"Luo, Linghui","last_name":"Luo","first_name":"Linghui"}],"date_created":"2020-08-17T08:16:07Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen","type":"bachelorsthesis","status":"public","department":[{"_id":"79"}],"user_id":"477","_id":"18001","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"language":[{"iso":"eng"}]},{"_id":"18002","department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:53:25Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","first_name":"Kristian"}],"date_created":"2020-08-17T08:17:00Z","title":"Formbildung selbstorganisierender Partikelsysteme","year":"2014","citation":{"bibtex":"@book{Hinnenthal_2014, title={Formbildung selbstorganisierender Partikelsysteme}, author={Hinnenthal, Kristian}, year={2014} }","short":"K. Hinnenthal, Formbildung Selbstorganisierender Partikelsysteme, 2014.","mla":"Hinnenthal, Kristian. <i>Formbildung Selbstorganisierender Partikelsysteme</i>. 2014.","apa":"Hinnenthal, K. (2014). <i>Formbildung selbstorganisierender Partikelsysteme</i>.","ieee":"K. Hinnenthal, <i>Formbildung selbstorganisierender Partikelsysteme</i>. 2014.","chicago":"Hinnenthal, Kristian. <i>Formbildung Selbstorganisierender Partikelsysteme</i>, 2014.","ama":"Hinnenthal K. <i>Formbildung Selbstorganisierender Partikelsysteme</i>.; 2014."}}]