--- _id: '1812' author: - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for the finite departure problem in overlay networks. Inf Comput. 2017:408--424. doi:10.1016/j.ic.2016.12.006 apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. Inf. Comput., 408--424. https://doi.org/10.1016/j.ic.2016.12.006 bibtex: '@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal approach for the finite departure problem in overlay networks}, DOI={10.1016/j.ic.2016.12.006}, journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }' chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Inf. Comput., 2017, 408--424. https://doi.org/10.1016/j.ic.2016.12.006. ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal approach for the finite departure problem in overlay networks,” Inf. Comput., pp. 408--424, 2017. mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Inf. Comput., 2017, pp. 408--424, doi:10.1016/j.ic.2016.12.006. short: A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424. date_created: 2018-03-27T11:23:36Z date_updated: 2022-01-06T06:53:26Z department: - _id: '79' doi: 10.1016/j.ic.2016.12.006 language: - iso: eng page: 408--424 publication: Inf. Comput. status: public title: Towards a universal approach for the finite departure problem in overlay networks type: journal_article user_id: '15504' year: '2017' ... --- _id: '1813' author: - first_name: Sandor full_name: P. Fekete, Sandor last_name: P. Fekete - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Kay full_name: Römer, Kay last_name: Römer - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News. 2017;(2):87--94. doi:10.1145/3106700.3106713 apa: P. Fekete, S., W. Richa, A., Römer, K., & Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News, (2), 87--94. https://doi.org/10.1145/3106700.3106713 bibtex: '@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271}, DOI={10.1145/3106700.3106713}, 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} }' chicago: 'P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT News, no. 2 (2017): 87--94. https://doi.org/10.1145/3106700.3106713.' ieee: S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271,” SIGACT News, no. 2, pp. 87--94, 2017. mla: P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713. short: S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94. date_created: 2018-03-27T11:24:15Z date_updated: 2022-01-06T06:53:26Z department: - _id: '79' doi: 10.1145/3106700.3106713 issue: '2' page: 87--94 publication: SIGACT News status: public title: Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271 type: journal_article user_id: '15504' year: '2017' ... --- _id: '1814' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal coating for programmable matter. Theor Comput Sci. 2017:56--68. doi:10.1016/j.tcs.2016.02.039 apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci., 56--68. https://doi.org/10.1016/j.tcs.2016.02.039 bibtex: '@article{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Universal coating for programmable matter}, DOI={10.1016/j.tcs.2016.02.039}, 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} }' chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.” Theor. Comput. Sci., 2017, 56--68. https://doi.org/10.1016/j.tcs.2016.02.039. ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal coating for programmable matter,” Theor. Comput. Sci., pp. 56--68, 2017. mla: Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” Theor. Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039. short: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor. Comput. Sci. (2017) 56--68. date_created: 2018-03-27T11:24:57Z date_updated: 2022-01-06T06:53:26Z department: - _id: '79' doi: 10.1016/j.tcs.2016.02.039 language: - iso: eng page: 56--68 publication: Theor. Comput. Sci. status: public title: Universal coating for programmable matter type: journal_article user_id: '15504' year: '2017' ... --- _id: '1815' author: - first_name: Joshua full_name: J. Daymude, Joshua last_name: J. Daymude - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'J. Daymude J, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Improved Leader Election for Self-organizing Programmable Matter. 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:127--140. doi:10.1007/978-3-319-72751-6_10' apa: J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2017). Improved Leader Election for Self-organizing Programmable Matter. 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 (pp. 127--140). https://doi.org/10.1007/978-3-319-72751-6_10 bibtex: '@inproceedings{J. Daymude_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Improved Leader Election for Self-organizing Programmable Matter}, DOI={10.1007/978-3-319-72751-6_10}, 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} }' chicago: J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable Matter.” 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, 127--140, 2017. https://doi.org/10.1007/978-3-319-72751-6_10. ieee: J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Improved Leader Election for Self-organizing Programmable Matter,” 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. mla: J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable Matter.” 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, doi:10.1007/978-3-319-72751-6_10. 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.' date_created: 2018-03-27T11:25:58Z date_updated: 2022-01-06T06:53:26Z department: - _id: '79' doi: 10.1007/978-3-319-72751-6_10 language: - iso: eng page: 127--140 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 title: Improved Leader Election for Self-organizing Programmable Matter type: conference user_id: '15504' year: '2017' ... --- _id: '1820' citation: ama: Scheideler C, Taghi Hajiaghayi M, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017.; 2017. doi:10.1145/3087556 apa: Scheideler, C., & Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. https://doi.org/10.1145/3087556 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={10.1145/3087556}, year={2017} }' chicago: Scheideler, Christian, and Mohammad 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. https://doi.org/10.1145/3087556. ieee: C. Scheideler and 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. mla: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. 2017, doi:10.1145/3087556. 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. date_created: 2018-03-27T11:29:10Z date_updated: 2022-01-06T06:53:27Z department: - _id: '79' doi: 10.1145/3087556 editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Mohammad full_name: Taghi Hajiaghayi, Mohammad last_name: Taghi Hajiaghayi publication_identifier: isbn: - 978-1-4503-4593-4 status: public title: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017 type: conference_editor user_id: '15504' year: '2017' ... --- _id: '81' author: - first_name: Linghui full_name: Luo, Linghui last_name: Luo citation: ama: 'Luo L. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn; 2017.' apa: 'Luo, L. (2017). MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn.' bibtex: '@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2017} }' chicago: 'Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.' ieee: 'L. Luo, MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn, 2017.' mla: 'Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.' short: 'L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained, Universität Paderborn, 2017.' date_created: 2017-10-17T12:41:07Z date_updated: 2022-01-06T07:03:50Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: 'MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained' type: mastersthesis user_id: '477' year: '2017' ... --- _id: '5980' citation: ama: Scheideler C, Taghi Hajiaghayi M, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM; 2017. doi:10.1145/3087556 apa: Scheideler, C., & Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM. https://doi.org/10.1145/3087556 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={10.1145/3087556}, publisher={ACM}, year={2017} }' chicago: Scheideler, Christian, and Mohammad 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. https://doi.org/10.1145/3087556. ieee: C. Scheideler and 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. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM, 2017, doi:10.1145/3087556. 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. date_created: 2018-11-29T10:23:12Z date_updated: 2022-01-06T07:02:48Z department: - _id: '7' - _id: '79' doi: 10.1145/3087556 editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Mohammad full_name: Taghi Hajiaghayi, Mohammad last_name: Taghi Hajiaghayi language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication_identifier: isbn: - 978-1-4503-4593-4 publisher: ACM status: public title: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017 type: conference_editor user_id: '477' year: '2017' ... --- _id: '61' author: - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: Strothmann TF. Self-* Algorithms for Distributed Systems. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-150 apa: Strothmann, T. F. (2017). Self-* Algorithms for Distributed Systems. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-150 bibtex: '@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems}, DOI={10.17619/UNIPB/1-150}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017} }' chicago: Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-150. ieee: T. F. Strothmann, Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017. mla: Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-150. short: T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn, 2017. date_created: 2017-10-17T12:41:03Z date_updated: 2022-01-06T07:02:52Z department: - _id: '79' doi: 10.17619/UNIPB/1-150 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Self-* Algorithms for Distributed Systems type: dissertation user_id: '477' year: '2017' ... --- _id: '699' author: - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: ama: Sundermeier J. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn; 2017. apa: Sundermeier, J. (2017). Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn. 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} }' chicago: Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017. ieee: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017. mla: Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017. short: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017. date_created: 2017-11-14T08:03:45Z date_updated: 2022-01-06T07:03:25Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions type: mastersthesis user_id: '38705' year: '2017' ... --- _id: '700' author: - first_name: Till full_name: Knollmann, Till last_name: Knollmann citation: ama: Knollmann T. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn; 2017. apa: Knollmann, T. (2017). A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn. bibtex: '@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017} }' chicago: Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017. ieee: T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017. mla: Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017. short: T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität Paderborn, 2017. date_created: 2017-11-14T08:04:35Z date_updated: 2022-01-06T07:03:26Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: A Self-Stabilizing Protocol for Graphs of Diameter Two type: mastersthesis user_id: '477' year: '2017' ... --- _id: '701' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte citation: ama: Götte T. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn; 2017. apa: Götte, T. (2017). Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn. bibtex: '@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2017} }' chicago: Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017. ieee: T. Götte, Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017. mla: Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017. short: T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn, 2017. date_created: 2017-11-14T09:32:39Z date_updated: 2022-01-06T07:03:26Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Self-Stabilizing Spanners for Tree Metrics type: mastersthesis user_id: '477' year: '2017' ... --- _id: '105' abstract: - lang: eng 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. author: - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP). Leibniz International Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:10.4230/LIPIcs.ICALP.2017.137' apa: 'Gmyr, R., Hinnenthal, K., Scheideler, C., & Sohler, C. (2017). Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP) (pp. 137:1--137:15). https://doi.org/10.4230/LIPIcs.ICALP.2017.137' 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={10.4230/LIPIcs.ICALP.2017.137}, 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)} }' chicago: 'Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings in Informatics (LIPIcs), 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.137.' ieee: 'R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring of Network Properties: The Power of Hybrid Networks,” in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.' mla: 'Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.' 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.' date_created: 2017-10-17T12:41:12Z date_updated: 2022-01-06T06:50:42Z ddc: - '040' department: - _id: '79' doi: 10.4230/LIPIcs.ICALP.2017.137 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-13T09:23:11Z date_updated: 2018-03-13T09:23:11Z file_id: '1207' file_name: 105-ICALP17-GHSS.pdf file_size: 504161 relation: main_file success: 1 file_date_updated: 2018-03-13T09:23:11Z has_accepted_license: '1' language: - iso: eng page: 137:1--137:15 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP) series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'Distributed Monitoring of Network Properties: The Power of Hybrid Networks' type: conference user_id: '20792' year: '2017' ... --- _id: '125' 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.' author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Scheideler C. A Self-Stabilizing General De Bruijn Graph. In: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 10616. Lecture Notes in Computer Science. Springer, Cham; 2017:250-264. doi:10.1007/978-3-319-69084-1_17' apa: Feldmann, M., & Scheideler, C. (2017). A Self-Stabilizing General De Bruijn Graph. In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264). Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_17 bibtex: '@inproceedings{Feldmann_Scheideler_2017, series={Lecture Notes in Computer Science}, title={A Self-Stabilizing General De Bruijn Graph}, volume={10616}, DOI={10.1007/978-3-319-69084-1_17}, 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} }' chicago: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 10616:250–64. Lecture Notes in Computer Science. Springer, Cham, 2017. https://doi.org/10.1007/978-3-319-69084-1_17. ieee: M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,” in Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, vol. 10616, pp. 250–264. mla: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 10616, Springer, Cham, 2017, pp. 250–64, doi:10.1007/978-3-319-69084-1_17. 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.' date_created: 2017-10-17T12:41:16Z date_updated: 2022-01-06T06:51:19Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-69084-1_17 external_id: arxiv: - '1708.06542' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:30:13Z date_updated: 2018-10-31T13:30:13Z file_id: '5214' file_name: Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf file_size: 311204 relation: main_file success: 1 file_date_updated: 2018-10-31T13:30:13Z has_accepted_license: '1' intvolume: ' 10616' language: - iso: eng page: '250-264 ' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publication_identifier: isbn: - 978-3-319-69083-4 publication_status: published publisher: Springer, Cham series_title: Lecture Notes in Computer Science status: public title: A Self-Stabilizing General De Bruijn Graph type: conference user_id: '23538' volume: 10616 year: '2017' ... --- _id: '215' 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.' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783' apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427). https://doi.org/10.1145/2935764.2935783 bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783}, 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} }' chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016. https://doi.org/10.1145/2935764.2935783. ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427. mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783. 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.' date_created: 2017-10-17T12:41:33Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1145/2935764.2935783 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:41:40Z date_updated: 2018-03-21T10:41:40Z file_id: '1518' file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf file_size: 352996 relation: main_file success: 1 file_date_updated: 2018-03-21T10:41:40Z has_accepted_license: '1' language: - iso: eng page: 417--427 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration type: conference user_id: '14955' year: '2016' ... --- _id: '18025' author: - first_name: Sebastian full_name: Heuchler, Sebastian last_name: Heuchler citation: ama: 'Heuchler S. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem.; 2016.' apa: 'Heuchler, S. (2016). Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem.' bibtex: '@book{Heuchler_2016, title={Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem}, author={Heuchler, Sebastian}, year={2016} }' chicago: 'Heuchler, Sebastian. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.' ieee: 'S. Heuchler, Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem. 2016.' mla: 'Heuchler, Sebastian. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem. 2016.' short: 'S. Heuchler, Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.' date_created: 2020-08-18T08:38:22Z date_updated: 2022-01-06T06:53:25Z department: - _id: '79' language: - iso: eng status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: 'Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem' type: bachelorsthesis user_id: '15504' year: '2016' ... --- _id: '1835' author: - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Michael full_name: Borokhovich, Michael last_name: Borokhovich - first_name: Bernhard full_name: Haeupler, Bernhard last_name: Haeupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker citation: ama: 'Schmid S, Avin C, Scheideler C, Borokhovich M, Haeupler B, Lotker Z. SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans Netw. 2016;(3):1421--1433. doi:10.1109/TNET.2015.2410313' apa: 'Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., & Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw., (3), 1421--1433. https://doi.org/10.1109/TNET.2015.2410313' bibtex: '@article{Schmid_Avin_Scheideler_Borokhovich_Haeupler_Lotker_2016, title={SplayNet: Towards Locally Self-Adjusting Networks}, DOI={10.1109/TNET.2015.2410313}, 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} }' chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.” IEEE/ACM Trans. Netw., no. 3 (2016): 1421--1433. https://doi.org/10.1109/TNET.2015.2410313.' ieee: 'S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, “SplayNet: Towards Locally Self-Adjusting Networks,” IEEE/ACM Trans. Netw., no. 3, pp. 1421--1433, 2016.' mla: 'Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.” IEEE/ACM Trans. Netw., no. 3, 2016, pp. 1421--1433, doi:10.1109/TNET.2015.2410313.' short: S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker, IEEE/ACM Trans. Netw. (2016) 1421--1433. date_created: 2018-03-27T12:40:24Z date_updated: 2022-01-06T06:53:29Z department: - _id: '79' doi: 10.1109/TNET.2015.2410313 issue: '3' page: 1421--1433 publication: IEEE/ACM Trans. Netw. status: public title: 'SplayNet: Towards Locally Self-Adjusting Networks' type: journal_article user_id: '15504' year: '2016' ... --- _id: '1836' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Alexandra full_name: Porter, Alexandra last_name: Porter - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Derakhshandeh Z, Gmyr R, Porter A, W. Richa A, Scheideler C, Strothmann TF. On the Runtime of Universal Coating for Programmable Matter. In: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings. Vol 9818. Lecture Notes in Computer Science. ; 2016:148--164. doi:10.1007/978-3-319-43994-5_10' apa: Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp. 148--164). https://doi.org/10.1007/978-3-319-43994-5_10 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={10.1007/978-3-319-43994-5_10}, 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 DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 9818:148--164. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-43994-5_10. 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 DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, vol. 9818, pp. 148--164. mla: Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable Matter.” DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, vol. 9818, 2016, pp. 148--164, doi:10.1007/978-3-319-43994-5_10. 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.' date_created: 2018-03-27T12:41:45Z date_updated: 2022-01-06T06:53:30Z department: - _id: '79' doi: 10.1007/978-3-319-43994-5_10 intvolume: ' 9818' language: - iso: eng page: 148--164 publication: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings publication_identifier: unknown: - 978-3-319-43993-8 series_title: Lecture Notes in Computer Science status: public title: On the Runtime of Universal Coating for Programmable Matter type: conference user_id: '15504' volume: 9818 year: '2016' ... --- _id: '1837' author: - first_name: Zahra full_name: Derakhshandeh, Zahra last_name: Derakhshandeh - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal Shape Formation for Programmable Matter. 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:289--299. doi:10.1145/2935764.2935784' apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. 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 (pp. 289--299). ACM. https://doi.org/10.1145/2935764.2935784 bibtex: '@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016, title={Universal Shape Formation for Programmable Matter}, DOI={10.1145/2935764.2935784}, 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} }' chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.” 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, 289--299. ACM, 2016. https://doi.org/10.1145/2935764.2935784. ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal Shape Formation for Programmable Matter,” 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, 2016, pp. 289--299. mla: Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.” 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, doi:10.1145/2935764.2935784. 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.' date_created: 2018-03-27T12:44:09Z date_updated: 2022-01-06T06:53:30Z department: - _id: '79' doi: 10.1145/2935764.2935784 language: - iso: eng page: 289--299 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 publication_identifier: unknown: - 978-1-4503-4210-0 publisher: ACM status: public title: Universal Shape Formation for Programmable Matter type: conference user_id: '15504' year: '2016' ... --- _id: '1844' citation: ama: Scheideler C, Gilbert S, 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. doi:10.1145/2935764 apa: Scheideler, C., & Gilbert, S. (Eds.). (2016). 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. https://doi.org/10.1145/2935764 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={10.1145/2935764}, year={2016} }' chicago: Scheideler, Christian, and Seth 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. https://doi.org/10.1145/2935764. ieee: C. Scheideler and 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. mla: Scheideler, Christian, and Seth Gilbert, editors. 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, doi:10.1145/2935764. 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. date_created: 2018-03-28T05:44:12Z date_updated: 2022-01-06T06:53:32Z department: - _id: '79' doi: 10.1145/2935764 editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Seth full_name: Gilbert, Seth last_name: Gilbert publication_identifier: isbn: - 978-1-4503-4210-0 status: public 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 type: conference_editor user_id: '15504' year: '2016' ... --- _id: '1845' author: - first_name: Andrea full_name: W. Richa, Andrea last_name: W. Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'W. Richa A, Scheideler C. Jamming-Resistant MAC Protocols for Wireless Networks. In: Encyclopedia of Algorithms. ; 2016:999--1002. doi:10.1007/978-1-4939-2864-4_593' apa: W. Richa, A., & Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In Encyclopedia of Algorithms (pp. 999--1002). https://doi.org/10.1007/978-1-4939-2864-4_593 bibtex: '@inbook{W. Richa_Scheideler_2016, title={Jamming-Resistant MAC Protocols for Wireless Networks}, DOI={10.1007/978-1-4939-2864-4_593}, booktitle={Encyclopedia of Algorithms}, author={W. Richa, Andrea and Scheideler, Christian}, year={2016}, pages={999--1002} }' chicago: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” In Encyclopedia of Algorithms, 999--1002, 2016. https://doi.org/10.1007/978-1-4939-2864-4_593. ieee: A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless Networks,” in Encyclopedia of Algorithms, 2016, pp. 999--1002. mla: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” Encyclopedia of Algorithms, 2016, pp. 999--1002, doi:10.1007/978-1-4939-2864-4_593. short: 'A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.' date_created: 2018-03-28T05:45:04Z date_updated: 2022-01-06T06:53:32Z department: - _id: '79' doi: 10.1007/978-1-4939-2864-4_593 page: 999--1002 publication: Encyclopedia of Algorithms status: public title: Jamming-Resistant MAC Protocols for Wireless Networks type: book_chapter user_id: '15504' year: '2016' ...