[{"department":[{"_id":"79"}],"user_id":"50024","_id":"61172","project":[{"_id":"5","name":"SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen"}],"language":[{"iso":"eng"}],"article_number":"114352","publication":"Theoretical Computer Science","type":"journal_article","status":"public","volume":985,"author":[{"last_name":"Coy","full_name":"Coy, Sam","first_name":"Sam"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Philipp","full_name":"Schneider, Philipp","last_name":"Schneider"},{"last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024","first_name":"Julian"}],"date_created":"2025-09-10T14:26:11Z","date_updated":"2025-09-10T14:52:21Z","publisher":"Elsevier BV","doi":"10.1016/j.tcs.2023.114352","title":"Routing Schemes for Hybrid Communication Networks","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","intvolume":"       985","citation":{"apa":"Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024). Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>, <i>985</i>, Article 114352. <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>","mla":"Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","short":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical Computer Science 985 (2024).","bibtex":"@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>}, number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}, year={2024} }","ieee":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>, vol. 985, Art. no. 114352, 2024, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","chicago":"Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i> 985 (2024). <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>.","ama":"Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>. 2024;985. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>"},"year":"2024"},{"alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"file_date_updated":"2023-07-05T07:19:14Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"1112","department":[{"_id":"7"},{"_id":"78"},{"_id":"26"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","grant_number":"160364472"},{"name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","_id":"8","grant_number":"160364472"},{"name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","_id":"9","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","_id":"10"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"grant_number":"160364472","name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"grant_number":"160364472","name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)","_id":"14"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16","grant_number":"160364472"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"},{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"grant_number":"160364472","_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"_id":"45863","status":"public","type":"book","doi":"10.17619/UNIPB/1-1797","author":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"volume":412,"oa":"1","date_updated":"2024-07-12T12:07:59Z","citation":{"apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., &#38; Wehrheim, H. (2023). <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>","bibtex":"@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023.","mla":"Haake, Claus-Jochen, et al. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>.","ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>","ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>."},"intvolume":"       412","page":"247","place":"Paderborn","publication_identifier":{"unknown":["978-3-947647-31-6"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"date_updated":"2023-07-05T07:19:14Z","date_created":"2023-07-05T07:15:55Z","creator":"ups","file_size":15480050,"file_name":"SFB-Buch-Final.pdf","access_level":"open_access","file_id":"45864","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"lang":"eng","text":"In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT services that describes an approach to the provision of such services\r\nthat was novel at that time and, to a large extent, remains so today:\r\n„Our vision of on-the-fly computing is that of IT services individually and\r\nautomatically configured and brought to execution from flexibly combinable\r\nservices traded on markets. At the same time, we aim at organizing\r\nmarkets whose participants maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver the last 12 years, we have developed methods and techniques to\r\naddress problems critical to the convenient, efficient, and secure use of\r\non-the-fly computing. Among other things, we have made the description\r\nof services more convenient by allowing natural language input,\r\nincreased the quality of configured services through (natural language)\r\ninteraction and more efficient configuration processes and analysis\r\nprocedures, made the quality of (the products of) providers in the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes and an integrated treatment of service description and\r\nconfiguration. We have also developed network infrastructures that have\r\na high degree of adaptivity, scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees of anonymity and security for market\r\nparticipants and their products and services.\r\nTo demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF market. We illustrated the approach using\r\na cutting-edge application scenario – automated machine learning (AutoML).\r\nFinally, we have been pushing our work for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the expertise gained\r\nin the SFB in events with industry partners as well as transfer projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand economists with research interests such as computer networks and\r\ndistributed algorithms, security and cryptography, software engineering\r\nand verification, configuration and machine learning, computer engineering\r\nand HPC, microeconomics and game theory, business informatics\r\nand management have successfully collaborated here."}],"title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","date_created":"2023-07-05T07:16:51Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","year":"2023"},{"year":"2023","intvolume":"       950","page":"113756","citation":{"short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.","bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>}, 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.” <i>Theor. Comput. Sci.</i>, vol. 950, 2023, p. 113756, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>.","apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor. Comput. Sci.</i>, <i>950</i>, 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor Comput Sci</i>. 2023;950:113756. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i> 950 (2023): 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” <i>Theor. Comput. Sci.</i>, vol. 950, p. 113756, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>."},"date_updated":"2023-03-27T09:55:04Z","volume":950,"date_created":"2023-03-27T07:45:44Z","author":[{"first_name":"Thorsten","id":"34727","full_name":"Götte, Thorsten","last_name":"Götte"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Julian","last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian"}],"title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","doi":"10.1016/j.tcs.2023.113756","publication":"Theor. Comput. Sci.","type":"journal_article","status":"public","_id":"43109","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"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}]},{"citation":{"apa":"Schweichhart, J. (2023). <i>Minimum Edge Cuts in Overlay Networks</i>.","short":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.","bibtex":"@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks}, author={Schweichhart, Jonas}, year={2023} }","mla":"Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>. 2023.","ama":"Schweichhart J. <i>Minimum Edge Cuts in Overlay Networks</i>.; 2023.","chicago":"Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>, 2023.","ieee":"J. Schweichhart, <i>Minimum Edge Cuts in Overlay Networks</i>. 2023."},"year":"2023","author":[{"full_name":"Schweichhart, Jonas","last_name":"Schweichhart","first_name":"Jonas"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2023-05-11T05:50:41Z","date_updated":"2023-05-11T05:51:15Z","title":"Minimum Edge Cuts in Overlay Networks","type":"mastersthesis","status":"public","department":[{"_id":"79"}],"user_id":"15504","_id":"44735","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}]},{"title":"Routing Schemes for Hybrid Communication Networks","doi":"10.48550/ARXIV.2210.05333","date_updated":"2023-05-22T09:37:25Z","date_created":"2023-05-22T09:17:50Z","author":[{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"},{"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","last_name":"Schneider","full_name":"Schneider, Philipp"}],"year":"2023","citation":{"ama":"Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>","chicago":"Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">https://doi.org/10.48550/ARXIV.2210.05333</a>.","ieee":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>.","apa":"Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., &#38; Schneider, P. (2023). <i>Routing Schemes for Hybrid Communication Networks</i>. <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">https://doi.org/10.48550/ARXIV.2210.05333</a>","bibtex":"@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }","mla":"Werthmann, Julian, et al. <i>Routing Schemes for Hybrid Communication Networks</i>. 2023, doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>.","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023."},"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"45188","user_id":"50024","department":[{"_id":"79"}],"status":"public","type":"conference"},{"language":[{"iso":"eng"}],"_id":"45192","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"user_id":"477","status":"public","publication":"Distributed Computing","type":"journal_article","title":"Time-Optimal Construction of Overlays","doi":"https://doi.org/10.1007/s00446-023-00442-4","date_updated":"2023-05-23T12:38:57Z","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","id":"32229","first_name":"Kristian"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Julian","id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann"}],"date_created":"2023-05-22T14:34:34Z","year":"2023","citation":{"chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” <i>Distributed Computing</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023).","bibtex":"@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>}, journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, year={2023} }","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023, doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (2023). Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>"}},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"_id":"45580","user_id":"38705","department":[{"_id":"63"}],"year":"2023","citation":{"bibtex":"@book{Castenow_2023, title={Local Protocols for Contracting and Expanding Robot Formation Problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1750\">10.17619/UNIPB/1-1750</a>}, author={Castenow, Jannik}, year={2023} }","mla":"Castenow, Jannik. <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1750\">10.17619/UNIPB/1-1750</a>.","short":"J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.","apa":"Castenow, J. (2023). <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1750\">https://doi.org/10.17619/UNIPB/1-1750</a>","ieee":"J. Castenow, <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>. 2023.","chicago":"Castenow, Jannik. <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1750\">https://doi.org/10.17619/UNIPB/1-1750</a>.","ama":"Castenow J. <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1750\">10.17619/UNIPB/1-1750</a>"},"title":"Local Protocols for Contracting and Expanding Robot Formation Problems","doi":"10.17619/UNIPB/1-1750","date_updated":"2023-06-13T07:43:11Z","date_created":"2023-06-12T13:06:58Z","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"author":[{"first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705"}]},{"citation":{"ieee":"T. Knollmann, <i>Online Algorithms for Allocating Heterogeneous Resources</i>. 2023.","chicago":"Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1751\">https://doi.org/10.17619/UNIPB/1-1751</a>.","ama":"Knollmann T. <i>Online Algorithms for Allocating Heterogeneous Resources</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>","mla":"Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>.","short":"T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.","bibtex":"@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous Resources}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>}, author={Knollmann, Till}, year={2023} }","apa":"Knollmann, T. (2023). <i>Online Algorithms for Allocating Heterogeneous Resources</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1751\">https://doi.org/10.17619/UNIPB/1-1751</a>"},"year":"2023","doi":"10.17619/UNIPB/1-1751","title":"Online Algorithms for Allocating Heterogeneous Resources","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2023-06-12T13:05:04Z","author":[{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"}],"date_updated":"2023-06-12T21:03:14Z","status":"public","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"39241","_id":"45579","project":[{"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)","_id":"5","grant_number":"160364472"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}]},{"has_accepted_license":"1","page":"1--20","intvolume":"       412","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. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:1--20. doi:<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>","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 <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, 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. <a href=\"https://doi.org/10.5281/zenodo.8060372\">https://doi.org/10.5281/zenodo.8060372</a>.","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 <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, 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.","apa":"Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., &#38; 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, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8060372\">https://doi.org/10.5281/zenodo.8060372</a>","mla":"Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>.","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.","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={<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>}, 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} }"},"place":"Paderborn","volume":412,"author":[{"last_name":"Götte","id":"34727","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann","first_name":"Julian"}],"oa":"1","date_updated":"2023-07-07T06:21:57Z","doi":"10.5281/zenodo.8060372","type":"book_chapter","status":"public","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"department":[{"_id":"7"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","_id":"45875","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"}],"file_date_updated":"2023-07-07T06:20:43Z","year":"2023","date_created":"2023-07-07T06:21:38Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"Capabilities and Limitations of Local Strategies in Dynamic Networks","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"relation":"main_file","content_type":"application/pdf","file_size":543715,"file_id":"45876","file_name":"A1-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","date_updated":"2023-07-07T06:20:43Z","date_created":"2023-07-07T06:20:43Z","creator":"ups"}],"language":[{"iso":"eng"}],"ddc":["004"]},{"type":"mastersthesis","status":"public","user_id":"15504","department":[{"_id":"79"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"}],"_id":"46110","language":[{"iso":"eng"}],"citation":{"chicago":"Ashri, Nivedita. <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>, 2023.","ieee":"N. Ashri, <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>. 2023.","ama":"Ashri N. <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>.; 2023.","mla":"Ashri, Nivedita. <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>. 2023.","short":"N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.","bibtex":"@book{Ashri_2023, title={Virtual On-Demand Volunteer System Based on Delaunay Triangulation}, author={Ashri, Nivedita}, year={2023} }","apa":"Ashri, N. (2023). <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>."},"year":"2023","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2023-07-21T08:52:38Z","author":[{"first_name":"Nivedita","full_name":"Ashri, Nivedita","last_name":"Ashri"}],"date_updated":"2023-07-21T08:53:13Z","title":"Virtual On-Demand Volunteer System Based on Delaunay Triangulation"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"47134","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5","grant_number":"160364472"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"}],"citation":{"ama":"Deppe V. <i>Routing in Hypergraphs</i>.; 2023.","chicago":"Deppe, Volker. <i>Routing in Hypergraphs</i>, 2023.","ieee":"V. Deppe, <i>Routing in Hypergraphs</i>. 2023.","bibtex":"@book{Deppe_2023, title={Routing in Hypergraphs}, author={Deppe, Volker}, year={2023} }","short":"V. Deppe, Routing in Hypergraphs, 2023.","mla":"Deppe, Volker. <i>Routing in Hypergraphs</i>. 2023.","apa":"Deppe, V. (2023). <i>Routing in Hypergraphs</i>."},"year":"2023","title":"Routing in Hypergraphs","author":[{"last_name":"Deppe","full_name":"Deppe, Volker","first_name":"Volker"}],"date_created":"2023-09-20T09:59:41Z","date_updated":"2023-09-20T10:00:48Z"},{"date_updated":"2025-10-15T12:57:48Z","date_created":"2023-05-22T14:42:31Z","author":[{"last_name":"Dou","id":"92888","full_name":"Dou, Jinfeng","first_name":"Jinfeng"},{"first_name":"Thorsten","id":"34727","full_name":"Götte, Thorsten","last_name":"Götte"},{"last_name":"Hillebrandt","id":"74425","full_name":"Hillebrandt, Henning","first_name":"Henning"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Julian","full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann"}],"title":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","conference":{"name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2023-06-19","end_date":"2023-06-25","location":"Orlando, USA"},"year":"2023","citation":{"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 <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>, 2023.","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: <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>. ; 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.","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.” <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>, 2023.","apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &#38; Werthmann, J. (2023). Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>. ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA."},"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"}],"_id":"45193","user_id":"34727","language":[{"iso":"eng"}],"type":"conference","publication":"Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)","status":"public"},{"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"_id":"30152","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2022-02-28T07:46:23Z","author":[{"first_name":"Rajanna","last_name":"Roopa","full_name":"Roopa, Rajanna"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-02-28T07:46:53Z","title":"Evaluation of Algorithms for the Node Capacitated Clique","citation":{"apa":"Roopa, R. (2022). <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.","mla":"Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>. 2022.","short":"R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.","bibtex":"@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated Clique}, author={Roopa, Rajanna}, year={2022} }","ama":"Roopa R. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.; 2022.","chicago":"Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>, 2022.","ieee":"R. Roopa, <i>Evaluation of Algorithms for the Node Capacitated Clique</i>. 2022."},"year":"2022"},{"citation":{"chicago":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>, 2022.","ieee":"M. Nachtigall, <i>Hybrid Routing in Three Dimensions</i>. 2022.","ama":"Nachtigall M. <i>Hybrid Routing in Three Dimensions</i>.; 2022.","mla":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>. 2022.","short":"M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.","bibtex":"@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall, Marcel}, year={2022} }","apa":"Nachtigall, M. (2022). <i>Hybrid Routing in Three Dimensions</i>."},"year":"2022","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"first_name":"Marcel","last_name":"Nachtigall","full_name":"Nachtigall, Marcel"}],"date_created":"2022-03-03T07:50:45Z","date_updated":"2022-03-03T07:50:59Z","title":"Hybrid Routing in Three Dimensions","type":"mastersthesis","status":"public","department":[{"_id":"79"}],"user_id":"15504","_id":"30199","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"}],"language":[{"iso":"eng"}]},{"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"_id":"31947","file_date_updated":"2022-06-20T06:16:09Z","language":[{"iso":"eng"}],"ddc":["000"],"type":"bachelorsthesis","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"BA_Hillebrandt.pdf","file_id":"31950","file_size":1585281,"creator":"florida","date_created":"2022-06-20T06:16:09Z","date_updated":"2022-06-20T06:16:09Z"}],"status":"public","date_created":"2022-06-20T06:16:32Z","author":[{"first_name":"Henning","last_name":"Hillebrandt","full_name":"Hillebrandt, Henning"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2022-06-20T06:16:49Z","title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","has_accepted_license":"1","citation":{"mla":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","short":"H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","bibtex":"@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }","apa":"Hillebrandt, H. (2022). <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>.","ama":"Hillebrandt H. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>.; 2022.","ieee":"H. Hillebrandt, <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","chicago":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>, 2022."},"year":"2022"},{"page":"345-356","citation":{"apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–356. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022, title={The k-Server with Preferences Problem}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>}, booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={Association for Computing Machinery}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2022}, pages={345–356} }","mla":"Castenow, Jannik, et al. “The K-Server with Preferences Problem.” <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2022, pp. 345–56, doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2022:345-356. doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,” in <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2022, pp. 345–356, doi: <a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>."},"publication_identifier":{"isbn":["9781450391467"]},"doi":"10.1145/3490148.3538595","date_updated":"2022-08-02T08:07:30Z","author":[{"first_name":"Jannik","last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik"},{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241","full_name":"Knollmann, Till","first_name":"Till"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","id":"41265","first_name":"Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","type":"conference","_id":"31847","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"}],"department":[{"_id":"63"}],"user_id":"39241","year":"2022","title":"The k-Server with Preferences Problem","publisher":"Association for Computing Machinery","date_created":"2022-06-10T09:06:42Z","abstract":[{"text":"The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).\r\n\r\nIn our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n    \r\nThe two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously.","lang":"eng"}],"publication":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","keyword":["K-Server Problem","Heterogeneity","Online Caching"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2205.11102"]}},{"status":"public","editor":[{"full_name":"Ouldridge, Thomas E.","last_name":"Ouldridge","first_name":"Thomas E."},{"first_name":"Shelley F. J.","last_name":"Wickham","full_name":"Wickham, Shelley F. J."}],"type":"conference","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"32602","citation":{"apa":"Padalkin, A., Scheideler, C., &#38; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>","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={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>}, 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.","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 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:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","chicago":"Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 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. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>.","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 8:1–8:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","ama":"Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>"},"intvolume":"       238","page":"8:1–8:22","place":"Dagstuhl, Germany","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"doi":"10.4230/LIPIcs.DNA.28.8","author":[{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Daniel","last_name":"Warner","id":"3902","full_name":"Warner, Daniel"}],"volume":238,"date_updated":"2022-11-17T14:18:24Z","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","language":[{"iso":"eng"}],"year":"2022","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","date_created":"2022-08-08T17:32:19Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik"},{"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"language":[{"iso":"eng"}],"_id":"31479","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"}],"department":[{"_id":"63"}],"user_id":"39241","status":"public","publication":"Algorithmica","type":"journal_article","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","doi":"10.1007/s00453-022-00978-0","publisher":"Springer Science and Business Media LLC","date_updated":"2022-05-27T10:14:27Z","genbank":["tillk"],"author":[{"last_name":"Baswana","full_name":"Baswana, Surender","first_name":"Surender"},{"last_name":"Gupta","full_name":"Gupta, Shiv","first_name":"Shiv"},{"full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"}],"date_created":"2022-05-27T10:09:24Z","year":"2022","citation":{"short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","bibtex":"@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, DOI={<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>","ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” <i>Algorithmica</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, 2022. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>."},"publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published"},{"title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","doi":"10.4230/LIPIcs.SAND.2022.12","date_updated":"2022-08-30T06:33:44Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"first_name":"Joshua J.","full_name":"Daymude, Joshua J.","last_name":"Daymude"},{"first_name":"Andréa W.","last_name":"Richa","full_name":"Richa, Andréa W."},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2022-08-30T06:31:21Z","volume":221,"year":"2022","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. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>","chicago":"Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>.","ieee":"J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, 2022, vol. 221, p. 12:1–12:19, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","mla":"Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","bibtex":"@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}, volume={221}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>}, 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.","apa":"Daymude, J. J., Richa, A. W., &#38; Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i> (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>"},"intvolume":"       221","page":"12:1–12:19","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"_id":"33230","series_title":"LIPIcs","user_id":"15504","department":[{"_id":"79"}],"editor":[{"last_name":"Aspnes","full_name":"Aspnes, James","first_name":"James"},{"first_name":"Othon","full_name":"Michail, Othon","last_name":"Michail"}],"status":"public","type":"conference","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference"},{"title":"2022 Edsger W. Dijkstra Prize in Distributed Computing","doi":"10.1145/3519270.3538411","publisher":"ACM","date_updated":"2022-11-02T08:56:16Z","author":[{"last_name":"Aguiliera","full_name":"Aguiliera, Marcos","first_name":"Marcos"},{"last_name":"Richa","full_name":"Richa, Andréa W.","first_name":"Andréa W."},{"first_name":"Alexander A.","full_name":"Schwarzmann, Alexander A.","last_name":"Schwarzmann"},{"full_name":"Panconesi, Alessandro","last_name":"Panconesi","first_name":"Alessandro"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"full_name":"Woelfel, Philipp","last_name":"Woelfel","first_name":"Philipp"}],"date_created":"2022-11-02T08:53:37Z","year":"2022","page":"1","citation":{"apa":"Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler, C., &#38; Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing. In A. Milani &#38; P. Woelfel (Eds.), <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i> (p. 1). ACM. <a href=\"https://doi.org/10.1145/3519270.3538411\">https://doi.org/10.1145/3519270.3538411</a>","mla":"Aguiliera, Marcos, et al. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:<a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>.","bibtex":"@inproceedings{Aguiliera_Richa_Schwarzmann_Panconesi_Scheideler_Woelfel_2022, title={2022 Edsger W. Dijkstra Prize in Distributed Computing}, DOI={<a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>}, 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} }","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.","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 <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>, 2022, p. 1, doi: <a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>.","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 <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>, edited by Alessia Milani and Philipp Woelfel, 1. ACM, 2022. <a href=\"https://doi.org/10.1145/3519270.3538411\">https://doi.org/10.1145/3519270.3538411</a>.","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. <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>. ACM; 2022:1. doi:<a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>"},"language":[{"iso":"eng"}],"_id":"33967","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"15504","editor":[{"first_name":"Alessia","full_name":"Milani, Alessia","last_name":"Milani"},{"first_name":"Philipp","full_name":"Woelfel, Philipp","last_name":"Woelfel"}],"status":"public","publication":"PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022","type":"conference"}]