[{"_id":"52318","date_updated":"2024-03-05T12:53:25Z","citation":{"short":"S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024.","ieee":"S. Dorociak, Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung. 2024.","chicago":"Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024.","apa":"Dorociak, S. (2024). Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung.","ama":"Dorociak S. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung.; 2024.","mla":"Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung. 2024.","bibtex":"@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }"},"type":"bachelorsthesis","year":"2024","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"title":"Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung","user_id":"15578","author":[{"full_name":"Dorociak, Svitlana","first_name":"Svitlana","last_name":"Dorociak"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"status":"public","date_created":"2024-03-05T12:52:59Z"},{"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"}],"date_created":"2023-03-27T07:45:44Z","status":"public","volume":950,"publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"author":[{"id":"34727","last_name":"Götte","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Julian","full_name":"Werthmann, Julian","last_name":"Werthmann","id":"50024"}],"user_id":"15504","title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","language":[{"iso":"eng"}],"page":"113756","type":"journal_article","citation":{"ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi: 10.1016/j.tcs.2023.113756.","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={10.1016/j.tcs.2023.113756}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.","apa":"Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950, 113756. https://doi.org/10.1016/j.tcs.2023.113756","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor Comput Sci. 2023;950:113756. doi:10.1016/j.tcs.2023.113756","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci. 950 (2023): 113756. https://doi.org/10.1016/j.tcs.2023.113756."},"year":"2023","doi":"10.1016/j.tcs.2023.113756","date_updated":"2023-03-27T09:55:04Z","_id":"43109","intvolume":" 950"},{"user_id":"15504","title":"Minimum Edge Cuts in Overlay Networks","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":"2023-05-11T05:50:41Z","status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Schweichhart","full_name":"Schweichhart, Jonas","first_name":"Jonas"}],"date_updated":"2023-05-11T05:51:15Z","_id":"44735","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"type":"mastersthesis","year":"2023","citation":{"ieee":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks. 2023.","short":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.","mla":"Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks. 2023.","bibtex":"@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks}, author={Schweichhart, Jonas}, year={2023} }","apa":"Schweichhart, J. (2023). Minimum Edge Cuts in Overlay Networks.","ama":"Schweichhart J. Minimum Edge Cuts in Overlay Networks.; 2023.","chicago":"Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks, 2023."}},{"doi":"10.48550/ARXIV.2210.05333","date_updated":"2023-05-22T09:37:25Z","_id":"45188","language":[{"iso":"eng"}],"type":"conference","year":"2023","citation":{"ieee":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: 10.48550/ARXIV.2210.05333.","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.","mla":"Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.","bibtex":"@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={10.48550/ARXIV.2210.05333}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }","chicago":"Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. https://doi.org/10.48550/ARXIV.2210.05333.","apa":"Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., & Schneider, P. (2023). Routing Schemes for Hybrid Communication Networks. https://doi.org/10.48550/ARXIV.2210.05333","ama":"Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:10.48550/ARXIV.2210.05333"},"user_id":"50024","title":"Routing Schemes for Hybrid Communication Networks","status":"public","date_created":"2023-05-22T09:17:50Z","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"}],"author":[{"id":"50024","last_name":"Werthmann","full_name":"Werthmann, Julian","first_name":"Julian"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Sam","full_name":"Coy, Sam","last_name":"Coy"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Schneider","first_name":"Philipp","full_name":"Schneider, Philipp"}],"department":[{"_id":"79"}]},{"title":"Utilizing Redundancy in Distributed Heterogeneous Storage","ddc":["004"],"user_id":"15504","date_created":"2023-07-13T12:46:28Z","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"status":"public","has_accepted_license":"1","department":[{"_id":"79"}],"file_date_updated":"2023-07-17T07:05:05Z","author":[{"last_name":"Schneider","full_name":"Schneider, Fabian","first_name":"Fabian"}],"file":[{"access_level":"closed","date_created":"2023-07-17T07:05:05Z","file_name":"BA-Schneider.pdf","content_type":"application/pdf","date_updated":"2023-07-17T07:05:05Z","relation":"main_file","success":1,"file_size":1977565,"file_id":"46071","creator":"florida"}],"date_updated":"2023-07-17T07:05:22Z","_id":"46053","type":"bachelorsthesis","year":"2023","citation":{"chicago":"Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage, 2023.","apa":"Schneider, F. (2023). Utilizing Redundancy in Distributed Heterogeneous Storage.","ama":"Schneider F. Utilizing Redundancy in Distributed Heterogeneous Storage.; 2023.","bibtex":"@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous Storage}, author={Schneider, Fabian}, year={2023} }","mla":"Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage. 2023.","short":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage, 2023.","ieee":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage. 2023."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}]},{"date_created":"2023-07-19T06:09:17Z","status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Ranade","full_name":"Ranade, Amruta","first_name":"Amruta"}],"user_id":"15504","title":"Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"type":"mastersthesis","year":"2023","citation":{"bibtex":"@book{Ranade_2023, title={Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption}, author={Ranade, Amruta}, year={2023} }","mla":"Ranade, Amruta. Graph Neural Network-Based Anomaly Detection in Smart Grid Energy Consumption. 2023.","ama":"Ranade A. Graph Neural Network-Based Anomaly Detection in Smart Grid Energy Consumption.; 2023.","apa":"Ranade, A. (2023). Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption.","chicago":"Ranade, Amruta. Graph Neural Network-Based Anomaly Detection in Smart Grid Energy Consumption, 2023.","ieee":"A. Ranade, Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption. 2023.","short":"A. Ranade, Graph Neural Network-Based Anomaly Detection in Smart Grid Energy Consumption, 2023."},"date_updated":"2023-07-19T06:09:36Z","_id":"46087"},{"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"year":"2023","type":"mastersthesis","citation":{"bibtex":"@book{Ali_2023, title={Highly accurate deep compressed facial recognition}, author={Ali, Osama}, year={2023} }","mla":"Ali, Osama. Highly Accurate Deep Compressed Facial Recognition. 2023.","chicago":"Ali, Osama. Highly Accurate Deep Compressed Facial Recognition, 2023.","ama":"Ali O. Highly Accurate Deep Compressed Facial Recognition.; 2023.","apa":"Ali, O. (2023). Highly accurate deep compressed facial recognition.","ieee":"O. Ali, Highly accurate deep compressed facial recognition. 2023.","short":"O. Ali, Highly Accurate Deep Compressed Facial Recognition, 2023."},"date_updated":"2023-07-19T06:09:31Z","_id":"46086","department":[{"_id":"79"}],"author":[{"first_name":"Osama","full_name":"Ali, Osama","last_name":"Ali"}],"date_created":"2023-07-19T06:08:13Z","status":"public","user_id":"15504","title":"Highly accurate deep compressed facial recognition"},{"type":"mastersthesis","year":"2023","citation":{"chicago":"Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.","apa":"Ashri, N. (2023). Virtual On-Demand Volunteer System Based on Delaunay Triangulation.","ama":"Ashri N. 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} }","mla":"Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation. 2023.","short":"N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.","ieee":"N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation. 2023."},"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"_id":"46110","date_updated":"2023-07-21T08:53:13Z","author":[{"last_name":"Ashri","full_name":"Ashri, Nivedita","first_name":"Nivedita"}],"department":[{"_id":"79"}],"status":"public","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"},{"_id":"5","grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"}],"date_created":"2023-07-21T08:52:38Z","title":"Virtual On-Demand Volunteer System Based on Delaunay Triangulation","user_id":"15504"},{"_id":"46221","date_updated":"2023-07-31T10:49:30Z","type":"mastersthesis","year":"2023","citation":{"short":"N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023.","ieee":"N. N., Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks. 2023.","apa":"N., N. (2023). Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks.","ama":"N. N. Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks.; 2023.","chicago":"N., N. Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 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} }","mla":"N., N. Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks. 2023."},"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"title":"Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks","user_id":"15504","date_created":"2023-07-31T10:49:12Z","status":"public","department":[{"_id":"79"}],"author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}]},{"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","grant_number":"160364472"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"}],"date_created":"2023-09-20T09:59:41Z","status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Deppe","first_name":"Volker","full_name":"Deppe, Volker"}],"title":"Routing in Hypergraphs","user_id":"15504","citation":{"bibtex":"@book{Deppe_2023, title={Routing in Hypergraphs}, author={Deppe, Volker}, year={2023} }","mla":"Deppe, Volker. Routing in Hypergraphs. 2023.","chicago":"Deppe, Volker. Routing in Hypergraphs, 2023.","apa":"Deppe, V. (2023). Routing in Hypergraphs.","ama":"Deppe V. Routing in Hypergraphs.; 2023.","ieee":"V. Deppe, Routing in Hypergraphs. 2023.","short":"V. Deppe, Routing in Hypergraphs, 2023."},"type":"bachelorsthesis","year":"2023","language":[{"iso":"eng"}],"date_updated":"2023-09-20T10:00:48Z","_id":"47134"}]