[{"type":"bachelorsthesis","department":[{"_id":"79"}],"file":[{"creator":"florida","date_created":"2023-07-17T07:05:05Z","file_name":"BA-Schneider.pdf","access_level":"closed","file_size":1977565,"relation":"main_file","date_updated":"2023-07-17T07:05:05Z","file_id":"46071","success":1,"content_type":"application/pdf"}],"date_created":"2023-07-13T12:46:28Z","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"file_date_updated":"2023-07-17T07:05:05Z","citation":{"mla":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","bibtex":"@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous Storage}, author={Schneider, Fabian}, year={2023} }","ama":"Schneider F. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.; 2023.","ieee":"F. Schneider, <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","apa":"Schneider, F. (2023). <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.","chicago":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>, 2023.","short":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage, 2023."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","ddc":["004"],"_id":"46053","language":[{"iso":"eng"}],"date_updated":"2023-07-17T07:05:22Z","has_accepted_license":"1","title":"Utilizing Redundancy in Distributed Heterogeneous Storage","status":"public","year":"2023","author":[{"full_name":"Schneider, Fabian","first_name":"Fabian","last_name":"Schneider"}]},{"citation":{"mla":"Ranade, Amruta. <i>Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption</i>. 2023.","bibtex":"@book{Ranade_2023, title={Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption}, author={Ranade, Amruta}, year={2023} }","ama":"Ranade A. <i>Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption</i>.; 2023.","ieee":"A. Ranade, <i>Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption</i>. 2023.","apa":"Ranade, A. (2023). <i>Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption</i>.","short":"A. Ranade, Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption, 2023.","chicago":"Ranade, Amruta. <i>Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption</i>, 2023."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"type":"mastersthesis","department":[{"_id":"79"}],"date_created":"2023-07-19T06:09:17Z","date_updated":"2023-07-19T06:09:36Z","status":"public","year":"2023","title":"Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption","author":[{"last_name":"Ranade","first_name":"Amruta","full_name":"Ranade, Amruta"}],"user_id":"15504","language":[{"iso":"eng"}],"_id":"46087"},{"date_created":"2023-07-19T06:08:13Z","type":"mastersthesis","department":[{"_id":"79"}],"citation":{"chicago":"Ali, Osama. <i>Highly Accurate Deep Compressed Facial Recognition</i>, 2023.","short":"O. Ali, Highly Accurate Deep Compressed Facial Recognition, 2023.","ieee":"O. Ali, <i>Highly accurate deep compressed facial recognition</i>. 2023.","apa":"Ali, O. (2023). <i>Highly accurate deep compressed facial recognition</i>.","bibtex":"@book{Ali_2023, title={Highly accurate deep compressed facial recognition}, author={Ali, Osama}, year={2023} }","ama":"Ali O. <i>Highly Accurate Deep Compressed Facial Recognition</i>.; 2023.","mla":"Ali, Osama. <i>Highly Accurate Deep Compressed Facial Recognition</i>. 2023."},"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"_id":"46086","language":[{"iso":"eng"}],"user_id":"15504","title":"Highly accurate deep compressed facial recognition","year":"2023","status":"public","author":[{"last_name":"Ali","first_name":"Osama","full_name":"Ali, Osama"}],"date_updated":"2023-07-19T06:09:31Z"},{"date_created":"2023-07-21T08:52:38Z","department":[{"_id":"79"}],"type":"mastersthesis","citation":{"ieee":"N. Ashri, <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>. 2023.","apa":"Ashri, N. (2023). <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>.","short":"N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.","chicago":"Ashri, Nivedita. <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.","bibtex":"@book{Ashri_2023, title={Virtual On-Demand Volunteer System Based on Delaunay Triangulation}, author={Ashri, Nivedita}, year={2023} }","ama":"Ashri N. <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>.; 2023."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"}],"_id":"46110","language":[{"iso":"eng"}],"user_id":"15504","author":[{"full_name":"Ashri, Nivedita","first_name":"Nivedita","last_name":"Ashri"}],"year":"2023","status":"public","title":"Virtual On-Demand Volunteer System Based on Delaunay Triangulation","date_updated":"2023-07-21T08:53:13Z"},{"department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2023-07-31T10:49:12Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"citation":{"bibtex":"@book{N._2023, title={Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks}, author={N., N.}, year={2023} }","ama":"N. N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks</i>.; 2023.","mla":"N., N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks</i>. 2023.","chicago":"N., N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks</i>, 2023.","short":"N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023.","ieee":"N. N., <i>Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks</i>. 2023.","apa":"N., N. (2023). <i>Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks</i>."},"user_id":"15504","language":[{"iso":"eng"}],"_id":"46221","date_updated":"2023-07-31T10:49:30Z","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"title":"Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks","year":"2023","status":"public"},{"date_updated":"2023-09-20T10:00:48Z","author":[{"full_name":"Deppe, Volker","first_name":"Volker","last_name":"Deppe"}],"year":"2023","status":"public","title":"Routing in Hypergraphs","user_id":"15504","_id":"47134","language":[{"iso":"eng"}],"project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"}],"citation":{"apa":"Deppe, V. (2023). <i>Routing in Hypergraphs</i>.","mla":"Deppe, Volker. <i>Routing in Hypergraphs</i>. 2023.","ieee":"V. Deppe, <i>Routing in Hypergraphs</i>. 2023.","chicago":"Deppe, Volker. <i>Routing in Hypergraphs</i>, 2023.","short":"V. Deppe, Routing in Hypergraphs, 2023.","ama":"Deppe V. <i>Routing in Hypergraphs</i>.; 2023.","bibtex":"@book{Deppe_2023, title={Routing in Hypergraphs}, author={Deppe, Volker}, year={2023} }"},"department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2023-09-20T09:59:41Z"},{"citation":{"apa":"Decking, L. (2023). <i>Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite</i>.","ieee":"L. Decking, <i>Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite</i>. 2023.","chicago":"Decking, Leo. <i>Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite</i>, 2023.","short":"L. Decking, Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.","mla":"Decking, Leo. <i>Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite</i>. 2023.","ama":"Decking L. <i>Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite</i>.; 2023.","bibtex":"@book{Decking_2023, title={Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite}, author={Decking, Leo}, year={2023} }"},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"file_date_updated":"2024-10-22T13:46:33Z","abstract":[{"lang":"ger","text":"Bei dem betrachteten Speicherproblem werden Daten mit verschiedenen\r\nZugriffswahrscheinlichkeiten auf Speicher mit verschiedenen Bandbreiten\r\nund Kapazitäten aufgeteilt, dabei sind Replikate erlaubt.\r\nEs wird die nach Zugriffswahrscheinlichkeit gewichtete kleinste Bandbreite der Daten maximiert.\r\nWir zeigen, dass sowohl das diskrete Speicherproblem, bei dem die Bandbreite der Speicher jeweils\r\ngleichmäßig auf die dort abgelegten Daten aufgeteilt wird, als auch das kontinuierliche\r\nSpeicherproblem, bei dem die Bandbreite der Speicher beliebig auf abgelegte Daten verteilt werden\r\ndarf, NP-schwer ist.\r\nEs können also, wenn P ̸ = NP, keine effizienten Algorithmen für eine optimale Lösung existieren.\r\nStattdessen zeigen wir jeweils einen 1/2-Approximationsalgorithmus."}],"date_created":"2023-10-24T13:22:08Z","file":[{"content_type":"application/pdf","file_id":"56725","access_level":"open_access","file_size":5065530,"file_name":"LeoDecking_Bachelorarbeit.pdf","date_updated":"2024-10-22T13:46:33Z","relation":"main_file","date_created":"2024-10-22T12:34:47Z","creator":"scheidel"}],"department":[{"_id":"79"}],"oa":"1","type":"bachelorsthesis","author":[{"first_name":"Leo","last_name":"Decking","full_name":"Decking, Leo"}],"year":"2023","title":"Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite","status":"public","has_accepted_license":"1","date_updated":"2024-10-22T13:46:33Z","language":[{"iso":"eng"}],"_id":"48430","user_id":"20792","ddc":["004"]},{"status":"public","year":"2022","title":"Evaluation of Algorithms for the Node Capacitated Clique","author":[{"full_name":"Roopa, Rajanna","first_name":"Rajanna","last_name":"Roopa"}],"date_updated":"2022-02-28T07:46:53Z","language":[{"iso":"eng"}],"_id":"30152","user_id":"15504","supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"citation":{"mla":"Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>. 2022.","ama":"Roopa R. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.; 2022.","bibtex":"@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated Clique}, author={Roopa, Rajanna}, year={2022} }","apa":"Roopa, R. (2022). <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.","ieee":"R. Roopa, <i>Evaluation of Algorithms for the Node Capacitated Clique</i>. 2022.","short":"R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.","chicago":"Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>, 2022."},"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"}],"date_created":"2022-02-28T07:46:23Z","type":"mastersthesis","department":[{"_id":"79"}]},{"date_updated":"2022-03-03T07:51:02Z","year":"2022","status":"public","title":"Aufarbeitung und lmplementierung von DAG-Rider","author":[{"last_name":"Korzeczek","first_name":"Sebastian","full_name":"Korzeczek, Sebastian"}],"user_id":"15504","language":[{"iso":"eng"}],"_id":"30198","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"citation":{"mla":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>. 2022.","ama":"Korzeczek S. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>.; 2022.","bibtex":"@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider}, author={Korzeczek, Sebastian}, year={2022} }","apa":"Korzeczek, S. (2022). <i>Aufarbeitung und lmplementierung von DAG-Rider</i>.","ieee":"S. Korzeczek, <i>Aufarbeitung und lmplementierung von DAG-Rider</i>. 2022.","short":"S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.","chicago":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>, 2022."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"type":"bachelorsthesis","department":[{"_id":"79"}],"date_created":"2022-03-03T07:47:00Z"},{"user_id":"15504","_id":"30199","language":[{"iso":"eng"}],"date_updated":"2022-03-03T07:50:59Z","author":[{"first_name":"Marcel","last_name":"Nachtigall","full_name":"Nachtigall, Marcel"}],"status":"public","title":"Hybrid Routing in Three Dimensions","year":"2022","department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2022-03-03T07:50:45Z","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"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"mla":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>. 2022.","ama":"Nachtigall M. <i>Hybrid Routing in Three Dimensions</i>.; 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>.","ieee":"M. Nachtigall, <i>Hybrid Routing in Three Dimensions</i>. 2022.","chicago":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>, 2022.","short":"M. Nachtigall, Hybrid Routing in Three Dimensions, 2022."}},{"issue":"4","publication":"J. Comput. Biol.","citation":{"ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. <i>J Comput Biol</i>. 2022;29(4):317–343. doi:<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>","bibtex":"@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={29}, DOI={<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>}, number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343} }","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” <i>J. Comput. Biol.</i>, vol. 29, no. 4, 2022, pp. 317–343, doi:<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>.","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” <i>J. Comput. Biol.</i> 29, no. 4 (2022): 317–343. <a href=\"https://doi.org/10.1089/cmb.2021.0363\">https://doi.org/10.1089/cmb.2021.0363</a>.","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.","apa":"Feldmann, M., Padalkin, A., Scheideler, C., &#38; Dolev, S. (2022). Coordinating Amoebots via Reconfigurable Circuits. <i>J. Comput. Biol.</i>, <i>29</i>(4), 317–343. <a href=\"https://doi.org/10.1089/cmb.2021.0363\">https://doi.org/10.1089/cmb.2021.0363</a>","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” <i>J. Comput. Biol.</i>, vol. 29, no. 4, pp. 317–343, 2022, doi: <a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>."},"type":"journal_article","department":[{"_id":"79"}],"date_created":"2022-05-04T12:29:22Z","date_updated":"2022-05-04T12:31:27Z","intvolume":"        29","year":"2022","title":"Coordinating Amoebots via Reconfigurable Circuits","status":"public","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann"},{"full_name":"Padalkin, Andreas","first_name":"Andreas","last_name":"Padalkin","id":"88238"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Dolev, Shlomi","last_name":"Dolev","first_name":"Shlomi"}],"doi":"10.1089/cmb.2021.0363","user_id":"15504","volume":29,"page":"317–343","_id":"31060","language":[{"iso":"eng"}]},{"_id":"31947","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"15504","year":"2022","title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","status":"public","author":[{"full_name":"Hillebrandt, Henning","first_name":"Henning","last_name":"Hillebrandt"}],"date_updated":"2022-06-20T06:16:49Z","has_accepted_license":"1","file":[{"date_created":"2022-06-20T06:16:09Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"31950","file_size":1585281,"access_level":"closed","file_name":"BA_Hillebrandt.pdf","date_updated":"2022-06-20T06:16:09Z","relation":"main_file"}],"date_created":"2022-06-20T06:16:32Z","type":"bachelorsthesis","department":[{"_id":"79"}],"file_date_updated":"2022-06-20T06:16:09Z","supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"citation":{"bibtex":"@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }","ama":"Hillebrandt H. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>.; 2022.","mla":"Hillebrandt, Henning. <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.","short":"H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","ieee":"H. Hillebrandt, <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","apa":"Hillebrandt, H. (2022). <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}]},{"date_created":"2022-08-08T17:32:19Z","department":[{"_id":"79"}],"type":"conference","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.DNA.28.8","publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"author":[{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel","id":"3902"}],"title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","year":"2022","intvolume":"       238","date_updated":"2022-11-17T14:18:24Z","place":"Dagstuhl, Germany","citation":{"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>","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)} }","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>.","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.","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>.","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>","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>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"32602","page":"8:1–8:22","editor":[{"first_name":"Thomas E.","last_name":"Ouldridge","full_name":"Ouldridge, Thomas E."},{"first_name":"Shelley F. J.","last_name":"Wickham","full_name":"Wickham, Shelley F. J."}],"volume":238,"user_id":"477","status":"public"},{"citation":{"mla":"Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation 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. 9:1–9:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","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={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>}, 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)} }","ama":"Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation 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:9:1–9:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 9:1–9:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Fault-Tolerant Shape Formation 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. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation 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:9:1–9: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.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>.","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."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"place":"Dagstuhl, Germany","status":"public","_id":"32603","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","page":"9:1–9:22","volume":238,"editor":[{"full_name":"Ouldridge, Thomas E.","first_name":"Thomas E.","last_name":"Ouldridge"},{"last_name":"Wickham","first_name":"Shelley F. J.","full_name":"Wickham, Shelley F. J."}],"user_id":"477","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","date_created":"2022-08-08T17:42:43Z","department":[{"_id":"79"}],"type":"conference","publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"author":[{"last_name":"Kostitsyna","first_name":"Irina","full_name":"Kostitsyna, Irina"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"id":"3902","first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel"}],"title":"Fault-Tolerant Shape Formation in the Amoebot Model","year":"2022","intvolume":"       238","date_updated":"2022-11-17T14:17:09Z","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPIcs.DNA.28.9"},{"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference","date_created":"2022-08-30T06:31:21Z","department":[{"_id":"79"}],"type":"conference","author":[{"full_name":"Daymude, Joshua J.","last_name":"Daymude","first_name":"Joshua J."},{"first_name":"Andréa W.","last_name":"Richa","full_name":"Richa, Andréa W."},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","year":"2022","intvolume":"       221","date_updated":"2022-08-30T06:33:44Z","language":[{"iso":"eng"}],"series_title":"LIPIcs","doi":"10.4230/LIPIcs.SAND.2022.12","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>","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} }","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>.","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>.","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>","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>."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"status":"public","_id":"33230","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"12:1–12:19","volume":221,"editor":[{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"full_name":"Michail, Othon","last_name":"Michail","first_name":"Othon"}],"user_id":"15504"},{"type":"conference","department":[{"_id":"79"}],"date_created":"2022-09-01T07:55:00Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"publication":"SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022","citation":{"ieee":"T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” in <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, 2022, pp. 99–101, doi: <a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","apa":"Götte, T., &#38; Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal &#38; I.-T. A. Lee (Eds.), <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i> (pp. 99–101). ACM. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>","short":"T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.","chicago":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” In <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>.","mla":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","bibtex":"@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>}, booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina}, year={2022}, pages={99–101} }","ama":"Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>. ACM; 2022:99–101. doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>"},"user_id":"15504","doi":"10.1145/3490148.3538556","editor":[{"full_name":"Agrawal, Kunal","last_name":"Agrawal","first_name":"Kunal"},{"full_name":"Lee, I-Ting Angelina","last_name":"Lee","first_name":"I-Ting Angelina"}],"page":"99–101","publisher":"ACM","_id":"33240","language":[{"iso":"eng"}],"date_updated":"2022-09-01T07:57:53Z","year":"2022","title":"Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion","status":"public","author":[{"id":"34727","last_name":"Götte","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}]},{"citation":{"mla":"Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","ama":"Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>. Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>","bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}, volume={221}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={23:1–23:3}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i> (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, 2022, vol. 221, p. 23:1–23:3, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, edited by James Aspnes and Othon Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>.","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"place":"Dagstuhl, Germany","status":"public","page":"23:1–23:3","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"30987","user_id":"15504","volume":221,"editor":[{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"last_name":"Michail","first_name":"Othon","full_name":"Michail, Othon"}],"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)","date_created":"2022-05-03T00:13:06Z","type":"conference","department":[{"_id":"79"}],"title":"Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model","year":"2022","author":[{"full_name":"Kostitsyna, Irina","first_name":"Irina","last_name":"Kostitsyna"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner","id":"3902"}],"publication_identifier":{"isbn":["978-3-95977-224-2"],"issn":["1868-8969"]},"date_updated":"2022-10-27T08:45:52Z","intvolume":"       221","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPIcs.SAND.2022.23"},{"date_created":"2022-11-02T08:53:37Z","type":"conference","department":[{"_id":"79"}],"publication":"PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022","citation":{"ama":"Aguiliera M, Richa AW, Schwarzmann AA, Panconesi A, Scheideler C, Woelfel P. 2022 Edsger W. Dijkstra Prize in Distributed Computing. In: Milani A, Woelfel P, eds. <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>","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.","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>.","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} }","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>.","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>","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>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"page":"1","_id":"33967","publisher":"ACM","language":[{"iso":"eng"}],"user_id":"15504","doi":"10.1145/3519270.3538411","editor":[{"first_name":"Alessia","last_name":"Milani","full_name":"Milani, Alessia"},{"full_name":"Woelfel, Philipp","first_name":"Philipp","last_name":"Woelfel"}],"year":"2022","status":"public","title":"2022 Edsger W. Dijkstra Prize in Distributed Computing","author":[{"first_name":"Marcos","last_name":"Aguiliera","full_name":"Aguiliera, Marcos"},{"full_name":"Richa, Andréa W.","first_name":"Andréa W.","last_name":"Richa"},{"first_name":"Alexander A.","last_name":"Schwarzmann","full_name":"Schwarzmann, Alexander A."},{"full_name":"Panconesi, Alessandro","first_name":"Alessandro","last_name":"Panconesi"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Philipp","last_name":"Woelfel","full_name":"Woelfel, Philipp"}],"date_updated":"2022-11-02T08:56:16Z"},{"type":"conference_editor","department":[{"_id":"79"}],"date_created":"2022-11-02T08:55:30Z","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"}],"citation":{"mla":"Scheideler, Christian, editor. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","bibtex":"@book{Scheideler_2022, series={LIPIcs}, title={36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA}, volume={246}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year={2022}, collection={LIPIcs} }","ama":"Scheideler C, ed. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022.","ieee":"C. Scheideler, Ed., <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>, vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","apa":"Scheideler, C. (Ed.). (2022). <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i> (Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.","chicago":"Scheideler, Christian, ed. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Vol. 246. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","short":"C. Scheideler, ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"user_id":"15504","volume":246,"editor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"_id":"33968","language":[{"iso":"eng"}],"series_title":"LIPIcs","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-11-02T08:56:13Z","intvolume":"       246","status":"public","year":"2022","title":"36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA","publication_identifier":{"isbn":["978-3-95977-255-6"]}},{"type":"dissertation","department":[{"_id":"79"}],"date_created":"2022-03-11T06:05:54Z","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"}],"citation":{"ieee":"C. Kolb, <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. 2022.","apa":"Kolb, C. (2022). <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>","short":"C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022.","chicago":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>.","mla":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>.","bibtex":"@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>}, author={Kolb, Christina}, year={2022} }","ama":"Kolb C. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>"},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"user_id":"15504","doi":"10.17619/UNIPB/1-1673 ","language":[{"iso":"eng"}],"_id":"30239","date_updated":"2023-03-17T07:22:04Z","status":"public","title":"Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks","year":"2022","author":[{"full_name":"Kolb, Christina","first_name":"Christina","last_name":"Kolb"}]}]