[{"status":"public","type":"journal_article","publication":"Inf. Comput.","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"_id":"1812","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>","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>.","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.","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>"},"page":"408--424","year":"2017","doi":"10.1016/j.ic.2016.12.006","title":"Towards a universal approach for the finite departure problem in overlay networks","date_created":"2018-03-27T11:23:36Z","author":[{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"}],"date_updated":"2022-01-06T06:53:26Z"},{"department":[{"_id":"79"}],"user_id":"15504","_id":"1813","publication":"SIGACT News","type":"journal_article","status":"public","author":[{"first_name":"Sandor","last_name":"P. Fekete","full_name":"P. Fekete, Sandor"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"first_name":"Kay","full_name":"Römer, Kay","last_name":"Römer"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-03-27T11:24:15Z","date_updated":"2022-01-06T06:53:26Z","doi":"10.1145/3106700.3106713","title":"Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271","issue":"2","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>."},"year":"2017"},{"_id":"1814","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Theor. Comput. Sci.","status":"public","date_updated":"2022-01-06T06:53:26Z","date_created":"2018-03-27T11:24:57Z","author":[{"first_name":"Zahra","last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik"}],"title":"Universal coating for programmable matter","doi":"10.1016/j.tcs.2016.02.039","year":"2017","citation":{"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>","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.","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>.","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>.","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>"},"page":"56--68"},{"date_updated":"2022-01-06T06:53:26Z","author":[{"last_name":"J. Daymude","full_name":"J. Daymude, Joshua","first_name":"Joshua"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319","first_name":"Thim Frederik"}],"date_created":"2018-03-27T11:25:58Z","title":"Improved Leader Election for Self-organizing Programmable Matter","doi":"10.1007/978-3-319-72751-6_10","year":"2017","citation":{"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>","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.","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>.","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.","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>"},"page":"127--140","_id":"1815","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"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"},{"year":"2017","citation":{"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} }","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>.","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.","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>","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>"},"publication_identifier":{"isbn":["978-1-4503-4593-4"]},"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","date_updated":"2022-01-06T06:53:27Z","date_created":"2018-03-27T11:29:10Z","editor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Taghi Hajiaghayi","full_name":"Taghi Hajiaghayi, Mohammad","first_name":"Mohammad"}],"status":"public","type":"conference_editor","_id":"1820","user_id":"15504","department":[{"_id":"79"}]},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"81","user_id":"477","department":[{"_id":"79"}],"year":"2017","citation":{"apa":"Luo, L. (2017). <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained</i>. Universität Paderborn.","short":"L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained, 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} }","mla":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.","ama":"Luo L. <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.","chicago":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017."},"title":"MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:50Z","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"}]},{"_id":"5980","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"7"},{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"type":"conference_editor","editor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Mohammad","last_name":"Taghi Hajiaghayi","full_name":"Taghi Hajiaghayi, Mohammad"}],"status":"public","date_updated":"2022-01-06T07:02:48Z","publisher":"ACM","date_created":"2018-11-29T10:23:12Z","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>. ACM. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/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} }","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.","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>.","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.","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>.","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>"}},{"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":{"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.","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>","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>"},"title":"Self-* Algorithms for Distributed Systems","doi":"10.17619/UNIPB/1-150","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:52Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"Thim Frederik","id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann"}],"date_created":"2017-10-17T12:41:03Z"},{"title":"Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions","date_updated":"2022-01-06T07:03:25Z","publisher":"Universität Paderborn","author":[{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"date_created":"2017-11-14T08:03:45Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"year":"2017","citation":{"apa":"Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn.","mla":"Sundermeier, Jannik. <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} }","short":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.","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."},"language":[{"iso":"eng"}],"_id":"699","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":"38705","status":"public","type":"mastersthesis"},{"year":"2017","citation":{"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.","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."},"date_updated":"2022-01-06T07:03:26Z","publisher":"Universität Paderborn","author":[{"first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-11-14T08:04:35Z","title":"A Self-Stabilizing Protocol for Graphs of Diameter Two","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"}]},{"title":"Self-Stabilizing Spanners for Tree Metrics","date_updated":"2022-01-06T07:03:26Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2017-11-14T09:32:39Z","author":[{"first_name":"Thorsten","id":"34727","full_name":"Götte, Thorsten","last_name":"Götte"}],"year":"2017","citation":{"ama":"Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn; 2017.","ieee":"T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","chicago":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","mla":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","bibtex":"@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2017} }","short":"T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn, 2017.","apa":"Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn."},"language":[{"iso":"eng"}],"_id":"701","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"477","status":"public","type":"mastersthesis"},{"has_accepted_license":"1","year":"2017","page":"137:1--137:15","citation":{"apa":"Gmyr, R., Hinnenthal, K., Scheideler, C., &#38; Sohler, C. (2017). Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i> (pp. 137:1--137:15). <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>","mla":"Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>, 2017, pp. 137:1--137:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">10.4230/LIPIcs.ICALP.2017.137</a>.","short":"R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.","bibtex":"@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring of Network Properties: The Power of Hybrid Networks}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">10.4230/LIPIcs.ICALP.2017.137</a>}, booktitle={Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ieee":"R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring of Network Properties: The Power of Hybrid Networks,” in <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>, 2017, pp. 137:1--137:15.","chicago":"Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” In <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>, 137:1--137:15. Leibniz International Proceedings in Informatics (LIPIcs), 2017. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>.","ama":"Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In: <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>. Leibniz International Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">10.4230/LIPIcs.ICALP.2017.137</a>"},"date_updated":"2022-01-06T06:50:42Z","author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Kristian","last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"date_created":"2017-10-17T12:41:12Z","title":"Distributed Monitoring of Network Properties: The Power of Hybrid Networks","doi":"10.4230/LIPIcs.ICALP.2017.137","publication":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)","type":"conference","abstract":[{"text":"We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature.","lang":"eng"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":504161,"access_level":"closed","file_id":"1207","file_name":"105-ICALP17-GHSS.pdf","date_updated":"2018-03-13T09:23:11Z","creator":"florida","date_created":"2018-03-13T09:23:11Z"}],"_id":"105","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"20792","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-13T09:23:11Z"},{"abstract":[{"lang":"eng","text":"Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \\sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\\mathcal O(\\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\\mathcal O(\\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant."}],"file":[{"date_updated":"2018-10-31T13:30:13Z","creator":"mfeldma2","date_created":"2018-10-31T13:30:13Z","file_size":311204,"file_id":"5214","file_name":"Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","ddc":["040"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1708.06542"]},"year":"2017","title":"A Self-Stabilizing General De Bruijn Graph","publisher":"Springer, Cham","date_created":"2017-10-17T12:41:16Z","status":"public","type":"conference","file_date_updated":"2018-10-31T13:30:13Z","_id":"125","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"23538","intvolume":"     10616","page":"250-264 ","citation":{"ama":"Feldmann M, Scheideler C. A Self-Stabilizing General De Bruijn Graph. In: <i>Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 10616. Lecture Notes in Computer Science. Springer, Cham; 2017:250-264. doi:<a href=\"https://doi.org/10.1007/978-3-319-69084-1_17\">10.1007/978-3-319-69084-1_17</a>","chicago":"Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” In <i>Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 10616:250–64. Lecture Notes in Computer Science. Springer, Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-69084-1_17\">https://doi.org/10.1007/978-3-319-69084-1_17</a>.","ieee":"M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,” in <i>Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2017, vol. 10616, pp. 250–264.","bibtex":"@inproceedings{Feldmann_Scheideler_2017, series={Lecture Notes in Computer Science}, title={A Self-Stabilizing General De Bruijn Graph}, volume={10616}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-69084-1_17\">10.1007/978-3-319-69084-1_17</a>}, booktitle={Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Scheideler, Christian}, year={2017}, pages={250–264}, collection={Lecture Notes in Computer Science} }","short":"M. Feldmann, C. Scheideler, in: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2017, pp. 250–264.","mla":"Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” <i>Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, vol. 10616, Springer, Cham, 2017, pp. 250–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-69084-1_17\">10.1007/978-3-319-69084-1_17</a>.","apa":"Feldmann, M., &#38; Scheideler, C. (2017). A Self-Stabilizing General De Bruijn Graph. In <i>Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 10616, pp. 250–264). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-319-69084-1_17\">https://doi.org/10.1007/978-3-319-69084-1_17</a>"},"publication_identifier":{"isbn":["978-3-319-69083-4"]},"has_accepted_license":"1","publication_status":"published","doi":"10.1007/978-3-319-69084-1_17","date_updated":"2022-01-06T06:51:19Z","volume":10616,"author":[{"last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael","first_name":"Michael"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}]},{"doi":"10.1145/2935764.2935783","title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","date_created":"2017-10-17T12:41:33Z","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:55:02Z","page":"417--427","citation":{"ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427.","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 417--427, 2016. <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>.","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2016:417--427. doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427, doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>.","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","apa":"Drees, M., Gmyr, R., &#38; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 417--427). <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>"},"year":"2016","has_accepted_license":"1","file_date_updated":"2018-03-21T10:41:40Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"215","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T10:41:40Z","date_updated":"2018-03-21T10:41:40Z","access_level":"closed","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","file_id":"1518","file_size":352996}],"abstract":[{"lang":"eng","text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems."}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference"},{"_id":"18025","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:53:25Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2020-08-18T08:38:22Z","author":[{"last_name":"Heuchler","full_name":"Heuchler, Sebastian","first_name":"Sebastian"}],"title":"Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem","year":"2016","citation":{"apa":"Heuchler, S. (2016). <i>Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem</i>.","short":"S. Heuchler, Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.","bibtex":"@book{Heuchler_2016, title={Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem}, author={Heuchler, Sebastian}, year={2016} }","mla":"Heuchler, Sebastian. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>. 2016.","ama":"Heuchler S. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>.; 2016.","ieee":"S. Heuchler, <i>Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem</i>. 2016.","chicago":"Heuchler, Sebastian. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>, 2016."}},{"_id":"1835","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"journal_article","publication":"IEEE/ACM Trans. Netw.","title":"SplayNet: Towards Locally Self-Adjusting Networks","doi":"10.1109/TNET.2015.2410313","date_updated":"2022-01-06T06:53:29Z","author":[{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"first_name":"Chen","last_name":"Avin","full_name":"Avin, Chen"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"last_name":"Borokhovich","full_name":"Borokhovich, Michael","first_name":"Michael"},{"first_name":"Bernhard","last_name":"Haeupler","full_name":"Haeupler, Bernhard"},{"full_name":"Lotker, Zvi","last_name":"Lotker","first_name":"Zvi"}],"date_created":"2018-03-27T12:40:24Z","year":"2016","citation":{"short":"S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker, IEEE/ACM Trans. Netw. (2016) 1421--1433.","bibtex":"@article{Schmid_Avin_Scheideler_Borokhovich_Haeupler_Lotker_2016, title={SplayNet: Towards Locally Self-Adjusting Networks}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2410313\">10.1109/TNET.2015.2410313</a>}, number={3}, journal={IEEE/ACM Trans. Netw.}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard and Lotker, Zvi}, year={2016}, pages={1421--1433} }","mla":"Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.” <i>IEEE/ACM Trans. Netw.</i>, no. 3, 2016, pp. 1421--1433, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2410313\">10.1109/TNET.2015.2410313</a>.","apa":"Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., &#38; Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. <i>IEEE/ACM Trans. Netw.</i>, (3), 1421--1433. <a href=\"https://doi.org/10.1109/TNET.2015.2410313\">https://doi.org/10.1109/TNET.2015.2410313</a>","ieee":"S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, “SplayNet: Towards Locally Self-Adjusting Networks,” <i>IEEE/ACM Trans. Netw.</i>, no. 3, pp. 1421--1433, 2016.","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.” <i>IEEE/ACM Trans. Netw.</i>, no. 3 (2016): 1421--1433. <a href=\"https://doi.org/10.1109/TNET.2015.2410313\">https://doi.org/10.1109/TNET.2015.2410313</a>.","ama":"Schmid S, Avin C, Scheideler C, Borokhovich M, Haeupler B, Lotker Z. SplayNet: Towards Locally Self-Adjusting Networks. <i>IEEE/ACM Trans Netw</i>. 2016;(3):1421--1433. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2410313\">10.1109/TNET.2015.2410313</a>"},"page":"1421--1433","issue":"3"},{"user_id":"15504","series_title":"Lecture Notes in Computer Science","department":[{"_id":"79"}],"_id":"1836","language":[{"iso":"eng"}],"type":"conference","publication":"DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings","status":"public","date_created":"2018-03-27T12:41:45Z","author":[{"last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra","first_name":"Zahra"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Alexandra","full_name":"Porter, Alexandra","last_name":"Porter"},{"first_name":"Andrea","last_name":"W. Richa","full_name":"W. Richa, Andrea"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319","first_name":"Thim Frederik"}],"volume":9818,"date_updated":"2022-01-06T06:53:30Z","doi":"10.1007/978-3-319-43994-5_10","title":"On the Runtime of Universal Coating for Programmable Matter","publication_identifier":{"unknown":["978-3-319-43993-8"]},"citation":{"apa":"Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i> (Vol. 9818, pp. 148--164). <a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">https://doi.org/10.1007/978-3-319-43994-5_10</a>","mla":"Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable Matter.” <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>, vol. 9818, 2016, pp. 148--164, doi:<a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">10.1007/978-3-319-43994-5_10</a>.","short":"Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, in: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, pp. 148--164.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2016, series={Lecture Notes in Computer Science}, title={On the Runtime of Universal Coating for Programmable Matter}, volume={9818}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">10.1007/978-3-319-43994-5_10</a>}, booktitle={DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}, author={Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={148--164}, collection={Lecture Notes in Computer Science} }","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” In <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>, 9818:148--164. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">https://doi.org/10.1007/978-3-319-43994-5_10</a>.","ieee":"Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, and T. F. Strothmann, “On the Runtime of Universal Coating for Programmable Matter,” in <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>, 2016, vol. 9818, pp. 148--164.","ama":"Derakhshandeh Z, Gmyr R, Porter A, W. Richa A, Scheideler C, Strothmann TF. On the Runtime of Universal Coating for Programmable Matter. In: <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>. Vol 9818. Lecture Notes in Computer Science. ; 2016:148--164. doi:<a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">10.1007/978-3-319-43994-5_10</a>"},"intvolume":"      9818","page":"148--164","year":"2016"},{"department":[{"_id":"79"}],"user_id":"15504","_id":"1837","language":[{"iso":"eng"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016","type":"conference","status":"public","author":[{"full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh","first_name":"Zahra"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"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","id":"11319","full_name":"Strothmann, Thim Frederik"}],"date_created":"2018-03-27T12:44:09Z","date_updated":"2022-01-06T06:53:30Z","publisher":"ACM","doi":"10.1145/2935764.2935784","title":"Universal Shape Formation for Programmable Matter","publication_identifier":{"unknown":["978-1-4503-4210-0"]},"page":"289--299","citation":{"apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i> (pp. 289--299). ACM. <a href=\"https://doi.org/10.1145/2935764.2935784\">https://doi.org/10.1145/2935764.2935784</a>","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM, 2016, pp. 289--299.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016, title={Universal Shape Formation for Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={289--299} }","mla":"Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, ACM, 2016, pp. 289--299, doi:<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>.","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal Shape Formation for Programmable Matter. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. ACM; 2016:289--299. doi:<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, 289--299. ACM, 2016. <a href=\"https://doi.org/10.1145/2935764.2935784\">https://doi.org/10.1145/2935764.2935784</a>.","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal Shape Formation for Programmable Matter,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, 2016, pp. 289--299."},"year":"2016"},{"title":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016","doi":"10.1145/2935764","date_updated":"2022-01-06T06:53:32Z","date_created":"2018-03-28T05:44:12Z","year":"2016","citation":{"apa":"Scheideler, C., &#38; Gilbert, S. (Eds.). (2016). <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. <a href=\"https://doi.org/10.1145/2935764\">https://doi.org/10.1145/2935764</a>","mla":"Scheideler, Christian, and Seth Gilbert, editors. <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. 2016, doi:<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>.","bibtex":"@book{Scheideler_Gilbert_2016, title={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, DOI={<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>}, year={2016} }","short":"C. Scheideler, S. Gilbert, eds., Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016.","ama":"Scheideler C, Gilbert S, eds. <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>.; 2016. doi:<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>","chicago":"Scheideler, Christian, and Seth Gilbert, eds. <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, 2016. <a href=\"https://doi.org/10.1145/2935764\">https://doi.org/10.1145/2935764</a>.","ieee":"C. Scheideler and S. Gilbert, Eds., <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. 2016."},"publication_identifier":{"isbn":["978-1-4503-4210-0"]},"_id":"1844","department":[{"_id":"79"}],"user_id":"15504","editor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Seth","full_name":"Gilbert, Seth","last_name":"Gilbert"}],"status":"public","type":"conference_editor"},{"year":"2016","page":"999--1002","citation":{"ama":"W. Richa A, Scheideler C. Jamming-Resistant MAC Protocols for Wireless Networks. In: <i>Encyclopedia of Algorithms</i>. ; 2016:999--1002. doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>","ieee":"A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless Networks,” in <i>Encyclopedia of Algorithms</i>, 2016, pp. 999--1002.","chicago":"W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” In <i>Encyclopedia of Algorithms</i>, 999--1002, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">https://doi.org/10.1007/978-1-4939-2864-4_593</a>.","mla":"W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” <i>Encyclopedia of Algorithms</i>, 2016, pp. 999--1002, doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>.","bibtex":"@inbook{W. Richa_Scheideler_2016, title={Jamming-Resistant MAC Protocols for Wireless Networks}, DOI={<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>}, booktitle={Encyclopedia of Algorithms}, author={W. Richa, Andrea and Scheideler, Christian}, year={2016}, pages={999--1002} }","short":"A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.","apa":"W. Richa, A., &#38; Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In <i>Encyclopedia of Algorithms</i> (pp. 999--1002). <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">https://doi.org/10.1007/978-1-4939-2864-4_593</a>"},"date_updated":"2022-01-06T06:53:32Z","date_created":"2018-03-28T05:45:04Z","author":[{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"Jamming-Resistant MAC Protocols for Wireless Networks","doi":"10.1007/978-1-4939-2864-4_593","publication":"Encyclopedia of Algorithms","type":"book_chapter","status":"public","_id":"1845","department":[{"_id":"79"}],"user_id":"15504"}]