[{"title":"Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter","doi":"10.1145/2767386.2767451","date_updated":"2022-01-06T06:53:36Z","publisher":"ACM","date_created":"2018-03-28T05:52:44Z","author":[{"first_name":"Zahra","last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"first_name":"Thim Frederik","id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann"},{"full_name":"A. Bazzi, Rida","last_name":"A. Bazzi","first_name":"Rida"},{"first_name":"Andrea","last_name":"W. Richa","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"year":"2015","citation":{"ama":"Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler C. Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>. ACM; 2015:67--69. doi:<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi, Andrea W. Richa, and Christian Scheideler. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, 67--69. ACM, 2015. <a href=\"https://doi.org/10.1145/2767386.2767451\">https://doi.org/10.1145/2767386.2767451</a>.","ieee":"Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and C. Scheideler, “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, 2015, pp. 67--69.","apa":"Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &#38; Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i> (pp. 67--69). ACM. <a href=\"https://doi.org/10.1145/2767386.2767451\">https://doi.org/10.1145/2767386.2767451</a>","short":"Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015, title={Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian}, year={2015}, pages={67--69} }","mla":"Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, ACM, 2015, pp. 67--69, doi:<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>."},"page":"67--69","publication_identifier":{"isbn":["978-1-4503-3617-8"]},"language":[{"iso":"eng"}],"_id":"1852","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"conference","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\'{a}}n, Spain, July 21 - 23, 2015"},{"status":"public","type":"conference","publication":"Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"_id":"1853","citation":{"apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i> (pp. 77--79). ACM. <a href=\"https://doi.org/10.1145/2755573.2755614\">https://doi.org/10.1145/2755573.2755614</a>","mla":"Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, ACM, 2015, pp. 77--79, doi:<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>.","bibtex":"@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, title={Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>}, booktitle={Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015}, publisher={ACM}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={77--79} }","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79.","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, 77--79. ACM, 2015. <a href=\"https://doi.org/10.1145/2755573.2755614\">https://doi.org/10.1145/2755573.2755614</a>.","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, 2015, pp. 77--79.","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>. ACM; 2015:77--79. doi:<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>"},"page":"77--79","year":"2015","publication_identifier":{"isbn":["978-1-4503-3588-1"]},"doi":"10.1145/2755573.2755614","title":"Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks","author":[{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Thim Frederik","id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann"}],"date_created":"2018-03-28T05:57:20Z","date_updated":"2022-01-06T06:53:36Z","publisher":"ACM"},{"language":[{"iso":"eng"}],"_id":"1863","department":[{"_id":"79"}],"user_id":"15504","status":"public","publication":"26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14, Prague, Czech Republic - June 23 - 25, 2014","type":"conference","title":"Brief announcement: amoebot - a new model for programmable matter","doi":"10.1145/2612669.2612712","publisher":"ACM","date_updated":"2022-01-06T06:53:47Z","date_created":"2018-03-28T06:24:00Z","author":[{"first_name":"Zahra","last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra"},{"first_name":"Shlomi","full_name":"Dolev, Shlomi","last_name":"Dolev"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Andrea","last_name":"W. Richa","full_name":"W. Richa, Andrea"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"year":"2014","page":"220--222","citation":{"bibtex":"@inproceedings{Derakhshandeh_Dolev_Gmyr_W. Richa_Scheideler_Strothmann_2014, title={Brief announcement: amoebot - a new model for programmable matter}, DOI={<a href=\"https://doi.org/10.1145/2612669.2612712\">10.1145/2612669.2612712</a>}, booktitle={26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014}, publisher={ACM}, author={Derakhshandeh, Zahra and Dolev, Shlomi and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={220--222} }","short":"Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222.","mla":"Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for Programmable Matter.” <i>26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014</i>, ACM, 2014, pp. 220--222, doi:<a href=\"https://doi.org/10.1145/2612669.2612712\">10.1145/2612669.2612712</a>.","apa":"Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable matter. In <i>26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014</i> (pp. 220--222). ACM. <a href=\"https://doi.org/10.1145/2612669.2612712\">https://doi.org/10.1145/2612669.2612712</a>","ieee":"Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Brief announcement: amoebot - a new model for programmable matter,” in <i>26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014</i>, 2014, pp. 220--222.","chicago":"Derakhshandeh, Zahra, Shlomi Dolev, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Amoebot - a New Model for Programmable Matter.” In <i>26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014</i>, 220--222. ACM, 2014. <a href=\"https://doi.org/10.1145/2612669.2612712\">https://doi.org/10.1145/2612669.2612712</a>.","ama":"Derakhshandeh Z, Dolev S, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Brief announcement: amoebot - a new model for programmable matter. In: <i>26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014</i>. ACM; 2014:220--222. doi:<a href=\"https://doi.org/10.1145/2612669.2612712\">10.1145/2612669.2612712</a>"},"publication_identifier":{"isbn":["978-1-4503-2821-0"]}},{"doi":"10.1007/978-3-319-11764-5_4","date_updated":"2022-01-06T06:59:56Z","author":[{"full_name":"Foreback, Dianne","last_name":"Foreback","first_name":"Dianne"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"citation":{"apa":"Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &#38; Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i> (pp. 48--62). <a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">https://doi.org/10.1007/978-3-319-11764-5_4</a>","mla":"Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2014, pp. 48--62, doi:<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>.","short":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann, in: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62.","bibtex":"@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014, series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>}, booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos, Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={48--62}, collection={LNCS} }","ama":"Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On Stabilizing Departures in Overlay Networks. In: <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. LNCS. ; 2014:48--62. doi:<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>","ieee":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann, “On Stabilizing Departures in Overlay Networks,” in <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2014, pp. 48--62.","chicago":"Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler, and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.” In <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 48--62. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">https://doi.org/10.1007/978-3-319-11764-5_4</a>."},"page":"48--62","has_accepted_license":"1","file_date_updated":"2018-03-20T07:00:28Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"393","user_id":"477","series_title":"LNCS","department":[{"_id":"79"}],"status":"public","type":"conference","title":"On Stabilizing Departures in Overlay Networks","date_created":"2017-10-17T12:42:08Z","year":"2014","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer system are excluded from the overlay network without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state initially. Surprisingly, the problem is not formally studied yet for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation if necessary. We show that there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous message passing model. To allow a solution, we introduce an oracle called NIDEC and show that it is sufficient even for the asynchronous message passing model by proposing an algorithm that can solve the FDP using NIDEC. We also show that a solution to the FSP does not require an oracle.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1384","file_name":"393-departures.pdf","file_size":287539,"date_created":"2018-03-20T07:00:28Z","creator":"florida","date_updated":"2018-03-20T07:00:28Z"}],"publication":"Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems"},{"citation":{"apa":"Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn.","short":"T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012.","bibtex":"@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }","mla":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ieee":"T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","chicago":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ama":"Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn; 2012."},"year":"2012","title":"Self-Optimizing Binary Search Trees - A Game Theoretic Approach","author":[{"first_name":"Thim Frederik","id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann"}],"date_created":"2017-10-17T12:42:45Z","date_updated":"2022-01-06T07:02:42Z","publisher":"Universität Paderborn","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"582"}]