[{"title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","publisher":"Springer, Cham","date_created":"2018-09-04T14:15:39Z","year":"2018","ddc":["040"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1808.10300"]},"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_updated":"2018-10-31T13:24:17Z","creator":"mfeldma2","date_created":"2018-10-31T13:24:17Z","file_size":329823,"file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf","access_level":"closed","file_id":"5210","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","doi":"10.1007/978-3-030-03232-6_2","date_updated":"2022-01-06T07:00:58Z","volume":11201,"author":[{"full_name":"Feldmann, Michael","id":"23538","last_name":"Feldmann","first_name":"Michael"},{"full_name":"Kolb, Christina","id":"43647","last_name":"Kolb","first_name":"Christina"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"page":"16-31 ","intvolume":"     11201","citation":{"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>.","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.","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>","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.","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>.","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>"},"publication_identifier":{"unknown":["978-3-030-03231-9"]},"has_accepted_license":"1","file_date_updated":"2018-10-31T13:24:17Z","_id":"4351","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"23538","status":"public","type":"conference"},{"file_date_updated":"2018-11-27T10:03:33Z","language":[{"iso":"eng"}],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"ddc":["000"],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"14955","_id":"4375","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","file":[{"access_level":"closed","file_id":"5863","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","file_size":1122875,"creator":"tillk","date_created":"2018-11-27T10:03:33Z","date_updated":"2018-11-27T10:03:33Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"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"}],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","type":"conference","conference":{"end_date":"2018-08-21","location":"Helsinki","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","start_date":"2018-08-20"},"doi":"10.1007/978-3-030-19759-9_4","title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","author":[{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"},{"first_name":"Jannik","last_name":"Sundermeier","full_name":"Sundermeier, Jannik","id":"38705"}],"date_created":"2018-09-11T05:26:59Z","date_updated":"2022-01-06T07:01:00Z","citation":{"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.","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>.","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>","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.","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} }","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>.","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>"},"year":"2018","has_accepted_license":"1"},{"title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks","date_created":"2018-10-31T13:33:05Z","year":"2018","ddc":["040"],"language":[{"iso":"eng"}],"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."}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":369818,"access_level":"closed","file_id":"5223","file_name":"Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf","date_updated":"2018-10-31T16:09:48Z","date_created":"2018-10-31T15:51:45Z","creator":"asetzer"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","conference":{"name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","location":"Tokyo, Japan"},"doi":"10.1007/978-3-030-03232-6_16","date_updated":"2022-01-06T07:01:47Z","author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer","first_name":"Alexander"}],"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>","short":"C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.","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} }","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>"},"has_accepted_license":"1","publication_status":"published","file_date_updated":"2018-10-31T16:09:48Z","_id":"5216","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"11108","status":"public","type":"conference"},{"date_created":"2018-10-31T15:44:30Z","publisher":"Springer","title":"On Underlay-Aware Self-Stabilizing Overlay Networks","year":"2018","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"sss18_camera.pdf","file_id":"5224","access_level":"closed","file_size":367812,"creator":"thgoette","date_created":"2018-10-31T15:59:26Z","date_updated":"2018-10-31T15:59:26Z"}],"abstract":[{"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. ","lang":"eng"}],"volume":11201,"author":[{"last_name":"Götte","id":"34727","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"}],"date_updated":"2022-01-06T07:01:47Z","conference":{"name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","location":"Tokyo, Japan"},"has_accepted_license":"1","intvolume":"     11201","page":"50-64","citation":{"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.","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.","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} }","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.","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."},"department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"477","_id":"5222","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2018-10-31T15:59:26Z","type":"conference","status":"public"},{"language":[{"iso":"eng"}],"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":"5368","status":"public","type":"bachelorsthesis","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"full_name":"Jochmaring, Moritz","last_name":"Jochmaring","first_name":"Moritz"}],"date_created":"2018-11-06T06:21:37Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","citation":{"mla":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","short":"M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","bibtex":"@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }","apa":"Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","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.","ama":"Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018."},"year":"2018"},{"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>.","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>.","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>"},"page":"241-254","intvolume":"        31","date_updated":"2022-01-06T06:59:47Z","publisher":"Springer Nature","date_created":"2018-08-10T07:05:12Z","author":[{"first_name":"Adrian","last_name":"Ogierman","full_name":"Ogierman, Adrian"},{"first_name":"Andrea","last_name":"Richa","full_name":"Richa, Andrea"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"full_name":"Zhang, Jin","last_name":"Zhang","first_name":"Jin"}],"volume":31,"title":"Sade: competitive MAC under adversarial SINR","doi":"10.1007/s00446-017-0307-1","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","_id":"3872","user_id":"15504","department":[{"_id":"79"}]},{"date_created":"2020-08-18T08:39:19Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"first_name":"Michél ","full_name":"Burkhardt, Michél ","last_name":"Burkhardt"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"Untersuchungen zum Cone-Hashing","citation":{"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.","ieee":"M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","chicago":"Burkhardt, Michél . <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","ama":"Burkhardt M. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn; 2017."},"year":"2017","department":[{"_id":"79"}],"user_id":"477","_id":"18026","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"author":[{"last_name":"Banh","full_name":"Banh, Ngoc Chi","first_name":"Ngoc Chi"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","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","citation":{"apa":"Banh, N. C. (2017). <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn.","short":"N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","mla":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","bibtex":"@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017} }","ama":"Banh NC. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017.","ieee":"N. C. Banh, <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017.","chicago":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017."},"year":"2017","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"18027","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"first_name":"Andreas","full_name":"Schenk, Andreas","last_name":"Schenk"}],"date_created":"2020-08-18T08:41:42Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","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.","apa":"Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn.","bibtex":"@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas}, year={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."},"year":"2017","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"18028","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","author":[{"last_name":"Beckendorf","full_name":"Beckendorf, Björn","first_name":"Björn"}],"date_created":"2020-08-18T08:42:36Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","year":"2017","citation":{"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.","ama":"Beckendorf B. <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.","mla":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","bibtex":"@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn}, year={2017} }","short":"B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017."},"_id":"18029","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"publication":"Inf. Comput.","type":"journal_article","status":"public","department":[{"_id":"79"}],"user_id":"15504","_id":"1812","language":[{"iso":"eng"}],"page":"408--424","citation":{"mla":"Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Inf. Comput.</i>, 2017, pp. 408--424, doi:<a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">10.1016/j.ic.2016.12.006</a>.","bibtex":"@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal approach for the finite departure problem in overlay networks}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">10.1016/j.ic.2016.12.006</a>}, journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424.","apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. <i>Inf. Comput.</i>, 408--424. <a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">https://doi.org/10.1016/j.ic.2016.12.006</a>","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal approach for the finite departure problem in overlay networks,” <i>Inf. Comput.</i>, pp. 408--424, 2017.","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Inf. Comput.</i>, 2017, 408--424. <a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">https://doi.org/10.1016/j.ic.2016.12.006</a>.","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for the finite departure problem in overlay networks. <i>Inf Comput</i>. 2017:408--424. doi:<a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">10.1016/j.ic.2016.12.006</a>"},"year":"2017","author":[{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann","first_name":"Thim Frederik"}],"date_created":"2018-03-27T11:23:36Z","date_updated":"2022-01-06T06:53:26Z","doi":"10.1016/j.ic.2016.12.006","title":"Towards a universal approach for the finite departure problem in overlay networks"},{"year":"2017","page":"87--94","citation":{"bibtex":"@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271}, DOI={<a href=\"https://doi.org/10.1145/3106700.3106713\">10.1145/3106700.3106713</a>}, number={2}, journal={SIGACT News}, author={P. Fekete, Sandor and W. Richa, Andrea and Römer, Kay and Scheideler, Christian}, year={2017}, pages={87--94} }","short":"S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.","mla":"P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” <i>SIGACT News</i>, no. 2, 2017, pp. 87--94, doi:<a href=\"https://doi.org/10.1145/3106700.3106713\">10.1145/3106700.3106713</a>.","apa":"P. Fekete, S., W. Richa, A., Römer, K., &#38; Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. <i>SIGACT News</i>, (2), 87--94. <a href=\"https://doi.org/10.1145/3106700.3106713\">https://doi.org/10.1145/3106700.3106713</a>","ama":"P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. <i>SIGACT News</i>. 2017;(2):87--94. doi:<a href=\"https://doi.org/10.1145/3106700.3106713\">10.1145/3106700.3106713</a>","ieee":"S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271,” <i>SIGACT News</i>, no. 2, pp. 87--94, 2017.","chicago":"P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” <i>SIGACT News</i>, no. 2 (2017): 87--94. <a href=\"https://doi.org/10.1145/3106700.3106713\">https://doi.org/10.1145/3106700.3106713</a>."},"issue":"2","title":"Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271","doi":"10.1145/3106700.3106713","date_updated":"2022-01-06T06:53:26Z","author":[{"first_name":"Sandor","full_name":"P. Fekete, Sandor","last_name":"P. Fekete"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"full_name":"Römer, Kay","last_name":"Römer","first_name":"Kay"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-03-27T11:24:15Z","status":"public","publication":"SIGACT News","type":"journal_article","_id":"1813","department":[{"_id":"79"}],"user_id":"15504"},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"_id":"1814","status":"public","type":"journal_article","publication":"Theor. Comput. Sci.","doi":"10.1016/j.tcs.2016.02.039","title":"Universal coating for programmable matter","author":[{"first_name":"Zahra","full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319","first_name":"Thim Frederik"}],"date_created":"2018-03-27T11:24:57Z","date_updated":"2022-01-06T06:53:26Z","citation":{"chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.” <i>Theor. Comput. Sci.</i>, 2017, 56--68. <a href=\"https://doi.org/10.1016/j.tcs.2016.02.039\">https://doi.org/10.1016/j.tcs.2016.02.039</a>.","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal coating for programmable matter,” <i>Theor. Comput. Sci.</i>, pp. 56--68, 2017.","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal coating for programmable matter. <i>Theor Comput Sci</i>. 2017:56--68. doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.02.039\">10.1016/j.tcs.2016.02.039</a>","apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2017). Universal coating for programmable matter. <i>Theor. Comput. Sci.</i>, 56--68. <a href=\"https://doi.org/10.1016/j.tcs.2016.02.039\">https://doi.org/10.1016/j.tcs.2016.02.039</a>","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor. Comput. Sci. (2017) 56--68.","bibtex":"@article{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Universal coating for programmable matter}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2016.02.039\">10.1016/j.tcs.2016.02.039</a>}, journal={Theor. Comput. Sci.}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={56--68} }","mla":"Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” <i>Theor. Comput. Sci.</i>, 2017, pp. 56--68, doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.02.039\">10.1016/j.tcs.2016.02.039</a>."},"page":"56--68","year":"2017"},{"type":"conference","publication":"Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers","status":"public","user_id":"15504","department":[{"_id":"79"}],"_id":"1815","language":[{"iso":"eng"}],"citation":{"ieee":"J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Improved Leader Election for Self-organizing Programmable Matter,” in <i>Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers</i>, 2017, pp. 127--140.","chicago":"J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable Matter.” In <i>Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers</i>, 127--140, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72751-6_10\">https://doi.org/10.1007/978-3-319-72751-6_10</a>.","ama":"J. Daymude J, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Improved Leader Election for Self-organizing Programmable Matter. In: <i>Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers</i>. ; 2017:127--140. doi:<a href=\"https://doi.org/10.1007/978-3-319-72751-6_10\">10.1007/978-3-319-72751-6_10</a>","mla":"J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable Matter.” <i>Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers</i>, 2017, pp. 127--140, doi:<a href=\"https://doi.org/10.1007/978-3-319-72751-6_10\">10.1007/978-3-319-72751-6_10</a>.","bibtex":"@inproceedings{J. Daymude_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Improved Leader Election for Self-organizing Programmable Matter}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-72751-6_10\">10.1007/978-3-319-72751-6_10</a>}, booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers}, author={J. Daymude, Joshua and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={127--140} }","short":"J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.","apa":"J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2017). Improved Leader Election for Self-organizing Programmable Matter. In <i>Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers</i> (pp. 127--140). <a href=\"https://doi.org/10.1007/978-3-319-72751-6_10\">https://doi.org/10.1007/978-3-319-72751-6_10</a>"},"page":"127--140","year":"2017","date_created":"2018-03-27T11:25:58Z","author":[{"full_name":"J. Daymude, Joshua","last_name":"J. Daymude","first_name":"Joshua"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"}],"date_updated":"2022-01-06T06:53:26Z","doi":"10.1007/978-3-319-72751-6_10","title":"Improved Leader Election for Self-organizing Programmable Matter"},{"_id":"1820","user_id":"15504","department":[{"_id":"79"}],"type":"conference_editor","editor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Mohammad","full_name":"Taghi Hajiaghayi, Mohammad","last_name":"Taghi Hajiaghayi"}],"status":"public","date_updated":"2022-01-06T06:53:27Z","date_created":"2018-03-27T11:29:10Z","title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017","doi":"10.1145/3087556","publication_identifier":{"isbn":["978-1-4503-4593-4"]},"year":"2017","citation":{"apa":"Scheideler, C., &#38; Taghi Hajiaghayi, M. (Eds.). (2017). <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>","mla":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. 2017, doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>.","bibtex":"@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}, DOI={<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>}, year={2017} }","short":"C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, 2017.","chicago":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>, 2017. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>.","ieee":"C. Scheideler and M. Taghi Hajiaghayi, Eds., <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. 2017.","ama":"Scheideler C, Taghi Hajiaghayi M, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>.; 2017. doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>"}},{"status":"public","type":"mastersthesis","language":[{"iso":"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 A","_id":"2"}],"_id":"81","citation":{"ama":"Luo L. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn; 2017.","chicago":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.","ieee":"L. Luo, <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained</i>. Universität Paderborn, 2017.","bibtex":"@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2017} }","short":"L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained, Universität Paderborn, 2017.","mla":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.","apa":"Luo, L. (2017). <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained</i>. Universität Paderborn."},"year":"2017","title":"MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:41:07Z","author":[{"full_name":"Luo, Linghui","last_name":"Luo","first_name":"Linghui"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:50Z"},{"citation":{"chicago":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>.","ieee":"C. Scheideler and M. Taghi Hajiaghayi, Eds., <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017.","ama":"Scheideler C, Taghi Hajiaghayi M, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>","bibtex":"@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}, DOI={<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>}, publisher={ACM}, year={2017} }","mla":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>.","short":"C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, ACM, 2017.","apa":"Scheideler, C., &#38; Taghi Hajiaghayi, M. (Eds.). (2017). <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>"},"year":"2017","publication_identifier":{"isbn":["978-1-4503-4593-4"]},"doi":"10.1145/3087556","title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017","date_created":"2018-11-29T10:23:12Z","publisher":"ACM","date_updated":"2022-01-06T07:02:48Z","status":"public","editor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Taghi Hajiaghayi","full_name":"Taghi Hajiaghayi, Mohammad","first_name":"Mohammad"}],"type":"conference_editor","language":[{"iso":"eng"}],"department":[{"_id":"7"},{"_id":"79"}],"user_id":"477","_id":"5980","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"61","user_id":"477","department":[{"_id":"79"}],"year":"2017","citation":{"ieee":"T. F. Strothmann, <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017.","chicago":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>.","ama":"Strothmann TF. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>","apa":"Strothmann, T. F. (2017). <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>","bibtex":"@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017} }","mla":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>.","short":"T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn, 2017."},"title":"Self-* Algorithms for Distributed Systems","doi":"10.17619/UNIPB/1-150","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:52Z","date_created":"2017-10-17T12:41:03Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}]},{"title":"Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:25Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"date_created":"2017-11-14T08:03:45Z","year":"2017","citation":{"ieee":"J. Sundermeier, <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","chicago":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","ama":"Sundermeier J. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn; 2017.","bibtex":"@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2017} }","mla":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","short":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.","apa":"Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn."},"language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"699","user_id":"38705","department":[{"_id":"79"}],"status":"public","type":"mastersthesis"},{"type":"mastersthesis","status":"public","_id":"700","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2017","citation":{"apa":"Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn.","short":"T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität Paderborn, 2017.","bibtex":"@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017} }","mla":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","chicago":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","ieee":"T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","ama":"Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn; 2017."},"date_updated":"2022-01-06T07:03:26Z","publisher":"Universität Paderborn","author":[{"first_name":"Till","full_name":"Knollmann, Till","last_name":"Knollmann"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-11-14T08:04:35Z","title":"A Self-Stabilizing Protocol for Graphs of Diameter Two"}]