[{"type":"mastersthesis","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"49493","language":[{"iso":"eng"}],"citation":{"apa":"Telaprolu, V. (2023). <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>.","mla":"Telaprolu, Vipasyan. <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>. 2023.","short":"V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields, 2023.","bibtex":"@book{Telaprolu_2023, title={Reconstruction of 3D Surfels from Neural Radiance Fields}, author={Telaprolu, Vipasyan}, year={2023} }","ama":"Telaprolu V. <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>.; 2023.","chicago":"Telaprolu, Vipasyan. <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>, 2023.","ieee":"V. Telaprolu, <i>Reconstruction of 3D Surfels from Neural Radiance Fields</i>. 2023."},"year":"2023","date_created":"2023-12-05T15:19:46Z","author":[{"first_name":"Vipasyan","full_name":"Telaprolu, Vipasyan","last_name":"Telaprolu"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2023-12-05T15:20:10Z","title":"Reconstruction of 3D Surfels from Neural Radiance Fields"},{"type":"mastersthesis","status":"public","_id":"49492","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","language":[{"iso":"eng"}],"year":"2023","citation":{"apa":"Friemel, J. (2023). <i>Shape Reconfiguration by Hybrid Programmable Matter</i>.","mla":"Friemel, Jonas. <i>Shape Reconfiguration by Hybrid Programmable Matter</i>. 2023.","bibtex":"@book{Friemel_2023, title={Shape Reconfiguration by Hybrid Programmable Matter}, author={Friemel, Jonas}, year={2023} }","short":"J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter, 2023.","ama":"Friemel J. <i>Shape Reconfiguration by Hybrid Programmable Matter</i>.; 2023.","chicago":"Friemel, Jonas. <i>Shape Reconfiguration by Hybrid Programmable Matter</i>, 2023.","ieee":"J. Friemel, <i>Shape Reconfiguration by Hybrid Programmable Matter</i>. 2023."},"date_updated":"2023-12-05T15:18:41Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"last_name":"Friemel","full_name":"Friemel, Jonas","first_name":"Jonas"}],"date_created":"2023-12-05T15:18:17Z","title":"Shape Reconfiguration by Hybrid Programmable Matter"},{"year":"2023","citation":{"ama":"Beckendorf B. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>.; 2023.","chicago":"Beckendorf, Björn. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>, 2023.","ieee":"B. Beckendorf, <i>Self-Stabilizing Skip-Graph with Growth-bounded Metric</i>. 2023.","apa":"Beckendorf, B. (2023). <i>Self-Stabilizing Skip-Graph with Growth-bounded Metric</i>.","mla":"Beckendorf, Björn. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>. 2023.","bibtex":"@book{Beckendorf_2023, title={Self-Stabilizing Skip-Graph with Growth-bounded Metric}, author={Beckendorf, Björn}, year={2023} }","short":"B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023."},"date_updated":"2024-03-05T12:49:22Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2024-03-05T12:48:39Z","author":[{"full_name":"Beckendorf, Björn","last_name":"Beckendorf","first_name":"Björn"}],"title":"Self-Stabilizing Skip-Graph with Growth-bounded Metric","type":"mastersthesis","status":"public","_id":"52317","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"46467","status":"public","publication":"Distributed Comput.","type":"journal_article","doi":"10.1007/s00446-023-00443-3","title":"The canonical amoebot model: algorithms and concurrency control","volume":36,"date_created":"2023-08-10T05:34:08Z","author":[{"full_name":"Daymude, Joshua J.","last_name":"Daymude","first_name":"Joshua J."},{"last_name":"Richa","full_name":"Richa, Andréa W.","first_name":"Andréa W."},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2024-07-05T07:01:06Z","intvolume":"        36","page":"159–192","citation":{"ieee":"J. J. Daymude, A. W. Richa, and C. Scheideler, “The canonical amoebot model: algorithms and concurrency control,” <i>Distributed Comput.</i>, vol. 36, no. 2, pp. 159–192, 2023, doi: <a href=\"https://doi.org/10.1007/s00446-023-00443-3\">10.1007/s00446-023-00443-3</a>.","chicago":"Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “The Canonical Amoebot Model: Algorithms and Concurrency Control.” <i>Distributed Comput.</i> 36, no. 2 (2023): 159–192. <a href=\"https://doi.org/10.1007/s00446-023-00443-3\">https://doi.org/10.1007/s00446-023-00443-3</a>.","ama":"Daymude JJ, Richa AW, Scheideler C. The canonical amoebot model: algorithms and concurrency control. <i>Distributed Comput</i>. 2023;36(2):159–192. doi:<a href=\"https://doi.org/10.1007/s00446-023-00443-3\">10.1007/s00446-023-00443-3</a>","apa":"Daymude, J. J., Richa, A. W., &#38; Scheideler, C. (2023). The canonical amoebot model: algorithms and concurrency control. <i>Distributed Comput.</i>, <i>36</i>(2), 159–192. <a href=\"https://doi.org/10.1007/s00446-023-00443-3\">https://doi.org/10.1007/s00446-023-00443-3</a>","short":"J.J. Daymude, A.W. Richa, C. Scheideler, Distributed Comput. 36 (2023) 159–192.","mla":"Daymude, Joshua J., et al. “The Canonical Amoebot Model: Algorithms and Concurrency Control.” <i>Distributed Comput.</i>, vol. 36, no. 2, 2023, pp. 159–192, doi:<a href=\"https://doi.org/10.1007/s00446-023-00443-3\">10.1007/s00446-023-00443-3</a>.","bibtex":"@article{Daymude_Richa_Scheideler_2023, title={The canonical amoebot model: algorithms and concurrency control}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s00446-023-00443-3\">10.1007/s00446-023-00443-3</a>}, number={2}, journal={Distributed Comput.}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}, year={2023}, pages={159–192} }"},"year":"2023","issue":"2"},{"status":"public","type":"journal_article","publication":"Theor. Comput. Sci.","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"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"43109","citation":{"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>.","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>"},"intvolume":"       950","page":"113756","year":"2023","doi":"10.1016/j.tcs.2023.113756","title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","date_created":"2023-03-27T07:45:44Z","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"volume":950,"date_updated":"2023-03-27T09:55:04Z"},{"year":"2023","citation":{"apa":"Schweichhart, J. (2023). <i>Minimum Edge Cuts in Overlay Networks</i>.","bibtex":"@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks}, author={Schweichhart, Jonas}, year={2023} }","short":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 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."},"date_updated":"2023-05-11T05:51:15Z","author":[{"first_name":"Jonas","last_name":"Schweichhart","full_name":"Schweichhart, Jonas"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2023-05-11T05:50:41Z","title":"Minimum Edge Cuts in Overlay Networks","type":"mastersthesis","status":"public","_id":"44735","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"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"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"}],"_id":"45188","user_id":"50024","department":[{"_id":"79"}],"status":"public","type":"conference","title":"Routing Schemes for Hybrid Communication Networks","doi":"10.48550/ARXIV.2210.05333","date_updated":"2023-05-22T09:37:25Z","author":[{"first_name":"Julian","id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Sam","full_name":"Coy, Sam","last_name":"Coy"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"first_name":"Philipp","full_name":"Schneider, Philipp","last_name":"Schneider"}],"date_created":"2023-05-22T09:17:50Z","year":"2023","citation":{"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>.","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} }","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.","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>","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>","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>.","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>."}},{"has_accepted_license":"1","year":"2023","citation":{"bibtex":"@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous Storage}, author={Schneider, Fabian}, year={2023} }","mla":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","short":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage, 2023.","apa":"Schneider, F. (2023). <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.","ama":"Schneider F. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.; 2023.","ieee":"F. Schneider, <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","chicago":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>, 2023."},"date_updated":"2023-07-17T07:05:22Z","date_created":"2023-07-13T12:46:28Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"last_name":"Schneider","full_name":"Schneider, Fabian","first_name":"Fabian"}],"title":"Utilizing Redundancy in Distributed Heterogeneous Storage","type":"bachelorsthesis","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1977565,"access_level":"closed","file_id":"46071","file_name":"BA-Schneider.pdf","date_updated":"2023-07-17T07:05:05Z","date_created":"2023-07-17T07:05:05Z","creator":"florida"}],"_id":"46053","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 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"15504","ddc":["004"],"language":[{"iso":"eng"}],"file_date_updated":"2023-07-17T07:05:05Z"},{"type":"mastersthesis","status":"public","_id":"46087","department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"year":"2023","citation":{"ieee":"A. Ranade, <i>Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption</i>. 2023.","chicago":"Ranade, Amruta. <i>Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption</i>, 2023.","ama":"Ranade A. <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.","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} }"},"date_updated":"2023-07-19T06:09:36Z","date_created":"2023-07-19T06:09:17Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"last_name":"Ranade","full_name":"Ranade, Amruta","first_name":"Amruta"}],"title":"Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption"},{"title":"Highly accurate deep compressed facial recognition","date_created":"2023-07-19T06:08:13Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"last_name":"Ali","full_name":"Ali, Osama","first_name":"Osama"}],"date_updated":"2023-07-19T06:09:31Z","citation":{"bibtex":"@book{Ali_2023, title={Highly accurate deep compressed facial recognition}, author={Ali, Osama}, year={2023} }","short":"O. Ali, Highly Accurate Deep Compressed Facial Recognition, 2023.","mla":"Ali, Osama. <i>Highly Accurate Deep Compressed Facial Recognition</i>. 2023.","apa":"Ali, O. (2023). <i>Highly accurate deep compressed facial recognition</i>.","ama":"Ali O. <i>Highly Accurate Deep Compressed Facial Recognition</i>.; 2023.","ieee":"O. Ali, <i>Highly accurate deep compressed facial recognition</i>. 2023.","chicago":"Ali, Osama. <i>Highly Accurate Deep Compressed Facial Recognition</i>, 2023."},"year":"2023","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"_id":"46086","status":"public","type":"mastersthesis"},{"title":"Virtual On-Demand Volunteer System Based on Delaunay Triangulation","author":[{"first_name":"Nivedita","full_name":"Ashri, Nivedita","last_name":"Ashri"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2023-07-21T08:52:38Z","date_updated":"2023-07-21T08:53:13Z","citation":{"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>.","ieee":"N. Ashri, <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>. 2023.","chicago":"Ashri, Nivedita. <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."},"year":"2023","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"46110","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"_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"}],"status":"public","type":"mastersthesis"},{"date_updated":"2023-07-31T10:49:30Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2023-07-31T10:49:12Z","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","citation":{"ieee":"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.","ama":"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>.","mla":"N., N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks</i>. 2023.","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} }","short":"N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023."},"_id":"46221","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"}],"_id":"47134","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2023-09-20T10:00:48Z","author":[{"last_name":"Deppe","full_name":"Deppe, Volker","first_name":"Volker"}],"date_created":"2023-09-20T09:59:41Z","title":"Routing in Hypergraphs","year":"2023","citation":{"chicago":"Deppe, Volker. <i>Routing in Hypergraphs</i>, 2023.","ieee":"V. Deppe, <i>Routing in Hypergraphs</i>. 2023.","ama":"Deppe V. <i>Routing in Hypergraphs</i>.; 2023.","mla":"Deppe, Volker. <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.","apa":"Deppe, V. (2023). <i>Routing in Hypergraphs</i>."}},{"language":[{"iso":"eng"}],"file_date_updated":"2024-10-22T13:46:33Z","ddc":["004"],"user_id":"20792","department":[{"_id":"79"}],"_id":"48430","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"56725","access_level":"open_access","file_name":"LeoDecking_Bachelorarbeit.pdf","file_size":5065530,"date_created":"2024-10-22T12:34:47Z","creator":"scheidel","date_updated":"2024-10-22T13:46:33Z"}],"status":"public","abstract":[{"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.","lang":"ger"}],"type":"bachelorsthesis","title":"Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite","author":[{"first_name":"Leo","last_name":"Decking","full_name":"Decking, Leo"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2023-10-24T13:22:08Z","date_updated":"2024-10-22T13:46:33Z","oa":"1","citation":{"chicago":"Decking, Leo. <i>Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite</i>, 2023.","ieee":"L. Decking, <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.","apa":"Decking, L. (2023). <i>Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite</i>.","bibtex":"@book{Decking_2023, title={Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite}, author={Decking, Leo}, year={2023} }","mla":"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."},"year":"2023","has_accepted_license":"1"},{"title":"Evaluation of Algorithms for the Node Capacitated Clique","date_created":"2022-02-28T07:46:23Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"last_name":"Roopa","full_name":"Roopa, Rajanna","first_name":"Rajanna"}],"date_updated":"2022-02-28T07:46:53Z","citation":{"bibtex":"@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated Clique}, author={Roopa, Rajanna}, year={2022} }","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.","apa":"Roopa, R. (2022). <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.","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","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"30152","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"}],"status":"public","type":"mastersthesis"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"79"}],"user_id":"15504","_id":"30198","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider}, author={Korzeczek, Sebastian}, year={2022} }","mla":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>. 2022.","short":"S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.","apa":"Korzeczek, S. (2022). <i>Aufarbeitung und lmplementierung von DAG-Rider</i>.","ama":"Korzeczek S. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>.; 2022.","ieee":"S. Korzeczek, <i>Aufarbeitung und lmplementierung von DAG-Rider</i>. 2022.","chicago":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>, 2022."},"year":"2022","author":[{"first_name":"Sebastian","last_name":"Korzeczek","full_name":"Korzeczek, Sebastian"}],"date_created":"2022-03-03T07:47:00Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-03-03T07:51:02Z","title":"Aufarbeitung und lmplementierung von DAG-Rider"},{"year":"2022","citation":{"ama":"Nachtigall M. <i>Hybrid Routing in Three Dimensions</i>.; 2022.","ieee":"M. Nachtigall, <i>Hybrid Routing in Three Dimensions</i>. 2022.","chicago":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>, 2022.","apa":"Nachtigall, M. (2022). <i>Hybrid Routing in Three Dimensions</i>.","short":"M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.","mla":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>. 2022.","bibtex":"@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall, Marcel}, year={2022} }"},"date_updated":"2022-03-03T07:50:59Z","author":[{"first_name":"Marcel","full_name":"Nachtigall, Marcel","last_name":"Nachtigall"}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2022-03-03T07:50:45Z","title":"Hybrid Routing in Three Dimensions","type":"mastersthesis","status":"public","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":"30199","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}]},{"volume":29,"author":[{"full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Dolev","full_name":"Dolev, Shlomi","first_name":"Shlomi"}],"date_created":"2022-05-04T12:29:22Z","date_updated":"2022-05-04T12:31:27Z","doi":"10.1089/cmb.2021.0363","title":"Coordinating Amoebots via Reconfigurable Circuits","issue":"4","page":"317–343","intvolume":"        29","citation":{"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>.","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>.","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>.","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>"},"year":"2022","department":[{"_id":"79"}],"user_id":"15504","_id":"31060","language":[{"iso":"eng"}],"publication":"J. Comput. Biol.","type":"journal_article","status":"public"},{"year":"2022","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."},"has_accepted_license":"1","title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","date_updated":"2022-06-20T06:16:49Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Henning","full_name":"Hillebrandt, Henning","last_name":"Hillebrandt"}],"date_created":"2022-06-20T06:16:32Z","status":"public","file":[{"file_size":1585281,"access_level":"closed","file_name":"BA_Hillebrandt.pdf","file_id":"31950","date_updated":"2022-06-20T06:16:09Z","date_created":"2022-06-20T06:16:09Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"type":"bachelorsthesis","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2022-06-20T06:16:09Z","_id":"31947","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"}],"department":[{"_id":"79"}],"user_id":"15504"},{"type":"conference","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."}],"status":"public","_id":"32602","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"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"477","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"place":"Dagstuhl, Germany","page":"8:1–8:22","intvolume":"       238","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>","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>.","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.","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)} }","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>"},"date_updated":"2022-11-17T14:18:24Z","volume":238,"author":[{"first_name":"Andreas","last_name":"Padalkin","id":"88238","full_name":"Padalkin, Andreas"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Daniel","id":"3902","full_name":"Warner, Daniel","last_name":"Warner"}],"doi":"10.4230/LIPIcs.DNA.28.8","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","language":[{"iso":"eng"}],"year":"2022","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-08-08T17:32:19Z","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model"}]