[{"type":"bachelorsthesis","year":"2024","citation":{"bibtex":"@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }","mla":"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.","chicago":"Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024.","ieee":"S. Dorociak, Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung. 2024.","short":"S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024."},"language":[{"iso":"eng"}],"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"_id":"52318","date_updated":"2024-03-05T12:53:25Z","status":"public","date_created":"2024-03-05T12:52:59Z","author":[{"first_name":"Svitlana","full_name":"Dorociak, Svitlana","last_name":"Dorociak"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"title":"Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung","user_id":"15578"},{"volume":950,"status":"public","date_created":"2023-03-27T07:45:44Z","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"}],"author":[{"id":"34727","last_name":"Götte","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"full_name":"Kolb, Christina","first_name":"Christina","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Werthmann","id":"50024","first_name":"Julian","full_name":"Werthmann, Julian"}],"department":[{"_id":"79"}],"publication":"Theor. Comput. Sci.","title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","user_id":"15504","year":"2023","type":"journal_article","citation":{"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.","bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={10.1016/j.tcs.2023.113756}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi: 10.1016/j.tcs.2023.113756."},"page":"113756","language":[{"iso":"eng"}],"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","status":"public","date_created":"2023-05-11T05:50:41Z","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"}],"author":[{"first_name":"Jonas","full_name":"Schweichhart, Jonas","last_name":"Schweichhart"}],"department":[{"_id":"79"}],"date_updated":"2023-05-11T05:51:15Z","_id":"44735","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"type":"mastersthesis","citation":{"ieee":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks. 2023.","short":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.","bibtex":"@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks}, author={Schweichhart, Jonas}, year={2023} }","mla":"Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks. 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."},"year":"2023"},{"title":"Routing Schemes for Hybrid Communication Networks","user_id":"50024","date_created":"2023-05-22T09:17:50Z","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"}],"status":"public","department":[{"_id":"79"}],"author":[{"full_name":"Werthmann, Julian","first_name":"Julian","id":"50024","last_name":"Werthmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Coy, Sam","first_name":"Sam","last_name":"Coy"},{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Schneider","first_name":"Philipp","full_name":"Schneider, Philipp"}],"doi":"10.48550/ARXIV.2210.05333","_id":"45188","date_updated":"2023-05-22T09:37:25Z","citation":{"short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.","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.","ama":"Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:10.48550/ARXIV.2210.05333","apa":"Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., & Schneider, P. (2023). Routing Schemes for Hybrid Communication Networks. https://doi.org/10.48550/ARXIV.2210.05333","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.","bibtex":"@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={10.48550/ARXIV.2210.05333}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }","mla":"Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333."},"type":"conference","year":"2023","language":[{"iso":"eng"}]},{"file":[{"file_name":"BA-Schneider.pdf","date_created":"2023-07-17T07:05:05Z","access_level":"closed","file_size":1977565,"creator":"florida","file_id":"46071","content_type":"application/pdf","date_updated":"2023-07-17T07:05:05Z","relation":"main_file","success":1}],"author":[{"full_name":"Schneider, Fabian","first_name":"Fabian","last_name":"Schneider"}],"file_date_updated":"2023-07-17T07:05:05Z","department":[{"_id":"79"}],"has_accepted_license":"1","status":"public","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"}],"user_id":"15504","title":"Utilizing Redundancy in Distributed Heterogeneous Storage","ddc":["004"],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","citation":{"ama":"Schneider F. Utilizing Redundancy in Distributed Heterogeneous Storage.; 2023.","apa":"Schneider, F. (2023). Utilizing Redundancy in Distributed Heterogeneous Storage.","chicago":"Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage, 2023.","mla":"Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage. 2023.","bibtex":"@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous Storage}, author={Schneider, Fabian}, year={2023} }","short":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage, 2023.","ieee":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage. 2023."},"year":"2023","date_updated":"2023-07-17T07:05:22Z","_id":"46053"},{"type":"mastersthesis","citation":{"short":"A. Ranade, 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.","chicago":"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.","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."},"year":"2023","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"_id":"46087","date_updated":"2023-07-19T06:09:36Z","date_created":"2023-07-19T06:09:17Z","status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Ranade","full_name":"Ranade, Amruta","first_name":"Amruta"}],"title":"Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption","user_id":"15504"},{"title":"Highly accurate deep compressed facial recognition","user_id":"15504","author":[{"last_name":"Ali","full_name":"Ali, Osama","first_name":"Osama"}],"department":[{"_id":"79"}],"status":"public","date_created":"2023-07-19T06:08:13Z","_id":"46086","date_updated":"2023-07-19T06:09:31Z","year":"2023","citation":{"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.","mla":"Ali, Osama. Highly Accurate Deep Compressed Facial Recognition. 2023.","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.","ieee":"O. Ali, Highly accurate deep compressed facial recognition. 2023."},"type":"mastersthesis","supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"language":[{"iso":"eng"}]},{"title":"Virtual On-Demand Volunteer System Based on Delaunay Triangulation","user_id":"15504","department":[{"_id":"79"}],"author":[{"full_name":"Ashri, Nivedita","first_name":"Nivedita","last_name":"Ashri"}],"date_created":"2023-07-21T08:52:38Z","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","grant_number":"160364472"}],"status":"public","date_updated":"2023-07-21T08:53:13Z","_id":"46110","year":"2023","type":"mastersthesis","citation":{"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.","chicago":"Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.","mla":"Ashri, Nivedita. 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} }","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."},"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"language":[{"iso":"eng"}]},{"year":"2023","citation":{"ieee":"N. N., Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks. 2023.","short":"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.","chicago":"N., N. Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023.","ama":"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."},"type":"mastersthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_updated":"2023-07-31T10:49:30Z","_id":"46221","department":[{"_id":"79"}],"author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"date_created":"2023-07-31T10:49:12Z","status":"public","title":"Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks","user_id":"15504"},{"language":[{"iso":"eng"}],"type":"bachelorsthesis","citation":{"bibtex":"@book{Deppe_2023, title={Routing in Hypergraphs}, author={Deppe, Volker}, year={2023} }","mla":"Deppe, Volker. Routing in Hypergraphs. 2023.","apa":"Deppe, V. (2023). Routing in Hypergraphs.","ama":"Deppe V. Routing in Hypergraphs.; 2023.","chicago":"Deppe, Volker. Routing in Hypergraphs, 2023.","ieee":"V. Deppe, Routing in Hypergraphs. 2023.","short":"V. Deppe, Routing in Hypergraphs, 2023."},"year":"2023","date_updated":"2023-09-20T10:00:48Z","_id":"47134","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"_id":"5","grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"}],"date_created":"2023-09-20T09:59:41Z","author":[{"last_name":"Deppe","full_name":"Deppe, Volker","first_name":"Volker"}],"department":[{"_id":"79"}],"user_id":"15504","title":"Routing in Hypergraphs"},{"title":"Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite","user_id":"15578","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":"eng"}],"date_created":"2023-10-24T13:22:08Z","status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Decking","first_name":"Leo","full_name":"Decking, Leo"}],"_id":"48430","date_updated":"2023-10-24T13:25:05Z","citation":{"chicago":"Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.","ama":"Decking L. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite.; 2023.","apa":"Decking, L. (2023). Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite.","bibtex":"@book{Decking_2023, title={Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite}, author={Decking, Leo}, year={2023} }","mla":"Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite. 2023.","short":"L. Decking, Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.","ieee":"L. Decking, Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite. 2023."},"type":"bachelorsthesis","year":"2023","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}]},{"title":"Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames","user_id":"15578","date_created":"2023-12-05T15:22:55Z","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"author":[{"full_name":"Nickel, Alexander","first_name":"Alexander","last_name":"Nickel"}],"_id":"49494","date_updated":"2023-12-05T15:23:12Z","year":"2023","type":"bachelorsthesis","citation":{"short":"A. Nickel, Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.","ieee":"A. Nickel, Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames. 2023.","chicago":"Nickel, Alexander. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.","ama":"Nickel A. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames.; 2023.","apa":"Nickel, A. (2023). Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames.","mla":"Nickel, Alexander. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames. 2023.","bibtex":"@book{Nickel_2023, title={Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames}, author={Nickel, Alexander}, year={2023} }"},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"}],"language":[{"iso":"eng"}]},{"type":"mastersthesis","year":"2023","citation":{"mla":"Telaprolu, Vipasyan. 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. Reconstruction of 3D Surfels from Neural Radiance Fields.; 2023.","apa":"Telaprolu, V. (2023). Reconstruction of 3D Surfels from Neural Radiance Fields.","chicago":"Telaprolu, Vipasyan. Reconstruction of 3D Surfels from Neural Radiance Fields, 2023.","ieee":"V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields. 2023.","short":"V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields, 2023."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2023-12-05T15:20:10Z","_id":"49493","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"author":[{"first_name":"Vipasyan","full_name":"Telaprolu, Vipasyan","last_name":"Telaprolu"}],"date_created":"2023-12-05T15:19:46Z","status":"public","title":"Reconstruction of 3D Surfels from Neural Radiance Fields","user_id":"15578"},{"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"author":[{"first_name":"Jonas","full_name":"Friemel, Jonas","last_name":"Friemel"}],"date_created":"2023-12-05T15:18:17Z","status":"public","title":"Shape Reconfiguration by Hybrid Programmable Matter","user_id":"15578","year":"2023","type":"mastersthesis","citation":{"short":"J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter, 2023.","ieee":"J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter. 2023.","apa":"Friemel, J. (2023). Shape Reconfiguration by Hybrid Programmable Matter.","ama":"Friemel J. Shape Reconfiguration by Hybrid Programmable Matter.; 2023.","chicago":"Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter, 2023.","bibtex":"@book{Friemel_2023, title={Shape Reconfiguration by Hybrid Programmable Matter}, author={Friemel, Jonas}, year={2023} }","mla":"Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter. 2023."},"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_updated":"2023-12-05T15:18:41Z","_id":"49492"},{"_id":"52317","date_updated":"2024-03-05T12:49:22Z","type":"mastersthesis","year":"2023","citation":{"short":"B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.","ieee":"B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-bounded Metric. 2023.","chicago":"Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.","apa":"Beckendorf, B. (2023). Self-Stabilizing Skip-Graph with Growth-bounded Metric.","ama":"Beckendorf B. Self-Stabilizing Skip-Graph with Growth-Bounded Metric.; 2023.","bibtex":"@book{Beckendorf_2023, title={Self-Stabilizing Skip-Graph with Growth-bounded Metric}, author={Beckendorf, Björn}, year={2023} }","mla":"Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric. 2023."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"title":"Self-Stabilizing Skip-Graph with Growth-bounded Metric","user_id":"15578","status":"public","date_created":"2024-03-05T12:48:39Z","author":[{"last_name":"Beckendorf","full_name":"Beckendorf, Björn","first_name":"Björn"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}]},{"year":"2022","type":"mastersthesis","citation":{"chicago":"Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique, 2022.","apa":"Roopa, R. (2022). Evaluation of Algorithms for the Node Capacitated Clique.","ama":"Roopa R. Evaluation of Algorithms for the Node Capacitated Clique.; 2022.","bibtex":"@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated Clique}, author={Roopa, Rajanna}, year={2022} }","mla":"Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique. 2022.","short":"R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.","ieee":"R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique. 2022."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2022-02-28T07:46:53Z","_id":"30152","department":[{"_id":"79"}],"author":[{"last_name":"Roopa","full_name":"Roopa, Rajanna","first_name":"Rajanna"}],"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"}],"date_created":"2022-02-28T07:46:23Z","status":"public","title":"Evaluation of Algorithms for the Node Capacitated Clique","user_id":"15504"},{"title":"Aufarbeitung und lmplementierung von DAG-Rider","user_id":"15504","date_created":"2022-03-03T07:47:00Z","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"}],"status":"public","department":[{"_id":"79"}],"author":[{"first_name":"Sebastian","full_name":"Korzeczek, Sebastian","last_name":"Korzeczek"}],"_id":"30198","date_updated":"2022-03-03T07:51:02Z","type":"bachelorsthesis","citation":{"bibtex":"@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider}, author={Korzeczek, Sebastian}, year={2022} }","mla":"Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider. 2022.","chicago":"Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.","ama":"Korzeczek S. Aufarbeitung Und Lmplementierung von DAG-Rider.; 2022.","apa":"Korzeczek, S. (2022). Aufarbeitung und lmplementierung von DAG-Rider.","ieee":"S. Korzeczek, Aufarbeitung und lmplementierung von DAG-Rider. 2022.","short":"S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022."},"year":"2022","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"date_updated":"2022-03-03T07:50:59Z","_id":"30199","year":"2022","type":"mastersthesis","citation":{"apa":"Nachtigall, M. (2022). Hybrid Routing in Three Dimensions.","ama":"Nachtigall M. Hybrid Routing in Three Dimensions.; 2022.","chicago":"Nachtigall, Marcel. Hybrid Routing in Three Dimensions, 2022.","bibtex":"@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall, Marcel}, year={2022} }","mla":"Nachtigall, Marcel. Hybrid Routing in Three Dimensions. 2022.","short":"M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.","ieee":"M. Nachtigall, Hybrid Routing in Three Dimensions. 2022."},"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"title":"Hybrid Routing in Three Dimensions","user_id":"15504","department":[{"_id":"79"}],"author":[{"first_name":"Marcel","full_name":"Nachtigall, Marcel","last_name":"Nachtigall"}],"date_created":"2022-03-03T07:50:45Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"status":"public"},{"volume":29,"status":"public","date_created":"2022-05-04T12:29:22Z","author":[{"last_name":"Feldmann","full_name":"Feldmann, Michael","first_name":"Michael"},{"id":"88238","last_name":"Padalkin","full_name":"Padalkin, Andreas","first_name":"Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Dolev","full_name":"Dolev, Shlomi","first_name":"Shlomi"}],"publication":"J. Comput. Biol.","department":[{"_id":"79"}],"title":"Coordinating Amoebots via Reconfigurable Circuits","user_id":"15504","citation":{"ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” J. Comput. Biol., vol. 29, no. 4, pp. 317–343, 2022, doi: 10.1089/cmb.2021.0363.","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363.","bibtex":"@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={29}, DOI={10.1089/cmb.2021.0363}, number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343} }","apa":"Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2022). Coordinating Amoebots via Reconfigurable Circuits. J. Comput. Biol., 29(4), 317–343. https://doi.org/10.1089/cmb.2021.0363","ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. J Comput Biol. 2022;29(4):317–343. doi:10.1089/cmb.2021.0363","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol. 29, no. 4 (2022): 317–343. https://doi.org/10.1089/cmb.2021.0363."},"type":"journal_article","year":"2022","page":"317–343","language":[{"iso":"eng"}],"doi":"10.1089/cmb.2021.0363","issue":"4","_id":"31060","date_updated":"2022-05-04T12:31:27Z","intvolume":" 29"},{"date_created":"2022-06-20T06:16:32Z","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","has_accepted_license":"1","file":[{"file_id":"31950","creator":"florida","file_size":1585281,"success":1,"relation":"main_file","date_updated":"2022-06-20T06:16:09Z","content_type":"application/pdf","file_name":"BA_Hillebrandt.pdf","date_created":"2022-06-20T06:16:09Z","access_level":"closed"}],"file_date_updated":"2022-06-20T06:16:09Z","department":[{"_id":"79"}],"author":[{"full_name":"Hillebrandt, Henning","first_name":"Henning","last_name":"Hillebrandt"}],"user_id":"15504","ddc":["000"],"title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"citation":{"ieee":"H. Hillebrandt, Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen. 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} }","mla":"Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen. 2022.","chicago":"Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","apa":"Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen.","ama":"Hillebrandt H. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen.; 2022."},"type":"bachelorsthesis","year":"2022","_id":"31947","date_updated":"2022-06-20T06:16:49Z"}]