--- _id: '43109' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christina full_name: Kolb, Christina last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor Comput Sci. 2023;950:113756. doi:10.1016/j.tcs.2023.113756' apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950, 113756. https://doi.org/10.1016/j.tcs.2023.113756' bibtex: '@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={10.1016/j.tcs.2023.113756}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }' chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci. 950 (2023): 113756. https://doi.org/10.1016/j.tcs.2023.113756.' ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi: 10.1016/j.tcs.2023.113756.' mla: 'Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.' short: T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756. date_created: 2023-03-27T07:45:44Z date_updated: 2023-03-27T09:55:04Z department: - _id: '79' doi: 10.1016/j.tcs.2023.113756 intvolume: ' 950' language: - iso: eng page: '113756' project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' publication: Theor. Comput. Sci. status: public title: 'Beep-and-Sleep: Message and Energy Efficient Set Cover' type: journal_article user_id: '15504' volume: 950 year: '2023' ... --- _id: '45188' author: - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Sam full_name: Coy, Sam last_name: Coy - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Philipp full_name: Schneider, Philipp last_name: Schneider citation: ama: 'Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:10.48550/ARXIV.2210.05333' apa: Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., & Schneider, P. (2023). Routing Schemes for Hybrid Communication Networks. https://doi.org/10.48550/ARXIV.2210.05333 bibtex: '@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={10.48550/ARXIV.2210.05333}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }' chicago: Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. https://doi.org/10.48550/ARXIV.2210.05333. ieee: 'J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: 10.48550/ARXIV.2210.05333.' mla: Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333. short: 'J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.' date_created: 2023-05-22T09:17:50Z date_updated: 2023-05-22T09:37:25Z department: - _id: '79' doi: 10.48550/ARXIV.2210.05333 language: - iso: eng project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' status: public title: Routing Schemes for Hybrid Communication Networks type: conference user_id: '50024' year: '2023' ... --- _id: '45193' author: - first_name: Jinfeng full_name: Dou, Jinfeng id: '92888' last_name: Dou - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Henning full_name: Hillebrandt, Henning last_name: Hillebrandt - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. In: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23). ; 2023.' apa: 'Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2023). Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23). ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA.' bibtex: '@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2023, title={Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs}, booktitle={Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)}, author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, year={2023} }' chicago: 'Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” In Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.' ieee: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs,” presented at the ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA, 2023.' mla: 'Dou, Jinfeng, et al. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.' short: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.' conference: end_date: 2023-06-25 location: Orlando, USA name: ACM Symposium on Principles of Distributed Computing (PODC) start_date: 2023-06-19 date_created: 2023-05-22T14:42:31Z date_updated: 2023-05-22T16:04:56Z language: - iso: eng project: - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' - _id: '1' name: 'SFB 901: SFB 901' publication: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23) status: public title: 'Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs' type: conference user_id: '34727' year: '2023' ... --- _id: '45192' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - 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: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. Distributed Computing. Published online 2023. doi:https://doi.org/10.1007/s00446-023-00442-4 apa: Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (2023). Time-Optimal Construction of Overlays. Distributed Computing. https://doi.org/10.1007/s00446-023-00442-4 bibtex: '@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal Construction of Overlays}, DOI={https://doi.org/10.1007/s00446-023-00442-4}, journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, year={2023} }' chicago: Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” Distributed Computing, 2023. https://doi.org/10.1007/s00446-023-00442-4. ieee: 'T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” Distributed Computing, 2023, doi: https://doi.org/10.1007/s00446-023-00442-4.' mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Distributed Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4. short: T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023). date_created: 2023-05-22T14:34:34Z date_updated: 2023-05-23T12:38:57Z doi: https://doi.org/10.1007/s00446-023-00442-4 language: - iso: eng project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '13' name: 'SFB 901 - C1: SFB 901 - Subproject C1' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' publication: Distributed Computing status: public title: Time-Optimal Construction of Overlays type: journal_article user_id: '477' year: '2023' ... --- _id: '45875' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Götte T, Knollmann T, Meyer auf der Heide F, Scheideler C, Werthmann J. Capabilities and Limitations of Local Strategies in Dynamic Networks. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:1--20. doi:10.5281/zenodo.8060372' apa: Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., & Werthmann, J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8060372 bibtex: '@inbook{Götte_Knollmann_Meyer auf der Heide_Scheideler_Werthmann_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Capabilities and Limitations of Local Strategies in Dynamic Networks}, volume={412}, DOI={10.5281/zenodo.8060372}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Werthmann, Julian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={1--20}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }' chicago: 'Götte, Thorsten, Till Knollmann, Friedhelm Meyer auf der Heide, Christian Scheideler, and Julian Werthmann. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:1--20. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8060372.' ieee: 'T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann, “Capabilities and Limitations of Local Strategies in Dynamic Networks,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.' mla: Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:10.5281/zenodo.8060372. short: 'T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.' date_created: 2023-07-07T06:21:38Z date_updated: 2023-07-07T06:21:57Z ddc: - '004' department: - _id: '7' doi: 10.5281/zenodo.8060372 editor: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen last_name: Haake - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm last_name: Meyer auf der Heide - first_name: Marco full_name: Platzner, Marco last_name: Platzner - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim file: - access_level: open_access content_type: application/pdf creator: ups date_created: 2023-07-07T06:20:43Z date_updated: 2023-07-07T06:20:43Z file_id: '45876' file_name: A1-Chapter-SFB-Buch-Final.pdf file_size: 543715 relation: main_file file_date_updated: 2023-07-07T06:20:43Z has_accepted_license: '1' intvolume: ' 412' language: - iso: eng oa: '1' page: 1--20 place: Paderborn project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' grant_number: '160364472' name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)' publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets publisher: Heinz Nixdorf Institut, Universität Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Capabilities and Limitations of Local Strategies in Dynamic Networks type: book_chapter user_id: '477' volume: 412 year: '2023' ... --- _id: '45891' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Fabian full_name: Eidens, Fabian id: '25078' last_name: Eidens - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: David full_name: Niehues, David id: '36113' last_name: Niehues - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Blömer J, Eidens F, Jager T, Niehues D, Scheideler C. Robustness and Security. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:10.5281/zenodo.8068629' apa: Blömer, J., Eidens, F., Jager, T., Niehues, D., & Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068629 bibtex: '@inbook{Blömer_Eidens_Jager_Niehues_Scheideler_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Robustness and Security}, volume={412}, DOI={10.5281/zenodo.8068629}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes and Eidens, Fabian and Jager, Tibor and Niehues, David and Scheideler, Christian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={145–164}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }' chicago: 'Blömer, Johannes, Fabian Eidens, Tibor Jager, David Niehues, and Christian Scheideler. “Robustness and Security.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:145–64. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068629.' ieee: 'J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–164.' mla: Blömer, Johannes, et al. “Robustness and Security.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:10.5281/zenodo.8068629. short: 'J. Blömer, F. Eidens, T. Jager, D. Niehues, C. Scheideler, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 145–164.' date_created: 2023-07-07T08:08:47Z date_updated: 2023-07-07T11:18:21Z ddc: - '004' department: - _id: '7' doi: 10.5281/zenodo.8068629 editor: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen last_name: Haake - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm last_name: Meyer auf der Heide - first_name: Marco full_name: Platzner, Marco last_name: Platzner - first_name: Henning full_name: Wachsmuth, Henning last_name: Wachsmuth - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2023-07-07T08:08:37Z date_updated: 2023-07-07T11:18:21Z file_id: '45892' file_name: C1-Chapter-SFB-Buch-Final.pdf file_size: 320980 relation: main_file file_date_updated: 2023-07-07T11:18:21Z has_accepted_license: '1' intvolume: ' 412' language: - iso: eng oa: '1' page: 145-164 place: Paderborn project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '13' name: 'SFB 901 - C1: SFB 901 - Subproject C1' publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets publisher: Heinz Nixdorf Institut, Universität Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Robustness and Security type: book_chapter user_id: '477' volume: 412 year: '2023' ... --- _id: '31060' author: - first_name: Michael full_name: Feldmann, Michael last_name: Feldmann - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Shlomi full_name: Dolev, Shlomi last_name: Dolev citation: ama: Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. J Comput Biol. 2022;29(4):317–343. doi:10.1089/cmb.2021.0363 apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2022). Coordinating Amoebots via Reconfigurable Circuits. J. Comput. Biol., 29(4), 317–343. https://doi.org/10.1089/cmb.2021.0363 bibtex: '@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={29}, DOI={10.1089/cmb.2021.0363}, number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343} }' chicago: 'Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol. 29, no. 4 (2022): 317–343. https://doi.org/10.1089/cmb.2021.0363.' ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” J. Comput. Biol., vol. 29, no. 4, pp. 317–343, 2022, doi: 10.1089/cmb.2021.0363.' mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363. short: M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343. date_created: 2022-05-04T12:29:22Z date_updated: 2022-05-04T12:31:27Z department: - _id: '79' doi: 10.1089/cmb.2021.0363 intvolume: ' 29' issue: '4' language: - iso: eng page: 317–343 publication: J. Comput. Biol. status: public title: Coordinating Amoebots via Reconfigurable Circuits type: journal_article user_id: '15504' volume: 29 year: '2022' ... --- _id: '32602' author: - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Daniel full_name: Warner, Daniel id: '3902' last_name: Warner citation: ama: 'Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8' apa: Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8 bibtex: '@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238}, DOI={10.4230/LIPIcs.DNA.28.8}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” In 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.8.' ieee: 'A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi: 10.4230/LIPIcs.DNA.28.8.' mla: Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8. short: 'A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.' date_created: 2022-08-08T17:32:19Z date_updated: 2022-11-17T14:18:24Z department: - _id: '79' doi: 10.4230/LIPIcs.DNA.28.8 editor: - first_name: Thomas E. full_name: Ouldridge, Thomas E. last_name: Ouldridge - first_name: Shelley F. J. full_name: Wickham, Shelley F. J. last_name: Wickham intvolume: ' 238' language: - iso: eng page: 8:1–8:22 place: Dagstuhl, Germany project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' - _id: '13' name: 'SFB 901 - C1: SFB 901 - Subproject C1' publication: 28th International Conference on DNA Computing and Molecular Programming (DNA 28) publication_identifier: isbn: - 978-3-95977-253-2 issn: - 1868-8969 publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: The Structural Power of Reconfigurable Circuits in the Amoebot Model type: conference user_id: '477' volume: 238 year: '2022' ... --- _id: '32603' author: - first_name: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Daniel full_name: Warner, Daniel id: '3902' last_name: Warner citation: ama: 'Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9' apa: Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.9 bibtex: '@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant Shape Formation in the Amoebot Model}, volume={238}, DOI={10.4230/LIPIcs.DNA.28.9}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation in the Amoebot Model.” In 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.9.' ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi: 10.4230/LIPIcs.DNA.28.9.' mla: Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9. short: 'I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22.' date_created: 2022-08-08T17:42:43Z date_updated: 2022-11-17T14:17:09Z department: - _id: '79' doi: 10.4230/LIPIcs.DNA.28.9 editor: - first_name: Thomas E. full_name: Ouldridge, Thomas E. last_name: Ouldridge - first_name: Shelley F. J. full_name: Wickham, Shelley F. J. last_name: Wickham intvolume: ' 238' language: - iso: eng page: 9:1–9:22 place: Dagstuhl, Germany project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '13' name: 'SFB 901 - C1: SFB 901 - Subproject C1' publication: 28th International Conference on DNA Computing and Molecular Programming (DNA 28) publication_identifier: isbn: - 978-3-95977-253-2 issn: - 1868-8969 publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Fault-Tolerant Shape Formation in the Amoebot Model type: conference user_id: '477' volume: 238 year: '2022' ... --- _id: '33230' author: - first_name: Joshua J. full_name: Daymude, Joshua J. last_name: Daymude - first_name: Andréa W. full_name: Richa, Andréa W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:10.4230/LIPIcs.SAND.2022.12' apa: Daymude, J. J., Richa, A. W., & Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.12 bibtex: '@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}, volume={221}, DOI={10.4230/LIPIcs.SAND.2022.12}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19}, collection={LIPIcs} }' chicago: Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.12. ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi: 10.4230/LIPIcs.SAND.2022.12.' mla: Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12. short: 'J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.' date_created: 2022-08-30T06:31:21Z date_updated: 2022-08-30T06:33:44Z department: - _id: '79' doi: 10.4230/LIPIcs.SAND.2022.12 editor: - first_name: James full_name: Aspnes, James last_name: Aspnes - first_name: Othon full_name: Michail, Othon last_name: Michail intvolume: ' 221' language: - iso: eng page: 12:1–12:19 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems type: conference user_id: '15504' volume: 221 year: '2022' ... --- _id: '33240' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556' apa: 'Götte, T., & Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal & I.-T. A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022 (pp. 99–101). ACM. https://doi.org/10.1145/3490148.3538556' bibtex: '@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}, DOI={10.1145/3490148.3538556}, booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina}, year={2022}, pages={99–101} }' chicago: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” In SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. https://doi.org/10.1145/3490148.3538556.' ieee: 'T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101, doi: 10.1145/3490148.3538556.' mla: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.' short: 'T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.' date_created: 2022-09-01T07:55:00Z date_updated: 2022-09-01T07:57:53Z department: - _id: '79' doi: 10.1145/3490148.3538556 editor: - first_name: Kunal full_name: Agrawal, Kunal last_name: Agrawal - first_name: I-Ting Angelina full_name: Lee, I-Ting Angelina last_name: Lee language: - iso: eng page: 99–101 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '13' name: 'SFB 901 - C1: SFB 901 - Subproject C1' publication: 'SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022' publisher: ACM status: public title: 'Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion' type: conference user_id: '15504' year: '2022' ... --- _id: '30987' author: - first_name: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Daniel full_name: Warner, Daniel id: '3902' last_name: Warner citation: ama: 'Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23' apa: 'Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.23' bibtex: '@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}, volume={221}, DOI={10.4230/LIPIcs.SAND.2022.23}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={23:1–23:3}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.23.' ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022, vol. 221, p. 23:1–23:3, doi: 10.4230/LIPIcs.SAND.2022.23.' mla: 'Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.' short: 'I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.' date_created: 2022-05-03T00:13:06Z date_updated: 2022-10-27T08:45:52Z department: - _id: '79' doi: 10.4230/LIPIcs.SAND.2022.23 editor: - first_name: James full_name: Aspnes, James last_name: Aspnes - first_name: Othon full_name: Michail, Othon last_name: Michail intvolume: ' 221' language: - iso: eng page: 23:1–23:3 place: Dagstuhl, Germany project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '13' name: 'SFB 901 - C1: SFB 901 - Subproject C1' publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) publication_identifier: isbn: - 978-3-95977-224-2 issn: - 1868-8969 publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model' type: conference user_id: '15504' volume: 221 year: '2022' ... --- _id: '33967' author: - first_name: Marcos full_name: Aguiliera, Marcos last_name: Aguiliera - first_name: Andréa W. full_name: Richa, Andréa W. last_name: Richa - first_name: Alexander A. full_name: Schwarzmann, Alexander A. last_name: Schwarzmann - first_name: Alessandro full_name: Panconesi, Alessandro last_name: Panconesi - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Philipp full_name: Woelfel, Philipp last_name: Woelfel citation: ama: 'Aguiliera M, Richa AW, Schwarzmann AA, Panconesi A, Scheideler C, Woelfel P. 2022 Edsger W. Dijkstra Prize in Distributed Computing. In: Milani A, Woelfel P, eds. PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM; 2022:1. doi:10.1145/3519270.3538411' apa: 'Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler, C., & Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing. In A. Milani & P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 (p. 1). ACM. https://doi.org/10.1145/3519270.3538411' bibtex: '@inproceedings{Aguiliera_Richa_Schwarzmann_Panconesi_Scheideler_Woelfel_2022, title={2022 Edsger W. Dijkstra Prize in Distributed Computing}, DOI={10.1145/3519270.3538411}, booktitle={PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}, publisher={ACM}, author={Aguiliera, Marcos and Richa, Andréa W. and Schwarzmann, Alexander A. and Panconesi, Alessandro and Scheideler, Christian and Woelfel, Philipp}, editor={Milani, Alessia and Woelfel, Philipp}, year={2022}, pages={1} }' chicago: 'Aguiliera, Marcos, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, and Philipp Woelfel. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” In PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, 1. ACM, 2022. https://doi.org/10.1145/3519270.3538411.' ieee: 'M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler, and P. Woelfel, “2022 Edsger W. Dijkstra Prize in Distributed Computing,” in PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, 2022, p. 1, doi: 10.1145/3519270.3538411.' mla: 'Aguiliera, Marcos, et al. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:10.1145/3519270.3538411.' short: 'M. Aguiliera, A.W. Richa, A.A. Schwarzmann, A. Panconesi, C. Scheideler, P. Woelfel, in: A. Milani, P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, ACM, 2022, p. 1.' date_created: 2022-11-02T08:53:37Z date_updated: 2022-11-02T08:56:16Z department: - _id: '79' doi: 10.1145/3519270.3538411 editor: - first_name: Alessia full_name: Milani, Alessia last_name: Milani - first_name: Philipp full_name: Woelfel, Philipp last_name: Woelfel language: - iso: eng page: '1' project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' publication: 'PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022' publisher: ACM status: public title: 2022 Edsger W. Dijkstra Prize in Distributed Computing type: conference user_id: '15504' year: '2022' ... --- _id: '21096' abstract: - lang: eng text: While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys. article_number: '104697' author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697 apa: Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697 bibtex: '@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={10.1016/j.ic.2021.104697}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }' chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2021.104697. ieee: 'T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.' mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697. short: T. Knollmann, C. Scheideler, Information and Computation (2022). date_created: 2021-01-29T09:39:40Z date_updated: 2023-03-27T07:56:48Z department: - _id: '63' - _id: '79' doi: 10.1016/j.ic.2021.104697 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: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published status: public title: A self-stabilizing Hashed Patricia Trie type: journal_article user_id: '15504' year: '2022' ... --- _id: '25105' author: - first_name: Shlomi full_name: Dolev, Shlomi last_name: Dolev - first_name: Ram full_name: Prasadh Narayanan, Ram last_name: Prasadh Narayanan - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Dolev S, Prasadh Narayanan R, Scheideler C, Schindelhauer C. Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In: Galluccio L, Mitra U, Magarini M, Abada S, Taynnan Barros M, Krishnaswamy B, eds. NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021. ACM; 2021:30:1-30:2. doi:10.1145/3477206.3477471' apa: 'Dolev, S., Prasadh Narayanan, R., Scheideler, C., & Schindelhauer, C. (2021). Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, & B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 (p. 30:1-30:2). ACM. https://doi.org/10.1145/3477206.3477471' bibtex: '@inproceedings{Dolev_Prasadh Narayanan_Scheideler_Schindelhauer_2021, title={Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization}, DOI={10.1145/3477206.3477471}, booktitle={NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021}, publisher={ACM}, author={Dolev, Shlomi and Prasadh Narayanan, Ram and Scheideler, Christian and Schindelhauer, Christian}, editor={Galluccio, Laura and Mitra, Urbashi and Magarini, Maurizio and Abada, Sergi and Taynnan Barros, Michael and Krishnaswamy, Bhuvana}, year={2021}, pages={30:1-30:2} }' chicago: 'Dolev, Shlomi, Ram Prasadh Narayanan, Christian Scheideler, and Christian Schindelhauer. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” In NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio, Urbashi Mitra, Maurizio Magarini, Sergi Abada, Michael Taynnan Barros, and Bhuvana Krishnaswamy, 30:1-30:2. ACM, 2021. https://doi.org/10.1145/3477206.3477471.' ieee: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, and C. Schindelhauer, “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization,” in NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, 2021, p. 30:1-30:2, doi: 10.1145/3477206.3477471.' mla: 'Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.' short: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, C. Schindelhauer, in: L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, ACM, 2021, p. 30:1-30:2.' date_created: 2021-09-29T09:09:58Z date_updated: 2022-01-06T06:56:51Z doi: 10.1145/3477206.3477471 editor: - first_name: Laura full_name: Galluccio, Laura last_name: Galluccio - first_name: Urbashi full_name: Mitra, Urbashi last_name: Mitra - first_name: Maurizio full_name: Magarini, Maurizio last_name: Magarini - first_name: Sergi full_name: Abada, Sergi last_name: Abada - first_name: Michael full_name: Taynnan Barros, Michael last_name: Taynnan Barros - first_name: Bhuvana full_name: Krishnaswamy, Bhuvana last_name: Krishnaswamy language: - iso: eng page: 30:1-30:2 publication: 'NANOCOM ''21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021' publisher: ACM status: public title: Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization type: conference user_id: '15504' year: '2021' ... --- _id: '28917' author: - first_name: Michael full_name: Feldmann, Michael last_name: Feldmann - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Shlomi full_name: Dolev, Shlomi last_name: Dolev citation: ama: 'Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5\_34' apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2021). Coordinating Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, & S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings (Vol. 13046, pp. 484–488). Springer. https://doi.org/10.1007/978-3-030-91081-5\_34 bibtex: '@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={13046}, DOI={10.1007/978-3-030-91081-5\_34}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}, publisher={Springer}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, editor={Johnen, Colette and Michael Schiller, Elad and Schmid, Stefan}, year={2021}, pages={484–488}, collection={Lecture Notes in Computer Science} }' chicago: Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” In Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5\_34. ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” in Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, 2021, vol. 13046, pp. 484–488, doi: 10.1007/978-3-030-91081-5\_34.' mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5\_34. short: 'M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, Springer, 2021, pp. 484–488.' date_created: 2021-12-15T09:37:38Z date_updated: 2022-01-06T06:58:41Z department: - _id: '79' doi: 10.1007/978-3-030-91081-5\_34 editor: - first_name: Colette full_name: Johnen, Colette last_name: Johnen - first_name: Elad full_name: Michael Schiller, Elad last_name: Michael Schiller - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid intvolume: ' 13046' language: - iso: eng page: 484-488 publication: Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Coordinating Amoebots via Reconfigurable Circuits type: conference user_id: '15504' volume: 13046 year: '2021' ... --- _id: '27048' author: - first_name: Shlomi full_name: Dolev, Shlomi last_name: Dolev - first_name: Ram full_name: Prasadh Narayanan, Ram last_name: Prasadh Narayanan - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Dolev S, Prasadh Narayanan R, Scheideler C, Schindelhauer C. Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In: Galluccio L, Mitra U, Magarini M, Abada S, Taynnan Barros M, Krishnaswamy B, eds. NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021. ACM; 2021:30:1-30:2. doi:10.1145/3477206.3477471' apa: 'Dolev, S., Prasadh Narayanan, R., Scheideler, C., & Schindelhauer, C. (2021). Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, & B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 (p. 30:1-30:2). ACM. https://doi.org/10.1145/3477206.3477471' bibtex: '@inproceedings{Dolev_Prasadh Narayanan_Scheideler_Schindelhauer_2021, title={Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization}, DOI={10.1145/3477206.3477471}, booktitle={NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021}, publisher={ACM}, author={Dolev, Shlomi and Prasadh Narayanan, Ram and Scheideler, Christian and Schindelhauer, Christian}, editor={Galluccio, Laura and Mitra, Urbashi and Magarini, Maurizio and Abada, Sergi and Taynnan Barros, Michael and Krishnaswamy, Bhuvana}, year={2021}, pages={30:1-30:2} }' chicago: 'Dolev, Shlomi, Ram Prasadh Narayanan, Christian Scheideler, and Christian Schindelhauer. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” In NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio, Urbashi Mitra, Maurizio Magarini, Sergi Abada, Michael Taynnan Barros, and Bhuvana Krishnaswamy, 30:1-30:2. ACM, 2021. https://doi.org/10.1145/3477206.3477471.' ieee: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, and C. Schindelhauer, “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization,” in NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, 2021, p. 30:1-30:2, doi: 10.1145/3477206.3477471.' mla: 'Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.' short: 'S. Dolev, R. Prasadh Narayanan, C. Scheideler, C. Schindelhauer, in: L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, ACM, 2021, p. 30:1-30:2.' date_created: 2021-11-02T09:57:53Z date_updated: 2022-01-06T06:57:33Z doi: 10.1145/3477206.3477471 editor: - first_name: Laura full_name: Galluccio, Laura last_name: Galluccio - first_name: Urbashi full_name: Mitra, Urbashi last_name: Mitra - first_name: Maurizio full_name: Magarini, Maurizio last_name: Magarini - first_name: Sergi full_name: Abada, Sergi last_name: Abada - first_name: Michael full_name: Taynnan Barros, Michael last_name: Taynnan Barros - first_name: Bhuvana full_name: Krishnaswamy, Bhuvana last_name: Krishnaswamy language: - iso: eng page: 30:1-30:2 publication: 'NANOCOM ''21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021' publisher: ACM status: public title: Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization type: conference user_id: '15504' year: '2021' ... --- _id: '27050' author: - first_name: Joshua full_name: J. Daymude, Joshua last_name: J. Daymude - 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: 'J. Daymude J, W. Richa A, Scheideler C. The Canonical Amoebot Model: Algorithms and Concurrency Control. In: Gilbert S, ed. 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference). Vol 209. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:20:1-20:19. doi:10.4230/LIPIcs.DISC.2021.20' apa: 'J. Daymude, J., W. Richa, A., & Scheideler, C. (2021). The Canonical Amoebot Model: Algorithms and Concurrency Control. In S. Gilbert (Ed.), 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference) (Vol. 209, p. 20:1-20:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.20' bibtex: '@inproceedings{J. Daymude_W. Richa_Scheideler_2021, series={LIPIcs}, title={The Canonical Amoebot Model: Algorithms and Concurrency Control}, volume={209}, DOI={10.4230/LIPIcs.DISC.2021.20}, booktitle={35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={J. Daymude, Joshua and W. Richa, Andrea and Scheideler, Christian}, editor={Gilbert, Seth}, year={2021}, pages={20:1-20:19}, collection={LIPIcs} }' chicago: 'J. Daymude, Joshua, Andrea W. Richa, and Christian Scheideler. “The Canonical Amoebot Model: Algorithms and Concurrency Control.” In 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), edited by Seth Gilbert, 209:20:1-20:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.20.' ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “The Canonical Amoebot Model: Algorithms and Concurrency Control,” in 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), 2021, vol. 209, p. 20:1-20:19, doi: 10.4230/LIPIcs.DISC.2021.20.' mla: 'J. Daymude, Joshua, et al. “The Canonical Amoebot Model: Algorithms and Concurrency Control.” 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), edited by Seth Gilbert, vol. 209, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 20:1-20:19, doi:10.4230/LIPIcs.DISC.2021.20.' short: 'J. J. Daymude, A. W. Richa, C. Scheideler, in: S. Gilbert (Ed.), 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 20:1-20:19.' date_created: 2021-11-02T10:00:00Z date_updated: 2022-01-06T06:57:33Z doi: 10.4230/LIPIcs.DISC.2021.20 editor: - first_name: Seth full_name: Gilbert, Seth last_name: Gilbert intvolume: ' 209' language: - iso: eng page: 20:1-20:19 publication: 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference) publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: 'The Canonical Amoebot Model: Algorithms and Concurrency Control' type: conference user_id: '15504' volume: 209 year: '2021' ... --- _id: '22283' abstract: - lang: eng text: " We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n \ We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n \r\n Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$." author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - 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: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932' apa: 'Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. https://doi.org/10.1145/3465084.3467932' bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={10.1145/3465084.3467932}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }' chicago: 'Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel. New York: ACM, n.d. https://doi.org/10.1145/3465084.3467932.' ieee: T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), Virtual. mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932. short: 'T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.' conference: end_date: 2021-07-30 location: Virtual name: ACM Symposium on Principles of Distributed Computing (PODC) start_date: 2021-07-26 date_created: 2021-06-06T19:10:26Z date_updated: 2022-01-06T06:55:30Z ddc: - '000' department: - _id: '34' doi: 10.1145/3465084.3467932 editor: - first_name: Keren full_name: Censor-Hillel, Keren last_name: Censor-Hillel file: - access_level: closed content_type: application/pdf creator: thgoette date_created: 2021-06-06T19:12:49Z date_updated: 2021-06-06T19:12:49Z file_id: '22284' file_name: Wicked_Fast_Overlay_Construction(1).pdf file_size: 590875 relation: main_file success: 1 file_date_updated: 2021-06-06T19:12:49Z has_accepted_license: '1' language: - iso: eng place: New York project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 - _id: '1' name: SFB 901 publication: Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21) publication_status: accepted publisher: ACM status: public title: Time-Optimal Construction of Overlays type: conference user_id: '477' year: '2021' ... --- _id: '30217' author: - first_name: Sam full_name: Coy, Sam last_name: Coy - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Michael full_name: Feldmann, Michael last_name: Feldmann - first_name: Kristian full_name: Hinnenthal, Kristian last_name: Hinnenthal - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Philipp full_name: Schneider, Philipp last_name: Schneider - first_name: Martijn full_name: Struijs, Martijn last_name: Struijs citation: ama: 'Coy S, Czumaj A, Feldmann M, et al. Near-Shortest Path Routing in Hybrid Communication Networks. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. Vol 217. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:11:1–11:23. doi:10.4230/LIPIcs.OPODIS.2021.11' apa: Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P., & Struijs, M. (2021). Near-Shortest Path Routing in Hybrid Communication Networks. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France (Vol. 217, p. 11:1–11:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11 bibtex: '@inproceedings{Coy_Czumaj_Feldmann_Hinnenthal_Kuhn_Scheideler_Schneider_Struijs_2021, series={LIPIcs}, title={Near-Shortest Path Routing in Hybrid Communication Networks}, volume={217}, DOI={10.4230/LIPIcs.OPODIS.2021.11}, booktitle={25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Coy, Sam and Czumaj, Artur and Feldmann, Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp and Struijs, Martijn}, editor={Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, year={2021}, pages={11:1–11:23}, collection={LIPIcs} }' chicago: Coy, Sam, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. “Near-Shortest Path Routing in Hybrid Communication Networks.” In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11. ieee: 'S. Coy et al., “Near-Shortest Path Routing in Hybrid Communication Networks,” in 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, 2021, vol. 217, p. 11:1–11:23, doi: 10.4230/LIPIcs.OPODIS.2021.11.' mla: Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.” 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11. short: 'S. Coy, A. Czumaj, M. Feldmann, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, M. Struijs, in: Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23.' date_created: 2022-03-09T10:43:28Z date_updated: 2022-03-09T10:46:34Z department: - _id: '79' doi: 10.4230/LIPIcs.OPODIS.2021.11 editor: - first_name: Quentin full_name: Bramas, Quentin last_name: Bramas - first_name: Vincent full_name: Gramoli, Vincent last_name: Gramoli - first_name: Alessia full_name: Milani, Alessia last_name: Milani intvolume: ' 217' language: - iso: eng page: 11:1–11:23 publication: 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: Near-Shortest Path Routing in Hybrid Communication Networks type: conference user_id: '15504' volume: 217 year: '2021' ... --- _id: '26888' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: Algorithms for Sensor Systems (ALGOSENSORS ’21). ; 2021. doi:10.1007/978-3-030-89240-1_7' apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS ’21). ALGOSENSORS 2021, Lisbon, Portgual. https://doi.org/10.1007/978-3-030-89240-1_7' bibtex: '@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep: Message and Energy Efficient Set Cover}, DOI={10.1007/978-3-030-89240-1_7}, booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021} }' chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” In Algorithms for Sensor Systems (ALGOSENSORS ’21). Cham, 2021. https://doi.org/10.1007/978-3-030-89240-1_7.' ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.' mla: 'Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.' short: 'T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.' conference: location: Lisbon, Portgual name: ALGOSENSORS 2021 date_created: 2021-10-26T12:06:04Z date_updated: 2022-11-18T10:01:36Z doi: 10.1007/978-3-030-89240-1_7 language: - iso: eng place: Cham project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: 'SFB 901: SFB 901' publication: Algorithms for Sensor Systems (ALGOSENSORS '21) publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Beep-And-Sleep: Message and Energy Efficient Set Cover' type: book_chapter user_id: '477' year: '2021' ... --- _id: '27051' author: - first_name: John full_name: Augustine, John last_name: Augustine - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Philipp full_name: Schneider, Philipp last_name: Schneider citation: ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: Chawla S, ed. Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. SIAM; 2020:1280-1299. doi:10.1137/1.9781611975994.78' apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P. (2020). Shortest Paths in a Hybrid Network Model. In S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020 (pp. 1280–1299). SIAM. https://doi.org/10.1137/1.9781611975994.78 bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2020, title={Shortest Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78}, booktitle={Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020}, publisher={SIAM}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, editor={Chawla, Shuchi}, year={2020}, pages={1280–1299} }' chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, edited by Shuchi Chawla, 1280–99. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.78. ieee: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, 2020, pp. 1280–1299, doi: 10.1137/1.9781611975994.78.' mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, edited by Shuchi Chawla, SIAM, 2020, pp. 1280–99, doi:10.1137/1.9781611975994.78. short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, SIAM, 2020, pp. 1280–1299.' date_created: 2021-11-02T10:01:42Z date_updated: 2022-01-06T06:57:33Z doi: 10.1137/1.9781611975994.78 editor: - first_name: Shuchi full_name: Chawla, Shuchi last_name: Chawla language: - iso: eng page: 1280-1299 publication: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020 publisher: SIAM status: public title: Shortest Paths in a Hybrid Network Model type: conference user_id: '15504' year: '2020' ... --- _id: '17808' 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: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Dorian full_name: Rudolph, Dorian last_name: Rudolph - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim full_name: Strothmann, Thim last_name: Strothmann citation: ama: Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming tile shapes with simple robots. Nat Comput. 2020;19(2):375-390. doi:10.1007/s11047-019-09774-2 apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., & Strothmann, T. (2020). Forming tile shapes with simple robots. Nat. Comput., 19(2), 375–390. https://doi.org/10.1007/s11047-019-09774-2 bibtex: '@article{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2020, title={Forming tile shapes with simple robots}, volume={19}, DOI={10.1007/s11047-019-09774-2}, number={2}, journal={Nat. Comput.}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim}, year={2020}, pages={375–390} }' chicago: 'Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Strothmann. “Forming Tile Shapes with Simple Robots.” Nat. Comput. 19, no. 2 (2020): 375–90. https://doi.org/10.1007/s11047-019-09774-2.' ieee: R. Gmyr et al., “Forming tile shapes with simple robots,” Nat. Comput., vol. 19, no. 2, pp. 375–390, 2020. mla: Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Nat. Comput., vol. 19, no. 2, 2020, pp. 375–90, doi:10.1007/s11047-019-09774-2. short: R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T. Strothmann, Nat. Comput. 19 (2020) 375–390. date_created: 2020-08-11T10:57:26Z date_updated: 2022-01-06T06:53:20Z doi: 10.1007/s11047-019-09774-2 intvolume: ' 19' issue: '2' language: - iso: eng page: 375-390 publication: Nat. Comput. status: public title: Forming tile shapes with simple robots type: journal_article user_id: '15504' volume: 19 year: '2020' ... --- _id: '20755' abstract: - lang: eng text: "We consider the problem of computing shortest paths in \\emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31' apa: Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31 bibtex: '@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={10.4230/LIPIcs.OPODIS.2020.31}, booktitle={Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}, year={2020} }' chicago: Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31. ieee: M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), 2020. mla: Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31. short: 'M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.' date_created: 2020-12-16T10:20:18Z date_updated: 2022-01-06T06:54:36Z ddc: - '000' department: - _id: '79' doi: 10.4230/LIPIcs.OPODIS.2020.31 external_id: arxiv: - '2007.01191' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2020-12-16T10:18:50Z date_updated: 2020-12-16T10:18:50Z file_id: '20756' file_name: Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf file_size: 867373 relation: main_file success: 1 file_date_updated: 2020-12-16T10:18:50Z has_accepted_license: '1' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: SFB 901 publication: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS) publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik status: public title: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs type: conference user_id: '23538' year: '2020' ... --- _id: '16902' abstract: - lang: eng text: "The maintenance of efficient and robust overlay networks is one\r\nof the most fundamental and reoccurring themes in networking.\r\nThis paper presents a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto preserve connectivity, review algorithms for the fundamental\r\nproblem of graph linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable topologies. \r\nWe also identify open problems and avenues for future research.\r\n" 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 - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. 2020. doi:10.1145/3397190 apa: Feldmann, M., Scheideler, C., & Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. https://doi.org/10.1145/3397190 bibtex: '@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={10.1145/3397190}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }' chicago: Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, 2020. https://doi.org/10.1145/3397190. ieee: M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” ACM Computing Surveys, 2020. mla: Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190. short: M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020). date_created: 2020-04-29T07:09:50Z date_updated: 2022-01-06T06:52:58Z department: - _id: '79' doi: 10.1145/3397190 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: ACM Computing Surveys publisher: ACM status: public title: Survey on Algorithms for Self-Stabilizing Overlay Networks type: journal_article user_id: '23538' year: '2020' ... --- _id: '16903' abstract: - lang: eng text: "We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in \\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.\r\nAs is standard in clock synchronization, we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$ bits of memory required for any such protocol.\r\nAfterwards we present a protocol that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements." author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Ardalan full_name: Khazraei, Ardalan last_name: Khazraei - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2020. doi:10.1145/3350755.3400246' apa: Feldmann, M., Khazraei, A., & Scheideler, C. (2020). Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM. https://doi.org/10.1145/3350755.3400246 bibtex: '@inproceedings{Feldmann_Khazraei_Scheideler_2020, title={Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}, DOI={10.1145/3350755.3400246}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian}, year={2020} }' chicago: Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2020. https://doi.org/10.1145/3350755.3400246. ieee: M. Feldmann, A. Khazraei, and C. Scheideler, “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020. mla: Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246. short: 'M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.' date_created: 2020-04-29T07:16:35Z date_updated: 2022-01-06T06:52:58Z department: - _id: '79' doi: 10.1145/3350755.3400246 external_id: arxiv: - '2005.07388' language: - iso: eng project: - _id: '96' name: Algorithmen für programmierbare Materie in einem physiologischen Medium publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publisher: ACM status: public title: Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model type: conference user_id: '23538' year: '2020' ... --- _id: '15169' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM.' apa: 'Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). Kolkata, Indien: ACM.' bibtex: '@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }' chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d. ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien. mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM. short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.' conference: end_date: 07.01.2020 location: Kolkata, Indien name: '21st International Conference on Distributed Computing and Networking ' start_date: 04.01.2020 date_created: 2019-11-25T12:18:41Z date_updated: 2022-01-06T06:52:16Z department: - _id: '63' - _id: '79' 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: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN) publication_status: accepted publisher: ACM status: public title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks type: conference user_id: '477' year: '2020' ... --- _id: '16346' author: - first_name: Joshua J. full_name: Daymude, Joshua J. last_name: Daymude - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Andréa W. full_name: Richa, Andréa W. last_name: Richa citation: ama: 'Daymude JJ, Gmyr R, Hinnenthal K, Kostitsyna I, Scheideler C, Richa AW. Convex Hull Formation for Programmable Matter. In: Proceedings of the 21st International Conference on Distributed Computing and Networking. ; 2020. doi:10.1145/3369740.3372916' apa: Daymude, J. J., Gmyr, R., Hinnenthal, K., Kostitsyna, I., Scheideler, C., & Richa, A. W. (2020). Convex Hull Formation for Programmable Matter. In Proceedings of the 21st International Conference on Distributed Computing and Networking. https://doi.org/10.1145/3369740.3372916 bibtex: '@inproceedings{Daymude_Gmyr_Hinnenthal_Kostitsyna_Scheideler_Richa_2020, title={Convex Hull Formation for Programmable Matter}, DOI={10.1145/3369740.3372916}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking}, author={Daymude, Joshua J. and Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Scheideler, Christian and Richa, Andréa W.}, year={2020} }' chicago: Daymude, Joshua J., Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Christian Scheideler, and Andréa W. Richa. “Convex Hull Formation for Programmable Matter.” In Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020. https://doi.org/10.1145/3369740.3372916. ieee: J. J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, and A. W. Richa, “Convex Hull Formation for Programmable Matter,” in Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020. mla: Daymude, Joshua J., et al. “Convex Hull Formation for Programmable Matter.” Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020, doi:10.1145/3369740.3372916. short: 'J.J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, A.W. Richa, in: Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020.' date_created: 2020-03-26T07:33:41Z date_updated: 2022-01-06T06:52:49Z doi: 10.1145/3369740.3372916 language: - iso: eng publication: Proceedings of the 21st International Conference on Distributed Computing and Networking publication_identifier: isbn: - '9781450377515' publication_status: published status: public title: Convex Hull Formation for Programmable Matter type: conference user_id: '32229' year: '2020' ... --- _id: '7636' abstract: - lang: eng text: "Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults. \r\nHowever, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on. \r\nWe are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network. \r\nIn this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on. \r\nMore precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well.\r\nWe extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph.\r\n" author: - first_name: Linghui full_name: Luo, Linghui last_name: Luo - 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: 'Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). ; 2019.' apa: 'Luo, L., Scheideler, C., & Strothmann, T. F. (2019). MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil.' bibtex: '@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim Frederik}, year={2019} }' chicago: 'Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.' ieee: 'L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability,” in Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil, 2019.' mla: 'Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.' short: 'L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.' conference: end_date: 2019-05-25 location: Rio de Janeiro, Brazil name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) start_date: 2019-05-20 date_created: 2019-02-12T13:39:20Z date_updated: 2022-01-06T07:03:42Z ddc: - '006' department: - _id: '66' file: - access_level: closed content_type: application/pdf creator: thim date_created: 2019-02-12T13:37:35Z date_updated: 2019-02-12T13:37:35Z file_id: '7637' file_name: IPDPS_main.pdf file_size: 372026 relation: main_file file_date_updated: 2019-02-12T13:37:35Z has_accepted_license: '1' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: SFB 901 publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) status: public title: 'MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability' type: conference user_id: '477' year: '2019' ... --- _id: '8534' abstract: - lang: eng text: "We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages." 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. Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296. doi:10.1145/3323165.3323193' apa: 'Feldmann, M., & Scheideler, C. (2019). Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 287--296). ACM. https://doi.org/10.1145/3323165.3323193' bibtex: '@inproceedings{Feldmann_Scheideler_2019, title={Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={10.1145/3323165.3323193}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian}, year={2019}, pages={287--296} }' chicago: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 287--296. ACM, 2019. https://doi.org/10.1145/3323165.3323193.' ieee: 'M. Feldmann and C. Scheideler, “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019, pp. 287--296.' mla: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.' short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.' date_created: 2019-03-21T14:37:26Z date_updated: 2022-01-06T07:03:56Z ddc: - '004' department: - _id: '79' doi: 10.1145/3323165.3323193 external_id: arxiv: - '1805.03472' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T09:14:32Z date_updated: 2019-08-26T09:14:32Z file_id: '12954' file_name: p287-feldmann.pdf file_size: 1295095 relation: main_file success: 1 file_date_updated: 2019-08-26T09:14:32Z has_accepted_license: '1' language: - iso: eng page: 287--296 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 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publisher: ACM status: public title: 'Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities' type: conference user_id: '477' year: '2019' ... --- _id: '8871' author: - first_name: John full_name: Augustine, John last_name: Augustine - first_name: Mohsen full_name: Ghaffari, Mohsen last_name: Ghaffari - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Jason full_name: Li, Jason last_name: Li - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated Networks. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2019:69--79. doi:10.1145/3323165.3323195' apa: Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., & Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 69--79). ACM. https://doi.org/10.1145/3323165.3323195 bibtex: '@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019, title={Distributed Computation in Node-Capacitated Networks}, DOI={10.1145/3323165.3323195}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}, year={2019}, pages={69--79} }' chicago: Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 69--79. ACM, 2019. https://doi.org/10.1145/3323165.3323195. ieee: J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, pp. 69--79. mla: Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195. short: 'J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.' date_created: 2019-04-10T08:20:34Z date_updated: 2022-01-06T07:04:04Z ddc: - '004' department: - _id: '79' doi: 10.1145/3323165.3323195 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T11:17:58Z date_updated: 2019-08-26T11:17:58Z file_id: '12964' file_name: p69-augustine.pdf file_size: 1275192 relation: main_file success: 1 file_date_updated: 2019-08-26T11:17:58Z has_accepted_license: '1' language: - iso: eng page: 69--79 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 31st ACM Symposium on Parallelism in Algorithms and Architectures publisher: ACM status: public title: Distributed Computation in Node-Capacitated Networks type: conference user_id: '477' year: '2019' ... --- _id: '9599' author: - first_name: Joshua J. full_name: Daymude, Joshua J. last_name: Daymude - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Andréa W. full_name: Richa, Andréa W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Daymude JJ, Hinnenthal K, Richa AW, Scheideler C. Computing by Programmable Particles. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Springer, Cham; 2019:615-681. doi:https://doi.org/10.1007/978-3-030-11072-7_22' apa: Daymude, J. J., Hinnenthal, K., Richa, A. W., & Scheideler, C. (2019). Computing by Programmable Particles. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing. (pp. 615–681). Springer, Cham. https://doi.org/10.1007/978-3-030-11072-7_22 bibtex: '@inbook{Daymude_Hinnenthal_Richa_Scheideler_2019, title={Computing by Programmable Particles}, DOI={https://doi.org/10.1007/978-3-030-11072-7_22}, booktitle={Distributed Computing by Mobile Entities, Current Research in Moving and Computing.}, publisher={Springer, Cham}, author={Daymude, Joshua J. and Hinnenthal, Kristian and Richa, Andréa W. and Scheideler, Christian}, year={2019}, pages={615–681} }' chicago: Daymude, Joshua J., Kristian Hinnenthal, Andréa W. Richa, and Christian Scheideler. “Computing by Programmable Particles.” In Distributed Computing by Mobile Entities, Current Research in Moving and Computing., 615–81. Springer, Cham, 2019. https://doi.org/10.1007/978-3-030-11072-7_22. ieee: J. J. Daymude, K. Hinnenthal, A. W. Richa, and C. Scheideler, “Computing by Programmable Particles,” in Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–681. mla: Daymude, Joshua J., et al. “Computing by Programmable Particles.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–81, doi:https://doi.org/10.1007/978-3-030-11072-7_22. short: 'J.J. Daymude, K. Hinnenthal, A.W. Richa, C. Scheideler, in: Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–681.' date_created: 2019-05-02T09:38:58Z date_updated: 2022-01-06T07:04:16Z doi: https://doi.org/10.1007/978-3-030-11072-7_22 language: - iso: eng page: 615-681 publication: Distributed Computing by Mobile Entities, Current Research in Moving and Computing. publisher: Springer, Cham status: public title: Computing by Programmable Particles type: book_chapter user_id: '32229' year: '2019' ... --- _id: '6976' abstract: - lang: eng text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes joining and leaving the network. We assume an adversary that may churn a\r\nconstant fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds. In particular, the adversary has an almost up-to-date information of\r\nthe network topology as it can observe an only slightly outdated topology that\r\nis at least $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction that new nodes can only join the network via nodes that have taken\r\npart in the network for at least one round.\r\n Our contributions are as follows: First, we show that it is impossible to\r\nmaintain a connected topology if adversary has up-to-date information about the\r\nnodes' connections. Further, we show that our restriction concerning the join\r\nis also necessary. As our main result present an algorithm that constructs a\r\nnew overlay- completely independent of all previous overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which will be maintained by the\r\nalgorithm. However, our approaches can be transferred to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval." author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Vipin Ravindran full_name: Vijayalakshmi, Vipin Ravindran last_name: Vijayalakshmi - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). IEEE.' apa: 'Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil: IEEE.' bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE}, author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian} }' chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). IEEE, n.d. ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil. mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE. short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d.' conference: end_date: 24.05.19 location: Rio de Janeiro, Brazil name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) start_date: 20.05.19 date_created: 2019-01-24T18:53:11Z date_updated: 2022-01-06T07:03:25Z ddc: - '000' department: - _id: '79' file: - access_level: closed content_type: application/pdf creator: thgoette date_created: 2019-01-26T16:09:08Z date_updated: 2019-01-26T16:09:08Z file_id: '7007' file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf file_size: 638020 relation: main_file success: 1 file_date_updated: 2019-01-26T16:09:08Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) publication_status: accepted publisher: IEEE status: public title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary type: conference user_id: '34727' year: '2019' ... --- _id: '10586' abstract: - lang: eng text: We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:10.4230/LIPICS.ICALP.2019.150' apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150' bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }' chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150. ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14. mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150. short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.' conference: end_date: 2019-07-12 location: Patras, Greece name: ICALP 2019 start_date: 2019-07-09 date_created: 2019-07-08T17:19:01Z date_updated: 2022-01-06T06:50:45Z ddc: - '004' department: - _id: '79' doi: 10.4230/LIPICS.ICALP.2019.150 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T09:21:27Z date_updated: 2019-08-26T09:21:27Z file_id: '12955' file_name: LIPIcs-ICALP-2019-150.pdf file_size: 537649 relation: main_file success: 1 file_date_updated: 2019-08-26T09:21:27Z has_accepted_license: '1' intvolume: ' 132' keyword: - Graphs transformations - NP-hardness - approximation algorithms language: - iso: eng page: 150:1--150:14 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming publication_status: published publisher: Dagstuhl Publishing series_title: LIPIcs status: public title: On the Complexity of Local Graph Transformations type: conference user_id: '477' volume: 132 year: '2019' ... --- _id: '12944' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Götte T, Hinnenthal K, Scheideler C. Faster Construction of Overlay Networks. In: Structural Information and Communication Complexity. Cham; 2019. doi:10.1007/978-3-030-24922-9_18' apa: Götte, T., Hinnenthal, K., & Scheideler, C. (2019). Faster Construction of Overlay Networks. In Structural Information and Communication Complexity. Cham. https://doi.org/10.1007/978-3-030-24922-9_18 bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_2019, place={Cham}, title={Faster Construction of Overlay Networks}, DOI={10.1007/978-3-030-24922-9_18}, booktitle={Structural Information and Communication Complexity}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian}, year={2019} }' chicago: Götte, Thorsten, Kristian Hinnenthal, and Christian Scheideler. “Faster Construction of Overlay Networks.” In Structural Information and Communication Complexity. Cham, 2019. https://doi.org/10.1007/978-3-030-24922-9_18. ieee: T. Götte, K. Hinnenthal, and C. Scheideler, “Faster Construction of Overlay Networks,” in Structural Information and Communication Complexity, 2019. mla: Götte, Thorsten, et al. “Faster Construction of Overlay Networks.” Structural Information and Communication Complexity, 2019, doi:10.1007/978-3-030-24922-9_18. short: 'T. Götte, K. Hinnenthal, C. Scheideler, in: Structural Information and Communication Complexity, Cham, 2019.' date_created: 2019-08-19T07:18:57Z date_updated: 2022-01-06T06:51:27Z doi: 10.1007/978-3-030-24922-9_18 language: - iso: eng place: Cham publication: Structural Information and Communication Complexity publication_status: published status: public title: Faster Construction of Overlay Networks type: conference user_id: '32229' year: '2019' ... --- _id: '15627' author: - first_name: John full_name: Augustine, John last_name: Augustine - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Philipp full_name: Schneider, Philipp last_name: Schneider citation: ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA; 2019:1280-1299. doi:10.1137/1.9781611975994.78' apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1280–1299). Philadelphia, PA. https://doi.org/10.1137/1.9781611975994.78 bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia, PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78}, booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299} }' chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1280–99. Philadelphia, PA, 2019. https://doi.org/10.1137/1.9781611975994.78. ieee: J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–1299. mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–99, doi:10.1137/1.9781611975994.78. short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.' date_created: 2020-01-22T09:07:36Z date_updated: 2022-01-06T06:52:30Z doi: 10.1137/1.9781611975994.78 language: - iso: eng page: 1280-1299 place: Philadelphia, PA 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 Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9781611975994' publication_status: published status: public title: Shortest Paths in a Hybrid Network Model type: conference user_id: '32229' year: '2019' ... --- _id: '14830' author: - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Jonas full_name: Lefevre, Jonas last_name: Lefevre - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4 apa: Gmyr, R., Lefevre, J., & Scheideler, C. (2019). Self-Stabilizing Metric Graphs. Theory Comput. Syst., 63(2), 177–199. https://doi.org/10.1007/s00224-017-9823-4 bibtex: '@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs}, volume={63}, DOI={10.1007/s00224-017-9823-4}, number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }' chicago: 'Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst. 63, no. 2 (2019): 177–99. https://doi.org/10.1007/s00224-017-9823-4.' ieee: R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019. mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst., vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4. short: R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199. date_created: 2019-11-06T10:54:58Z date_updated: 2022-01-06T06:52:07Z department: - _id: '79' doi: 10.1007/s00224-017-9823-4 intvolume: ' 63' issue: '2' language: - iso: eng page: 177-199 project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Theory Comput. Syst. status: public title: Self-Stabilizing Metric Graphs type: journal_article user_id: '15504' volume: 63 year: '2019' ... --- _id: '14539' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\_26' apa: Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\_26 bibtex: '@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\_26}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }' chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\_26. ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348. mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9\_26. short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.' conference: end_date: 2019-07-04 location: L'Aquila, Italy name: SIROCCO 2019 start_date: 2019-07-01 date_created: 2019-11-04T10:09:35Z date_updated: 2022-01-06T06:52:00Z department: - _id: '79' - _id: '63' doi: 10.1007/978-3-030-24922-9\_26 language: - iso: eng page: 345-348 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) status: public title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks type: conference user_id: '477' year: '2019' ... --- _id: '13182' abstract: - lang: eng text: "We consider congestion control in peer-to-peer distributed systems. \r\nThe problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \\emph{clients} in this paper) that want to send messages to a fixed common peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages per round and excess messages are dropped.\r\nThe server can modify these probabilities when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state. \ \r\nOur protocol lets the system converge from \\emph{any} initial state to a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)| \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$ rounds in expectation.\r\nIn particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.\r\nFinally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:https://doi.org/10.1007/978-3-030-34992-9_13' apa: Feldmann, M., Götte, T., & Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 149–164). Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_13 bibtex: '@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}, DOI={https://doi.org/10.1007/978-3-030-34992-9_13}, booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164}, collection={Lecture Notes in Computer Science} }' chicago: Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019. https://doi.org/10.1007/978-3-030-34992-9_13. ieee: M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2019, pp. 149–164. mla: Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–64, doi:https://doi.org/10.1007/978-3-030-34992-9_13. short: 'M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.' date_created: 2019-09-10T12:48:33Z date_updated: 2022-01-06T06:51:30Z ddc: - '000' department: - _id: '79' doi: https://doi.org/10.1007/978-3-030-34992-9_13 external_id: arxiv: - '1909.04544' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2019-09-11T11:20:16Z date_updated: 2019-09-11T11:20:16Z file_id: '13188' file_name: main.pdf file_size: 428908 relation: main_file success: 1 file_date_updated: 2019-09-11T11:20:16Z has_accepted_license: '1' language: - iso: eng page: 149-164 project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: SFB 901 publication: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publisher: Springer, Cham series_title: Lecture Notes in Computer Science status: public title: A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory type: conference user_id: '23538' year: '2019' ... --- _id: '13652' author: - 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: Martijn full_name: Struijs, Martijn last_name: Struijs citation: ama: 'Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: 33rd International Symposium on Distributed Computing (DISC 2019). ; 2019. doi:10.4230/LIPICS.DISC.2019.23' apa: Hinnenthal, K., Scheideler, C., & Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium on Distributed Computing (DISC 2019). https://doi.org/10.4230/LIPICS.DISC.2019.23 bibtex: '@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed Algorithms for LP-Type Problems of Low Dimension}, DOI={10.4230/LIPICS.DISC.2019.23}, booktitle={33rd International Symposium on Distributed Computing (DISC 2019)}, author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, year={2019} }' chicago: Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” In 33rd International Symposium on Distributed Computing (DISC 2019), 2019. https://doi.org/10.4230/LIPICS.DISC.2019.23. ieee: K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in 33rd International Symposium on Distributed Computing (DISC 2019), 2019. mla: Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” 33rd International Symposium on Distributed Computing (DISC 2019), 2019, doi:10.4230/LIPICS.DISC.2019.23. short: 'K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019.' date_created: 2019-10-08T11:53:38Z date_updated: 2022-01-06T06:51:41Z department: - _id: '79' doi: 10.4230/LIPICS.DISC.2019.23 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: 33rd International Symposium on Distributed Computing (DISC 2019) status: public title: Fast Distributed Algorithms for LP-Type Problems of Low Dimension type: conference user_id: '32229' year: '2019' ... --- _id: '3422' abstract: - lang: eng text: "We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes." author: - first_name: Peter full_name: Robinson, Peter last_name: Robinson - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399' apa: 'Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien. https://doi.org/10.1145/3210377.3210399' bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }' chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d. https://doi.org/10.1145/3210377.3210399.' ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien.' mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.' short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.' conference: end_date: 2018-07-18 location: Wien name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) start_date: 2018-07-16 date_created: 2018-07-04T08:55:45Z date_updated: 2022-01-06T06:59:16Z ddc: - '040' department: - _id: '79' - _id: '34' - _id: '7' doi: 10.1145/3210377.3210399 file: - access_level: closed content_type: application/pdf creator: asetzer date_created: 2018-10-31T13:30:40Z date_updated: 2018-10-31T13:30:40Z file_id: '5215' file_name: p173-robinson.pdf file_size: 1675407 relation: main_file success: 1 file_date_updated: 2018-10-31T13:30:40Z has_accepted_license: '1' keyword: - distributed consensus - randomized algorithm - adaptive adversary - complexity lower bound language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publication_identifier: isbn: - 978-1-4503-5799-9/18/07 publication_status: accepted status: public title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary' type: conference user_id: '11108' year: '2018' ... --- _id: '1163' abstract: - lang: eng text: "In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - 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: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114' apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00114' bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }' chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114. ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018. mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114. short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.' conference: end_date: 2018-5-24 location: Vancouver name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) start_date: 2018-5-22 date_created: 2018-02-01T13:56:01Z date_updated: 2022-01-06T06:51:05Z ddc: - '040' department: - _id: '79' - _id: '66' doi: 10.1109/IPDPS.2018.00114 external_id: arxiv: - '1710.08128' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:25:37Z date_updated: 2018-10-31T13:25:37Z file_id: '5211' file_name: 08425258.pdf file_size: 239559 relation: main_file success: 1 file_date_updated: 2018-10-31T13:25:37Z has_accepted_license: '1' keyword: - Topological Self-stabilization - Supervised Overlay - Publish-Subscribe System 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: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Self-Stabilizing Supervised Publish-Subscribe Systems type: conference user_id: '11319' year: '2018' ... --- _id: '1164' abstract: - lang: eng text: "We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests." 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 - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113' apa: 'Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00113' bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }' chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.' ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.' mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.' short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.' conference: end_date: 2018-5-24 location: Vancouver name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) start_date: 2018-5-22 date_created: 2018-02-01T14:00:36Z date_updated: 2022-01-06T06:51:05Z ddc: - '040' department: - _id: '79' doi: 10.1109/IPDPS.2018.00113 external_id: arxiv: - '1802.07504' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:29:26Z date_updated: 2018-10-31T13:29:26Z file_id: '5212' file_name: 08425257.pdf file_size: 218420 relation: main_file success: 1 file_date_updated: 2018-10-31T13:29:26Z has_accepted_license: '1' 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: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue' type: conference user_id: '23538' year: '2018' ... --- _id: '1796' author: - first_name: Joshua full_name: J. Daymude, Joshua last_name: J. Daymude - 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: J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating for programmable matter. Natural Computing. 2018;(1):81--96. doi:10.1007/s11047-017-9658-6 apa: J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. Natural Computing, (1), 81--96. https://doi.org/10.1007/s11047-017-9658-6 bibtex: '@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018, title={On the runtime of universal coating for programmable matter}, DOI={10.1007/s11047-017-9658-6}, number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }' chicago: 'J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” Natural Computing, no. 1 (2018): 81--96. https://doi.org/10.1007/s11047-017-9658-6.' ieee: J. J. Daymude et al., “On the runtime of universal coating for programmable matter,” Natural Computing, no. 1, pp. 81--96, 2018. mla: J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.” Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6. short: J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, Natural Computing (2018) 81--96. date_created: 2018-03-27T06:23:58Z date_updated: 2022-01-06T06:53:24Z department: - _id: '79' - _id: '66' doi: 10.1007/s11047-017-9658-6 issue: '1' language: - iso: eng page: 81--96 publication: Natural Computing status: public title: On the runtime of universal coating for programmable matter type: journal_article user_id: '11319' year: '2018' ... --- _id: '5764' 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: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Dorian full_name: Rudolph, Dorian last_name: Rudolph - 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: 'Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple Robots. In: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming. Springer International Publishing; 2018:122-138. doi:10.1007/978-3-030-00030-1_8' apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., & Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (pp. 122–138). Springer International Publishing. https://doi.org/10.1007/978-3-030-00030-1_8 bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018, title={Forming Tile Shapes with Simple Robots}, DOI={10.1007/978-3-030-00030-1_8}, booktitle={Proceedings of the 24th International Conference on DNA Computing and Molecular Programming}, publisher={Springer International Publishing}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={122–138} }' chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes with Simple Robots.” In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, 122–38. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-030-00030-1_8. ieee: R. Gmyr et al., “Forming Tile Shapes with Simple Robots,” in Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, 2018, pp. 122–138. mla: Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–38, doi:10.1007/978-3-030-00030-1_8. short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–138.' date_created: 2018-11-19T15:35:45Z date_updated: 2022-01-06T07:02:38Z department: - _id: '79' - _id: '66' doi: 10.1007/978-3-030-00030-1_8 language: - iso: eng page: 122-138 publication: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming publication_status: published publisher: Springer International Publishing status: public title: Forming Tile Shapes with Simple Robots type: conference user_id: '11319' year: '2018' ... --- _id: '5820' abstract: - lang: eng text: "In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.\r\nFor this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.\r\nIn our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. \r\nOur techniques are very general and can be used as a basis for future constructions with similar goals." author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Jan full_name: Bobolz, Jan id: '27207' last_name: Bobolz - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments. apa: Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments. bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander} }' chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d. ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. . mla: Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments. short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d. date_created: 2018-11-25T08:08:40Z date_updated: 2022-01-06T07:02:43Z ddc: - '000' department: - _id: '7' - _id: '64' - _id: '79' file: - access_level: closed content_type: application/pdf creator: jbobolz date_created: 2018-12-31T09:55:30Z date_updated: 2018-12-31T09:55:30Z file_id: '6435' file_name: draft-2018.pdf file_size: 470968 relation: main_file success: 1 file_date_updated: 2018-12-31T09:55:30Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication_status: draft status: public title: Provably Anonymous Communication Based on Trusted Execution Environments type: working_paper user_id: '27207' year: '2018' ... --- _id: '5984' alternative_title: - Special Issue of SIROCCO 2015 author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Scheideler C. Preface. Theor Comput Sci. 2018;751:1. doi:10.1016/j.tcs.2018.11.004 apa: Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1. https://doi.org/10.1016/j.tcs.2018.11.004 bibtex: '@article{Scheideler_2018, title={Preface}, volume={751}, DOI={10.1016/j.tcs.2018.11.004}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }' chicago: 'Scheideler, Christian. “Preface.” Theor. Comput. Sci. 751 (2018): 1. https://doi.org/10.1016/j.tcs.2018.11.004.' ieee: C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018. mla: Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018, p. 1, doi:10.1016/j.tcs.2018.11.004. short: C. Scheideler, Theor. Comput. Sci. 751 (2018) 1. date_created: 2018-11-30T08:08:23Z date_updated: 2022-01-06T07:02:49Z ddc: - '040' department: - _id: '79' doi: 10.1016/j.tcs.2018.11.004 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2019-01-11T10:20:16Z date_updated: 2019-01-11T10:20:16Z file_id: '6620' file_name: Preface.pdf file_size: 112676 relation: main_file success: 1 file_date_updated: 2019-01-11T10:20:16Z has_accepted_license: '1' intvolume: ' 751' language: - iso: eng page: '1' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Theor. Comput. Sci. status: public title: Preface type: journal_article user_id: '15504' volume: 751 year: '2018' ... --- _id: '5985' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing. In: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018. ; 2018:1-2. doi:10.1145/3229774.3229781' apa: 'Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018 (pp. 1–2). https://doi.org/10.1145/3229774.3229781' bibtex: '@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for Robust and Secure Fog Computing}, DOI={10.1145/3229774.3229781}, booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }' chicago: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 1–2, 2018. https://doi.org/10.1145/3229774.3229781.' ieee: 'C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,” in Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2.' mla: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2, doi:10.1145/3229774.3229781.' short: 'C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2.' date_created: 2018-11-30T08:11:27Z date_updated: 2022-01-06T07:02:49Z ddc: - '004' department: - _id: '79' doi: 10.1145/3229774.3229781 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-12-12T15:12:02Z date_updated: 2018-12-12T15:12:02Z file_id: '6194' file_name: p1-scheideler.pdf file_size: 1420210 relation: main_file file_date_updated: 2018-12-12T15:12:02Z has_accepted_license: '1' language: - iso: eng page: 1-2 project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018 status: public title: 'Relays: Towards a Link Layer for Robust and Secure Fog Computing' type: conference user_id: '477' year: '2018' ... --- _id: '5986' 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: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Dorian full_name: Rudolph, Dorian last_name: Rudolph - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape Recognition by a Finite Automaton Robot. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. ; 2018:52:1-52:15. doi:10.4230/LIPIcs.MFCS.2018.52' apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., & Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK (pp. 52:1-52:15). https://doi.org/10.4230/LIPIcs.MFCS.2018.52 bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018, title={Shape Recognition by a Finite Automaton Robot}, DOI={10.4230/LIPIcs.MFCS.2018.52}, booktitle={43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}, year={2018}, pages={52:1-52:15} }' chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.” In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 52:1-52:15, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.52. ieee: R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler, “Shape Recognition by a Finite Automaton Robot,” in 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15. mla: Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15, doi:10.4230/LIPIcs.MFCS.2018.52. short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, in: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.' date_created: 2018-11-30T08:13:58Z date_updated: 2022-01-06T07:02:49Z department: - _id: '79' doi: 10.4230/LIPIcs.MFCS.2018.52 language: - iso: eng page: 52:1-52:15 publication: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK status: public title: Shape Recognition by a Finite Automaton Robot type: conference user_id: '15504' year: '2018' ... --- _id: '4411' abstract: - lang: eng text: "While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys." author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1' apa: 'Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1' bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }' chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_1. ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201. mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1. short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.' conference: end_date: 2018-11-07 location: Tokyo name: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) start_date: 2018-11-04 date_created: 2018-09-17T13:12:18Z date_updated: 2022-01-06T07:01:02Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1007/978-3-030-03232-6_1 editor: - first_name: Taisuke full_name: Izumi, Taisuke last_name: Izumi - first_name: Petr full_name: Kuznetsov, Petr last_name: Kuznetsov external_id: arxiv: - '1809.04923' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:38:37Z date_updated: 2018-11-02T14:38:37Z file_id: '5277' file_name: ASelf-stabilizingHashedPatrici.pdf file_size: 500005 relation: main_file success: 1 file_date_updated: 2018-11-02T14:38:37Z has_accepted_license: '1' intvolume: ' 11201' keyword: - Self-Stabilizing - Prefix Search - Distributed Data Structure 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: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publisher: Springer, Cham series_title: Lecture Notes of Computer Science status: public title: A Self-Stabilizing Hashed Patricia Trie type: conference user_id: '39241' volume: 11201 year: '2018' ...