[{"doi":"10.1016/j.tcs.2023.113756","_id":"43109","date_updated":"2023-03-27T09:55:04Z","intvolume":" 950","language":[{"iso":"eng"}],"page":"113756","type":"journal_article","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","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.","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} }","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.","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."},"year":"2023","user_id":"15504","title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"date_created":"2023-03-27T07:45:44Z","status":"public","volume":950,"publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"author":[{"last_name":"Götte","id":"34727","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Werthmann","id":"50024","first_name":"Julian","full_name":"Werthmann, Julian"}]},{"doi":"10.48550/ARXIV.2210.05333","_id":"45188","date_updated":"2023-05-22T09:37:25Z","year":"2023","type":"conference","citation":{"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} }","mla":"Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.","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.","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","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.","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023."},"language":[{"iso":"eng"}],"title":"Routing Schemes for Hybrid Communication Networks","user_id":"50024","date_created":"2023-05-22T09:17:50Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"status":"public","department":[{"_id":"79"}],"author":[{"id":"50024","last_name":"Werthmann","full_name":"Werthmann, Julian","first_name":"Julian"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Coy","full_name":"Coy, Sam","first_name":"Sam"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"last_name":"Schneider","first_name":"Philipp","full_name":"Schneider, Philipp"}]},{"title":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","user_id":"34727","publication":"Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)","author":[{"full_name":"Dou, Jinfeng","first_name":"Jinfeng","id":"92888","last_name":"Dou"},{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"last_name":"Hillebrandt","first_name":"Henning","full_name":"Hillebrandt, Henning"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Werthmann, Julian","first_name":"Julian","id":"50024","last_name":"Werthmann"}],"date_created":"2023-05-22T14:42:31Z","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"}],"status":"public","conference":{"end_date":"2023-06-25","location":"Orlando, USA","name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2023-06-19"},"_id":"45193","date_updated":"2023-05-22T16:04:56Z","type":"conference","citation":{"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.","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.","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.","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.","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.","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} }","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."},"year":"2023","language":[{"iso":"eng"}]},{"doi":"https://doi.org/10.1007/s00446-023-00442-4","_id":"45192","date_updated":"2023-05-23T12:38:57Z","type":"journal_article","year":"2023","citation":{"mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Distributed Computing, 2023, doi: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.","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","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","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.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023)."},"language":[{"iso":"eng"}],"title":"Time-Optimal Construction of Overlays","user_id":"477","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"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"date_created":"2023-05-22T14:34:34Z","status":"public","publication":"Distributed Computing","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"id":"32229","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Julian","full_name":"Werthmann, Julian","last_name":"Werthmann","id":"50024"}]},{"doi":"10.5281/zenodo.8060372","oa":"1","date_updated":"2023-07-07T06:21:57Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","title":"Capabilities and Limitations of Local Strategies in Dynamic Networks","place":"Paderborn","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"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","grant_number":"160364472","_id":"5"}],"department":[{"_id":"7"}],"intvolume":" 412","_id":"45875","type":"book_chapter","year":"2023","citation":{"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.","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.","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.","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.","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"},"page":"1--20","ddc":["004"],"user_id":"477","volume":412,"status":"public","has_accepted_license":"1","date_created":"2023-07-07T06:21:38Z","author":[{"last_name":"Götte","id":"34727","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"id":"39241","last_name":"Knollmann","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Werthmann","id":"50024","first_name":"Julian","full_name":"Werthmann, Julian"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","file_date_updated":"2023-07-07T06:20:43Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"date_created":"2023-07-07T06:20:43Z","file_name":"A1-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_size":543715,"file_id":"45876","creator":"ups","content_type":"application/pdf","date_updated":"2023-07-07T06:20:43Z","relation":"main_file"}]},{"page":"145-164","citation":{"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.","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.","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} }","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.","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.","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","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"},"type":"book_chapter","year":"2023","intvolume":" 412","_id":"45891","date_created":"2023-07-07T08:08:47Z","has_accepted_license":"1","status":"public","volume":412,"file":[{"content_type":"application/pdf","date_updated":"2023-07-07T11:18:21Z","relation":"main_file","file_size":320980,"file_id":"45892","creator":"florida","access_level":"open_access","file_name":"C1-Chapter-SFB-Buch-Final.pdf","date_created":"2023-07-07T08:08:37Z"}],"file_date_updated":"2023-07-07T11:18:21Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Fabian","full_name":"Eidens, Fabian","last_name":"Eidens","id":"25078"},{"id":"64669","last_name":"Jager","full_name":"Jager, Tibor","first_name":"Tibor"},{"last_name":"Niehues","id":"36113","first_name":"David","full_name":"Niehues, David"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"477","ddc":["004"],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","oa":"1","doi":"10.5281/zenodo.8068629","date_updated":"2023-07-07T11:18:21Z","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"editor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"department":[{"_id":"7"}],"title":"Robustness and Security","place":"Paderborn"},{"publication":"J. Comput. Biol.","department":[{"_id":"79"}],"author":[{"last_name":"Feldmann","full_name":"Feldmann, Michael","first_name":"Michael"},{"first_name":"Andreas","full_name":"Padalkin, Andreas","last_name":"Padalkin","id":"88238"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Dolev","first_name":"Shlomi","full_name":"Dolev, Shlomi"}],"volume":29,"date_created":"2022-05-04T12:29:22Z","status":"public","title":"Coordinating Amoebots via Reconfigurable Circuits","user_id":"15504","page":"317–343","year":"2022","type":"journal_article","citation":{"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.","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} }","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","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","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.","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343."},"language":[{"iso":"eng"}],"_id":"31060","intvolume":" 29","date_updated":"2022-05-04T12:31:27Z","doi":"10.1089/cmb.2021.0363","issue":"4"},{"place":"Dagstuhl, Germany","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","department":[{"_id":"79"}],"editor":[{"last_name":"Ouldridge","first_name":"Thomas E.","full_name":"Ouldridge, Thomas E."},{"last_name":"Wickham","full_name":"Wickham, Shelley F. J.","first_name":"Shelley F. J."}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_updated":"2022-11-17T14:18:24Z","doi":"10.4230/LIPIcs.DNA.28.8","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"user_id":"477","author":[{"full_name":"Padalkin, Andreas","first_name":"Andreas","id":"88238","last_name":"Padalkin"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"3902","last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"}],"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","volume":238,"status":"public","date_created":"2022-08-08T17:32:19Z","intvolume":" 238","_id":"32602","year":"2022","citation":{"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.","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","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.","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)} }","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.","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."},"type":"conference","page":"8:1–8:22"},{"_id":"32603","intvolume":" 238","page":"9:1–9:22","citation":{"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)} }","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.","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","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.","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."},"type":"conference","year":"2022","user_id":"477","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","author":[{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Warner","id":"3902","first_name":"Daniel","full_name":"Warner, Daniel"}],"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-08-08T17:42:43Z","status":"public","volume":238,"date_updated":"2022-11-17T14:17:09Z","doi":"10.4230/LIPIcs.DNA.28.9","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"place":"Dagstuhl, Germany","title":"Fault-Tolerant Shape Formation in the Amoebot Model","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"editor":[{"full_name":"Ouldridge, Thomas E.","first_name":"Thomas E.","last_name":"Ouldridge"},{"last_name":"Wickham","full_name":"Wickham, Shelley F. J.","first_name":"Shelley F. J."}]},{"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference","author":[{"first_name":"Joshua J.","full_name":"Daymude, Joshua J.","last_name":"Daymude"},{"last_name":"Richa","first_name":"Andréa W.","full_name":"Richa, Andréa W."},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":221,"date_created":"2022-08-30T06:31:21Z","status":"public","user_id":"15504","page":"12:1–12:19","citation":{"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.","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","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.","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} }","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.","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."},"type":"conference","year":"2022","intvolume":" 221","_id":"33230","department":[{"_id":"79"}],"editor":[{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"last_name":"Michail","first_name":"Othon","full_name":"Michail, Othon"}],"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"}],"title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","series_title":"LIPIcs","language":[{"iso":"eng"}],"date_updated":"2022-08-30T06:33:44Z","doi":"10.4230/LIPIcs.SAND.2022.12"}]