[{"citation":{"ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, Kolkata, Indien.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. ACM, n.d.","apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>. Kolkata, Indien: ACM.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>, ACM.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d."},"year":"2020","publication_status":"accepted","conference":{"end_date":"07.01.2020","location":"Kolkata, Indien","name":"21st International Conference on Distributed Computing and Networking ","start_date":"04.01.2020"},"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","date_created":"2019-11-25T12:18:41Z","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"last_name":"Kolb","full_name":"Kolb, Christina","id":"43647","first_name":"Christina"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"publisher":"ACM","date_updated":"2022-01-06T06:52:16Z","status":"public","type":"conference","publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"63"},{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"15169"},{"title":"Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems","date_updated":"2022-01-06T06:53:20Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"date_created":"2020-08-11T11:06:28Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"year":"2019","citation":{"apa":"N., N. (2019). <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>.","short":"N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.","mla":"N., N. <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>. 2019.","bibtex":"@book{N._2019, title={Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems}, author={N., N.}, year={2019} }","chicago":"N., N. <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>, 2019.","ieee":"N. N., <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>. 2019.","ama":"N. N. <i>Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems</i>.; 2019."},"language":[{"iso":"eng"}],"_id":"17809","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"mastersthesis"},{"doi":"10.1145/3323165.3323193","author":[{"last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael","first_name":"Michael"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T07:03:56Z","page":"287--296","citation":{"ama":"Feldmann M, Scheideler C. Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2019:287--296. doi:<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>","ieee":"M. Feldmann and C. Scheideler, “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities,” in <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2019, pp. 287--296.","chicago":"Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 287--296. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165.3323193\">https://doi.org/10.1145/3323165.3323193</a>.","apa":"Feldmann, M., &#38; Scheideler, C. (2019). Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 287--296). ACM. <a href=\"https://doi.org/10.1145/3323165.3323193\">https://doi.org/10.1145/3323165.3323193</a>","bibtex":"@inproceedings{Feldmann_Scheideler_2019, title={Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian}, year={2019}, pages={287--296} }","short":"M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.","mla":"Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2019, pp. 287--296, doi:<a href=\"https://doi.org/10.1145/3323165.3323193\">10.1145/3323165.3323193</a>."},"has_accepted_license":"1","file_date_updated":"2019-08-26T09:14:32Z","department":[{"_id":"79"}],"user_id":"477","_id":"8534","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","type":"conference","title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities","date_created":"2019-03-21T14:37:26Z","publisher":"ACM","year":"2019","language":[{"iso":"eng"}],"ddc":["004"],"external_id":{"arxiv":["1805.03472"]},"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-08-26T09:14:32Z","date_created":"2019-08-26T09:14:32Z","creator":"ups","file_size":1295095,"file_name":"p287-feldmann.pdf","access_level":"closed","file_id":"12954"}],"abstract":[{"lang":"eng","text":"We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages."}],"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)"},{"doi":"10.1145/3323165.3323195","title":"Distributed Computation in Node-Capacitated Networks","date_created":"2019-04-10T08:20:34Z","author":[{"first_name":"John","last_name":"Augustine","full_name":"Augustine, John"},{"last_name":"Ghaffari","full_name":"Ghaffari, Mohsen","first_name":"Mohsen"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"},{"last_name":"Li","full_name":"Li, Jason","first_name":"Jason"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"publisher":"ACM","date_updated":"2022-01-06T07:04:04Z","page":"69--79","citation":{"ama":"Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated Networks. In: <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>. ACM; 2019:69--79. doi:<a href=\"https://doi.org/10.1145/3323165.3323195\">10.1145/3323165.3323195</a>","chicago":"Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.” In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>, 69--79. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165.3323195\">https://doi.org/10.1145/3323165.3323195</a>.","ieee":"J. Augustine <i>et al.</i>, “Distributed Computation in Node-Capacitated Networks,” in <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2019, pp. 69--79.","mla":"Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.” <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>, ACM, 2019, pp. 69--79, doi:<a href=\"https://doi.org/10.1145/3323165.3323195\">10.1145/3323165.3323195</a>.","short":"J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.","bibtex":"@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019, title={Distributed Computation in Node-Capacitated Networks}, DOI={<a href=\"https://doi.org/10.1145/3323165.3323195\">10.1145/3323165.3323195</a>}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}, year={2019}, pages={69--79} }","apa":"Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &#38; Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 69--79). ACM. <a href=\"https://doi.org/10.1145/3323165.3323195\">https://doi.org/10.1145/3323165.3323195</a>"},"year":"2019","has_accepted_license":"1","file_date_updated":"2019-08-26T11:17:58Z","language":[{"iso":"eng"}],"ddc":["004"],"department":[{"_id":"79"}],"user_id":"477","_id":"8871","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","file":[{"date_created":"2019-08-26T11:17:58Z","creator":"ups","date_updated":"2019-08-26T11:17:58Z","file_name":"p69-augustine.pdf","access_level":"closed","file_id":"12964","file_size":1275192,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures","type":"conference"},{"publication":"Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS '19)","file":[{"date_updated":"2019-01-26T16:09:08Z","creator":"thgoette","date_created":"2019-01-26T16:09:08Z","file_size":638020,"file_id":"7007","file_name":"Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes joining and leaving the network. We assume an adversary that may churn a\r\nconstant fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds. In particular, the adversary has an almost up-to-date information of\r\nthe network topology as it can observe an only slightly outdated topology that\r\nis at least $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction that new nodes can only join the network via nodes that have taken\r\npart in the network for at least one round.\r\n  Our contributions are as follows: First, we show that it is impossible to\r\nmaintain a connected topology if adversary has up-to-date information about the\r\nnodes' connections. Further, we show that our restriction concerning the join\r\nis also necessary. As our main result present an algorithm that constructs a\r\nnew overlay- completely independent of all previous overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which will be maintained by the\r\nalgorithm. However, our approaches can be transferred to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2019","date_created":"2019-01-24T18:53:11Z","publisher":"IEEE","title":"Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary","type":"conference","status":"public","department":[{"_id":"79"}],"user_id":"34727","_id":"6976","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file_date_updated":"2019-01-26T16:09:08Z","has_accepted_license":"1","publication_status":"accepted","citation":{"chicago":"Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. IEEE, n.d.","ieee":"T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary,” in <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>, Rio de Janeiro, Brazil.","ama":"Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. IEEE.","apa":"Götte, T., Vijayalakshmi, V. R., &#38; Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. Rio de Janeiro, Brazil: IEEE.","bibtex":"@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE}, author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian} }","mla":"Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>, IEEE.","short":"T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d."},"author":[{"last_name":"Götte","full_name":"Götte, Thorsten","id":"34727","first_name":"Thorsten"},{"first_name":"Vipin Ravindran","last_name":"Vijayalakshmi","full_name":"Vijayalakshmi, Vipin Ravindran"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T07:03:25Z","conference":{"end_date":"24.05.19","location":"Rio de Janeiro, Brazil","name":"2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS '19)","start_date":"20.05.19"}},{"year":"2019","publisher":"Dagstuhl Publishing","date_created":"2019-07-08T17:19:01Z","title":"On the Complexity of Local Graph Transformations","publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","abstract":[{"text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"LIPIcs-ICALP-2019-150.pdf","access_level":"closed","file_id":"12955","file_size":537649,"date_created":"2019-08-26T09:21:27Z","creator":"ups","date_updated":"2019-08-26T09:21:27Z"}],"keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"ddc":["004"],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_status":"published","page":"150:1--150:14","intvolume":"       132","citation":{"bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }","mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>.","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.","apa":"Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>","ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>","ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.","chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>."},"date_updated":"2022-01-06T06:50:45Z","volume":132,"author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"}],"doi":"10.4230/LIPICS.ICALP.2019.150","conference":{"end_date":"2019-07-12","location":"Patras, Greece","name":"ICALP 2019","start_date":"2019-07-09"},"type":"conference","status":"public","_id":"10586","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"series_title":"LIPIcs","user_id":"477","file_date_updated":"2019-08-26T09:21:27Z"},{"editor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"}],"status":"public","type":"conference_editor","language":[{"iso":"eng"}],"_id":"14829","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"477","year":"2019","citation":{"chicago":"Scheideler, Christian, and Petra Berenbrink, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>.","ieee":"C. Scheideler and P. Berenbrink, Eds., <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019.","ama":"Scheideler C, Berenbrink P, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>","apa":"Scheideler, C., &#38; Berenbrink, P. (Eds.). (2019). <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>","bibtex":"@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}, DOI={<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>}, publisher={ACM}, year={2019} }","mla":"Scheideler, Christian, and Petra Berenbrink, editors. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>.","short":"C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, ACM, 2019."},"publication_identifier":{"isbn":["978-1-4503-6184-2"]},"title":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019","doi":"10.1145/3323165","publisher":"ACM","date_updated":"2022-01-06T06:52:07Z","date_created":"2019-11-06T10:43:41Z"},{"_id":"14830","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":"15504","language":[{"iso":"eng"}],"publication":"Theory Comput. Syst.","type":"journal_article","status":"public","date_updated":"2022-01-06T06:52:07Z","volume":63,"date_created":"2019-11-06T10:54:58Z","author":[{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"full_name":"Lefevre, Jonas","last_name":"Lefevre","first_name":"Jonas"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Self-Stabilizing Metric Graphs","doi":"10.1007/s00224-017-9823-4","issue":"2","year":"2019","page":"177-199","intvolume":"        63","citation":{"bibtex":"@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs}, volume={63}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>}, number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, 2019, pp. 177–99, doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>.","short":"R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.","apa":"Gmyr, R., Lefevre, J., &#38; Scheideler, C. (2019). Self-Stabilizing Metric Graphs. <i>Theory Comput. Syst.</i>, <i>63</i>(2), 177–199. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>","chicago":"Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i> 63, no. 2 (2019): 177–99. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>.","ieee":"R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, pp. 177–199, 2019.","ama":"Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. <i>Theory Comput Syst</i>. 2019;63(2):177-199. doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>"}},{"date_created":"2019-11-04T10:09:35Z","author":[{"id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T06:52:00Z","conference":{"start_date":"2019-07-01","name":"SIROCCO 2019","location":"L'Aquila, Italy","end_date":"2019-07-04"},"doi":"10.1007/978-3-030-24922-9\\_26","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","page":"345-348","citation":{"bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2019, pp. 345–48, doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>.","apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 345–348). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. ; 2019:345-348. doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 345–48, 2019. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, L’Aquila, Italy, 2019, pp. 345–348."},"year":"2019","department":[{"_id":"79"},{"_id":"63"}],"user_id":"477","_id":"14539","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","type":"conference","status":"public"},{"type":"conference","status":"public","series_title":"Lecture Notes in Computer Science","user_id":"23538","department":[{"_id":"79"}],"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901","_id":"1"}],"_id":"13182","file_date_updated":"2019-09-11T11:20:16Z","has_accepted_license":"1","citation":{"ama":"Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","chicago":"Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>.","ieee":"M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2019, pp. 149–164.","apa":"Feldmann, M., Götte, T., &#38; Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 149–164). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","bibtex":"@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>}, booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164}, collection={Lecture Notes in Computer Science} }","short":"M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.","mla":"Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Springer, Cham, 2019, pp. 149–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>."},"page":"149-164","author":[{"last_name":"Feldmann","full_name":"Feldmann, Michael","id":"23538","first_name":"Michael"},{"first_name":"Thorsten","last_name":"Götte","id":"34727","full_name":"Götte, Thorsten"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T06:51:30Z","doi":"https://doi.org/10.1007/978-3-030-34992-9_13","publication":"Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"date_created":"2019-09-11T11:20:16Z","creator":"mfeldma2","date_updated":"2019-09-11T11:20:16Z","access_level":"closed","file_id":"13188","file_name":"main.pdf","file_size":428908,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"We consider congestion control in peer-to-peer distributed systems. \r\nThe problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \\emph{clients} in this paper) that want to send messages to a fixed common peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages per round and excess messages are dropped.\r\nThe server can modify these probabilities when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.   \r\nOur protocol lets the system converge from \\emph{any} initial state to a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)| \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$ rounds in expectation.\r\nIn particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.\r\nFinally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).\r\n","lang":"eng"}],"external_id":{"arxiv":["1909.04544"]},"language":[{"iso":"eng"}],"ddc":["000"],"year":"2019","date_created":"2019-09-10T12:48:33Z","publisher":"Springer, Cham","title":"A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory"},{"title":"Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2019-06-19T11:31:38Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:33Z","citation":{"apa":"N., N. (2019). <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn.","short":"N. N., Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves, Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","mla":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn; 2019."},"year":"2019","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"10271","status":"public","type":"mastersthesis"},{"citation":{"ama":"Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. ; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>","ieee":"K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019.","chicago":"Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>.","bibtex":"@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed Algorithms for LP-Type Problems of Low Dimension}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>}, booktitle={33rd International Symposium on Distributed Computing (DISC 2019)}, author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, year={2019} }","mla":"Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>.","short":"K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019.","apa":"Hinnenthal, K., Scheideler, C., &#38; Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>"},"year":"2019","date_created":"2019-10-08T11:53:38Z","author":[{"first_name":"Kristian","id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Martijn","full_name":"Struijs, Martijn","last_name":"Struijs"}],"date_updated":"2022-01-06T06:51:41Z","doi":"10.4230/LIPICS.DISC.2019.23","title":"Fast Distributed Algorithms for LP-Type Problems of Low Dimension","publication":"33rd International Symposium on Distributed Computing (DISC 2019)","type":"conference","status":"public","department":[{"_id":"79"}],"user_id":"32229","_id":"13652","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"language":[{"iso":"eng"}]},{"ddc":["040"],"keyword":["distributed consensus","randomized algorithm","adaptive adversary","complexity lower bound"],"language":[{"iso":"eng"}],"abstract":[{"text":"We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T13:30:40Z","creator":"asetzer","date_created":"2018-10-31T13:30:40Z","file_size":1675407,"file_name":"p173-robinson.pdf","file_id":"5215","access_level":"closed"}],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","date_created":"2018-07-04T08:55:45Z","year":"2018","file_date_updated":"2018-10-31T13:30:40Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"3422","user_id":"11108","department":[{"_id":"79"},{"_id":"34"},{"_id":"7"}],"status":"public","type":"conference","doi":"10.1145/3210377.3210399","conference":{"end_date":"2018-07-18","location":"Wien","name":"30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","start_date":"2018-07-16"},"date_updated":"2022-01-06T06:59:16Z","author":[{"first_name":"Peter","full_name":"Robinson, Peter","last_name":"Robinson"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer"}],"citation":{"apa":"Robinson, P., Scheideler, C., &#38; Setzer, A. (n.d.). Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>","short":"P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.","mla":"Robinson, Peter, et al. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>.","bibtex":"@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }","ieee":"P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien.","chicago":"Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, n.d. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>.","ama":"Robinson P, Scheideler C, Setzer A. Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>"},"publication_status":"accepted","has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-5799-9/18/07"]}},{"user_id":"15504","department":[{"_id":"79"}],"_id":"3874","type":"conference_editor","status":"public","editor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Fineman","full_name":"Fineman, Jeremy T.","first_name":"Jeremy T."}],"date_created":"2018-08-10T10:03:47Z","date_updated":"2022-01-06T06:59:47Z","publisher":"ACM","conference":{"location":"Vienna, Austria"},"title":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","publication_identifier":{"isbn":["978-1-4503-5799-9"]},"citation":{"chicago":"Scheideler, Christian, and Jeremy T. Fineman, eds. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.","ieee":"C. Scheideler and J. T. Fineman, Eds., <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.","ama":"Scheideler C, Fineman JT, eds. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM; 2018.","apa":"Scheideler, C., &#38; Fineman, J. T. (Eds.). (2018). <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. Vienna, Austria: ACM.","bibtex":"@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018} }","short":"C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, ACM, 2018.","mla":"Scheideler, Christian, and Jeremy T. Fineman, editors. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018."},"year":"2018"},{"_id":"1138","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"477","type":"dissertation","status":"public","date_updated":"2022-01-06T06:51:00Z","publisher":"Universität Paderborn","date_created":"2018-01-31T06:04:03Z","author":[{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"Distributed Algorithms for Overlay Networks and Programmable Matter","doi":"10.17619/UNIPB/1-265","year":"2018","citation":{"apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>","mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }","ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>.","ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018."}},{"has_accepted_license":"1","citation":{"ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>.","apa":"Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>"},"date_updated":"2022-01-06T06:51:05Z","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","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"conference":{"location":"Vancouver","end_date":"2018-5-24","start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)"},"doi":"10.1109/IPDPS.2018.00114","type":"conference","status":"public","_id":"1163","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"},{"_id":"66"}],"user_id":"11319","file_date_updated":"2018-10-31T13:25:37Z","year":"2018","publisher":"IEEE","date_created":"2018-02-01T13:56:01Z","title":"Self-Stabilizing Supervised Publish-Subscribe Systems","publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","abstract":[{"text":"In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5211","file_name":"08425258.pdf","access_level":"closed","file_size":239559,"date_created":"2018-10-31T13:25:37Z","creator":"mfeldma2","date_updated":"2018-10-31T13:25:37Z"}],"external_id":{"arxiv":["1710.08128"]},"keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"ddc":["040"],"language":[{"iso":"eng"}]},{"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","file":[{"file_size":218420,"file_id":"5212","access_level":"closed","file_name":"08425257.pdf","date_updated":"2018-10-31T13:29:26Z","date_created":"2018-10-31T13:29:26Z","creator":"mfeldma2","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests."}],"external_id":{"arxiv":["1802.07504"]},"language":[{"iso":"eng"}],"ddc":["040"],"year":"2018","date_created":"2018-02-01T14:00:36Z","publisher":"IEEE","title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","type":"conference","status":"public","department":[{"_id":"79"}],"user_id":"23538","_id":"1164","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2018-10-31T13:29:26Z","has_accepted_license":"1","citation":{"apa":"Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>.","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>.","ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>"},"author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"}],"date_updated":"2022-01-06T06:51:05Z","conference":{"name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22","end_date":"2018-5-24","location":"Vancouver"},"doi":"10.1109/IPDPS.2018.00113"},{"year":"2018","page":"81--96","citation":{"ama":"J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating for programmable matter. <i>Natural Computing</i>. 2018;(1):81--96. doi:<a href=\"https://doi.org/10.1007/s11047-017-9658-6\">10.1007/s11047-017-9658-6</a>","ieee":"J. J. Daymude <i>et al.</i>, “On the runtime of universal coating for programmable matter,” <i>Natural Computing</i>, no. 1, pp. 81--96, 2018.","chicago":"J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” <i>Natural Computing</i>, no. 1 (2018): 81--96. <a href=\"https://doi.org/10.1007/s11047-017-9658-6\">https://doi.org/10.1007/s11047-017-9658-6</a>.","short":"J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, Natural Computing (2018) 81--96.","bibtex":"@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018, title={On the runtime of universal coating for programmable matter}, DOI={<a href=\"https://doi.org/10.1007/s11047-017-9658-6\">10.1007/s11047-017-9658-6</a>}, number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }","mla":"J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.” <i>Natural Computing</i>, no. 1, 2018, pp. 81--96, doi:<a href=\"https://doi.org/10.1007/s11047-017-9658-6\">10.1007/s11047-017-9658-6</a>.","apa":"J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. <i>Natural Computing</i>, (1), 81--96. <a href=\"https://doi.org/10.1007/s11047-017-9658-6\">https://doi.org/10.1007/s11047-017-9658-6</a>"},"issue":"1","title":"On the runtime of universal coating for programmable matter","doi":"10.1007/s11047-017-9658-6","date_updated":"2022-01-06T06:53:24Z","author":[{"first_name":"Joshua","full_name":"J. Daymude, Joshua","last_name":"J. Daymude"},{"full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh","first_name":"Zahra"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"first_name":"Alexandra","full_name":"Porter, Alexandra","last_name":"Porter"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"date_created":"2018-03-27T06:23:58Z","status":"public","publication":"Natural Computing","type":"journal_article","language":[{"iso":"eng"}],"_id":"1796","department":[{"_id":"79"},{"_id":"66"}],"user_id":"11319"},{"title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","date_created":"2020-08-18T08:44:22Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","citation":{"short":"N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","mla":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","bibtex":"@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={N., N.}, year={2018} }","apa":"N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","ama":"N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018.","ieee":"N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","chicago":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018."},"year":"2018","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"18030","status":"public","type":"bachelorsthesis"},{"type":"bachelorsthesis","status":"public","_id":"18031","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"year":"2018","citation":{"ama":"N. N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>.; 2018.","ieee":"N. N., <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>. 2018.","chicago":"N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>, 2018.","bibtex":"@book{N._2018, title={Gathering Strategien für mobile Roboterschwärme im Gitternetz}, author={N., N.}, year={2018} }","mla":"N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>. 2018.","short":"N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.","apa":"N., N. (2018). <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>."},"date_updated":"2022-01-06T06:53:25Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"date_created":"2020-08-18T08:45:09Z","title":"Gathering Strategien für mobile Roboterschwärme im Gitternetz"}]