--- _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' ... --- _id: '32603' author: - first_name: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - 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: 'Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation 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:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9' apa: Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape Formation 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. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.9 bibtex: '@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant Shape Formation in the Amoebot Model}, volume={238}, DOI={10.4230/LIPIcs.DNA.28.9}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation 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:9:1–9: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.9.' ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi: 10.4230/LIPIcs.DNA.28.9.' mla: Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation 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. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9. short: 'I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22.' date_created: 2022-08-08T17:42:43Z date_updated: 2022-11-17T14:17:09Z department: - _id: '79' doi: 10.4230/LIPIcs.DNA.28.9 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: 9:1–9:22 place: Dagstuhl, Germany 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' 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: Fault-Tolerant Shape Formation in the Amoebot Model type: conference user_id: '477' volume: 238 year: '2022' ... --- _id: '33230' 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. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:10.4230/LIPIcs.SAND.2022.12' apa: Daymude, J. J., Richa, A. W., & Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.12 bibtex: '@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}, volume={221}, DOI={10.4230/LIPIcs.SAND.2022.12}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19}, collection={LIPIcs} }' chicago: Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.12. ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi: 10.4230/LIPIcs.SAND.2022.12.' mla: Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12. short: 'J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.' date_created: 2022-08-30T06:31:21Z date_updated: 2022-08-30T06:33:44Z department: - _id: '79' doi: 10.4230/LIPIcs.SAND.2022.12 editor: - first_name: James full_name: Aspnes, James last_name: Aspnes - first_name: Othon full_name: Michail, Othon last_name: Michail intvolume: ' 221' language: - iso: eng page: 12:1–12:19 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: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems type: conference user_id: '15504' volume: 221 year: '2022' ... --- _id: '33240' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556' apa: 'Götte, T., & Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal & I.-T. A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022 (pp. 99–101). ACM. https://doi.org/10.1145/3490148.3538556' bibtex: '@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}, DOI={10.1145/3490148.3538556}, booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina}, year={2022}, pages={99–101} }' chicago: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” In SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. https://doi.org/10.1145/3490148.3538556.' ieee: 'T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101, doi: 10.1145/3490148.3538556.' mla: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.' short: 'T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.' date_created: 2022-09-01T07:55:00Z date_updated: 2022-09-01T07:57:53Z department: - _id: '79' doi: 10.1145/3490148.3538556 editor: - first_name: Kunal full_name: Agrawal, Kunal last_name: Agrawal - first_name: I-Ting Angelina full_name: Lee, I-Ting Angelina last_name: Lee language: - iso: eng page: 99–101 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' publication: 'SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022' publisher: ACM status: public title: 'Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion' type: conference user_id: '15504' year: '2022' ... --- _id: '30987' author: - first_name: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - 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: 'Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23' apa: 'Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.23' bibtex: '@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}, volume={221}, DOI={10.4230/LIPIcs.SAND.2022.23}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={23:1–23:3}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.23.' ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022, vol. 221, p. 23:1–23:3, doi: 10.4230/LIPIcs.SAND.2022.23.' mla: 'Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.' short: 'I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.' date_created: 2022-05-03T00:13:06Z date_updated: 2022-10-27T08:45:52Z department: - _id: '79' doi: 10.4230/LIPIcs.SAND.2022.23 editor: - first_name: James full_name: Aspnes, James last_name: Aspnes - first_name: Othon full_name: Michail, Othon last_name: Michail intvolume: ' 221' language: - iso: eng page: 23:1–23:3 place: Dagstuhl, Germany 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' publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) publication_identifier: isbn: - 978-3-95977-224-2 issn: - 1868-8969 publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model' type: conference user_id: '15504' volume: 221 year: '2022' ... --- _id: '33967' author: - first_name: Marcos full_name: Aguiliera, Marcos last_name: Aguiliera - first_name: Andréa W. full_name: Richa, Andréa W. last_name: Richa - first_name: Alexander A. full_name: Schwarzmann, Alexander A. last_name: Schwarzmann - first_name: Alessandro full_name: Panconesi, Alessandro last_name: Panconesi - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Philipp full_name: Woelfel, Philipp last_name: Woelfel citation: ama: 'Aguiliera M, Richa AW, Schwarzmann AA, Panconesi A, Scheideler C, Woelfel P. 2022 Edsger W. Dijkstra Prize in Distributed Computing. In: Milani A, Woelfel P, eds. PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM; 2022:1. doi:10.1145/3519270.3538411' apa: 'Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler, C., & Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing. In A. Milani & P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 (p. 1). ACM. https://doi.org/10.1145/3519270.3538411' bibtex: '@inproceedings{Aguiliera_Richa_Schwarzmann_Panconesi_Scheideler_Woelfel_2022, title={2022 Edsger W. Dijkstra Prize in Distributed Computing}, DOI={10.1145/3519270.3538411}, booktitle={PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}, publisher={ACM}, author={Aguiliera, Marcos and Richa, Andréa W. and Schwarzmann, Alexander A. and Panconesi, Alessandro and Scheideler, Christian and Woelfel, Philipp}, editor={Milani, Alessia and Woelfel, Philipp}, year={2022}, pages={1} }' chicago: 'Aguiliera, Marcos, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, and Philipp Woelfel. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” In PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, 1. ACM, 2022. https://doi.org/10.1145/3519270.3538411.' ieee: 'M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler, and P. Woelfel, “2022 Edsger W. Dijkstra Prize in Distributed Computing,” in PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, 2022, p. 1, doi: 10.1145/3519270.3538411.' mla: 'Aguiliera, Marcos, et al. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:10.1145/3519270.3538411.' short: 'M. Aguiliera, A.W. Richa, A.A. Schwarzmann, A. Panconesi, C. Scheideler, P. Woelfel, in: A. Milani, P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, ACM, 2022, p. 1.' date_created: 2022-11-02T08:53:37Z date_updated: 2022-11-02T08:56:16Z department: - _id: '79' doi: 10.1145/3519270.3538411 editor: - first_name: Alessia full_name: Milani, Alessia last_name: Milani - first_name: Philipp full_name: Woelfel, Philipp last_name: Woelfel language: - iso: eng page: '1' 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: 'PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022' publisher: ACM status: public title: 2022 Edsger W. Dijkstra Prize in Distributed Computing type: conference user_id: '15504' year: '2022' ... --- _id: '33968' citation: ama: Scheideler C, ed. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. apa: Scheideler, C. (Ed.). (2022). 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA (Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. bibtex: '@book{Scheideler_2022, series={LIPIcs}, title={36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA}, volume={246}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year={2022}, collection={LIPIcs} }' chicago: Scheideler, Christian, ed. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol. 246. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. ieee: C. Scheideler, Ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. mla: Scheideler, Christian, editor. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. short: C. Scheideler, ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. date_created: 2022-11-02T08:55:30Z date_updated: 2022-11-02T08:56:13Z department: - _id: '79' editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler intvolume: ' 246' 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' publication_identifier: isbn: - 978-3-95977-255-6 publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA type: conference_editor user_id: '15504' volume: 246 year: '2022' ... --- _id: '30239' author: - first_name: Christina full_name: Kolb, Christina last_name: Kolb citation: ama: Kolb C. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks.; 2022. doi:10.17619/UNIPB/1-1673 apa: Kolb, C. (2022). Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks. https://doi.org/10.17619/UNIPB/1-1673 bibtex: '@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}, DOI={10.17619/UNIPB/1-1673 }, author={Kolb, Christina}, year={2022} }' chicago: Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022. https://doi.org/10.17619/UNIPB/1-1673 . ieee: C. Kolb, Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks. 2022. mla: Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks. 2022, doi:10.17619/UNIPB/1-1673 . short: C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022. date_created: 2022-03-11T06:05:54Z date_updated: 2023-03-17T07:22:04Z department: - _id: '79' doi: '10.17619/UNIPB/1-1673 ' 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: Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks type: dissertation user_id: '15504' year: '2022' ... --- _id: '21096' abstract: - lang: eng text: While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys. article_number: '104697' author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697 apa: Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697 bibtex: '@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={10.1016/j.ic.2021.104697}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }' chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2021.104697. ieee: 'T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.' mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697. short: T. Knollmann, C. Scheideler, Information and Computation (2022). date_created: 2021-01-29T09:39:40Z date_updated: 2023-03-27T07:56:48Z department: - _id: '63' - _id: '79' doi: 10.1016/j.ic.2021.104697 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published status: public title: A self-stabilizing Hashed Patricia Trie type: journal_article user_id: '15504' year: '2022' ... --- _id: '24887' author: - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal citation: ama: Hinnenthal K. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter.; 2021. doi:10.17619/UNIPB/1-1169 apa: Hinnenthal, K. (2021). Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. https://doi.org/10.17619/UNIPB/1-1169 bibtex: '@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter}, DOI={10.17619/UNIPB/1-1169 }, author={Hinnenthal, Kristian}, year={2021} }' chicago: Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021. https://doi.org/10.17619/UNIPB/1-1169 . ieee: K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021. mla: Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021, doi:10.17619/UNIPB/1-1169 . short: K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021. date_created: 2021-09-22T12:33:44Z date_updated: 2022-01-06T06:56:40Z department: - _id: '79' doi: '10.17619/UNIPB/1-1169 ' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter type: dissertation user_id: '15504' year: '2021' ... --- _id: '25126' abstract: - lang: eng text: Motivated by the prospect of computing agents that explore unknown environments and construct convex hulls on the nanoscale, we investigate the capabilities and limitations of a single deterministic finite automaton robot in the three-dimensional hybrid model for programmable matter. In this model, active robots move on a set of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra on the adjacency graph of the face-centered cubic sphere-packing. We show that the exploration problem is equally hard in the hybrid model and in three-dimensional mazes, in which tiles have the shape of cubes and are positioned at the vertices of $\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot solve this problem in the hybrid model on arbitrary configurations. We provide algorithms for a robot with two pebbles that solve the exploration problem in the subclass of compact configurations of size $n$ in $\O(n^3)$ rounds. Further, we investigate the robot's capabilities of detection and hull construction in terms of restricted orientation convexity. We show that a robot without any pebble can detect strong $\O$-convexity in $\O(n)$ rounds, but cannot detect weak $\O$-convexity, not even if provided with a single pebble. Assuming that a robot can construct tiles from scratch and deconstruct previously constructed tiles, we show that the strong $\O$-hull of any given configuration of size $n$ can be constructed in $\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native tiles. author: - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke citation: ama: Liedtke DJ. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021. apa: Liedtke, D. J. (2021). Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. bibtex: '@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021} }' chicago: Liedtke, David Jan. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021. ieee: D. J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021. mla: Liedtke, David Jan. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021. short: D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021. date_created: 2021-09-29T12:37:39Z date_updated: 2022-01-06T06:56:53Z ddc: - '000' department: - _id: '79' file: - access_level: local content_type: application/pdf creator: liedtke date_created: 2021-09-29T12:34:47Z date_updated: 2021-09-29T12:34:47Z file_id: '25128' file_name: Master - Thesis.pdf file_size: 10114825 relation: main_file file_date_updated: 2021-09-29T12:34:47Z has_accepted_license: '1' keyword: - Robot Exploration - Finite Automaton - Hybrid Model for Programmable Matter - Convex Hull language: - iso: eng status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model type: mastersthesis user_id: '55557' year: '2021' ...