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