[{"language":[{"iso":"eng"}],"_id":"31947","user_id":"15504","ddc":["000"],"author":[{"last_name":"Hillebrandt","first_name":"Henning","full_name":"Hillebrandt, Henning"}],"status":"public","year":"2022","title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","has_accepted_license":"1","date_updated":"2022-06-20T06:16:49Z","date_created":"2022-06-20T06:16:32Z","file":[{"date_created":"2022-06-20T06:16:09Z","creator":"florida","file_id":"31950","success":1,"content_type":"application/pdf","file_name":"BA_Hillebrandt.pdf","file_size":1585281,"access_level":"closed","relation":"main_file","date_updated":"2022-06-20T06:16:09Z"}],"department":[{"_id":"79"}],"type":"bachelorsthesis","citation":{"short":"H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","chicago":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>, 2022.","ieee":"H. Hillebrandt, <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","apa":"Hillebrandt, H. (2022). <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>.","bibtex":"@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }","ama":"Hillebrandt H. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>.; 2022.","mla":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>. 2022."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"file_date_updated":"2022-06-20T06:16:09Z","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"}]},{"doi":"10.4230/LIPIcs.DNA.28.8","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"intvolume":"       238","date_updated":"2022-11-17T14:18:24Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"author":[{"id":"88238","last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner","id":"3902"}],"title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","year":"2022","department":[{"_id":"79"}],"type":"conference","date_created":"2022-08-08T17:32:19Z","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","volume":238,"editor":[{"full_name":"Ouldridge, Thomas E.","first_name":"Thomas E.","last_name":"Ouldridge"},{"full_name":"Wickham, Shelley F. J.","first_name":"Shelley F. J.","last_name":"Wickham"}],"user_id":"477","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"32602","page":"8:1–8:22","status":"public","place":"Dagstuhl, Germany","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"citation":{"bibtex":"@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","chicago":"Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>.","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.","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 8:1–8:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","apa":"Padalkin, A., Scheideler, C., &#38; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>"}},{"title":"Fault-Tolerant Shape Formation in the Amoebot Model","year":"2022","author":[{"full_name":"Kostitsyna, Irina","last_name":"Kostitsyna","first_name":"Irina"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel","id":"3902"}],"publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"date_updated":"2022-11-17T14:17:09Z","intvolume":"       238","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.DNA.28.9","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","date_created":"2022-08-08T17:42:43Z","type":"conference","department":[{"_id":"79"}],"status":"public","page":"9:1–9:22","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"32603","user_id":"477","editor":[{"first_name":"Thomas E.","last_name":"Ouldridge","full_name":"Ouldridge, Thomas E."},{"full_name":"Wickham, Shelley F. J.","last_name":"Wickham","first_name":"Shelley F. J."}],"volume":238,"citation":{"mla":"Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","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={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>}, 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)} }","ama":"Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 9:1–9:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>.","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."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"place":"Dagstuhl, Germany"},{"year":"2022","title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","author":[{"first_name":"Joshua J.","last_name":"Daymude","full_name":"Daymude, Joshua J."},{"first_name":"Andréa W.","last_name":"Richa","full_name":"Richa, Andréa W."},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-08-30T06:33:44Z","intvolume":"       221","series_title":"LIPIcs","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SAND.2022.12","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference","date_created":"2022-08-30T06:31:21Z","type":"conference","department":[{"_id":"79"}],"status":"public","page":"12:1–12:19","_id":"33230","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"15504","editor":[{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"first_name":"Othon","last_name":"Michail","full_name":"Michail, Othon"}],"volume":221,"citation":{"ieee":"J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, 2022, vol. 221, p. 12:1–12:19, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","apa":"Daymude, J. J., Richa, A. W., &#38; Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i> (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>","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.","chicago":"Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>.","mla":"Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","bibtex":"@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}, volume={221}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>}, 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} }","ama":"Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>"},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}]},{"year":"2022","status":"public","title":"Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion","author":[{"id":"34727","full_name":"Götte, Thorsten","first_name":"Thorsten","last_name":"Götte"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-09-01T07:57:53Z","page":"99–101","language":[{"iso":"eng"}],"_id":"33240","publisher":"ACM","doi":"10.1145/3490148.3538556","user_id":"15504","editor":[{"first_name":"Kunal","last_name":"Agrawal","full_name":"Agrawal, Kunal"},{"last_name":"Lee","first_name":"I-Ting Angelina","full_name":"Lee, I-Ting Angelina"}],"publication":"SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022","citation":{"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 <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, 2022, pp. 99–101, doi: <a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","apa":"Götte, T., &#38; Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal &#38; I.-T. A. Lee (Eds.), <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i> (pp. 99–101). ACM. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>","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.","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 <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>.","mla":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","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={<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>}, 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} }","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. <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>. ACM; 2022:99–101. doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>"},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"date_created":"2022-09-01T07:55:00Z","type":"conference","department":[{"_id":"79"}]},{"page":"23:1–23:3","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"30987","user_id":"15504","editor":[{"full_name":"Aspnes, James","first_name":"James","last_name":"Aspnes"},{"full_name":"Michail, Othon","last_name":"Michail","first_name":"Othon"}],"volume":221,"status":"public","place":"Dagstuhl, Germany","citation":{"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={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>}, 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)} }","ama":"Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>. Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>","mla":"Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, 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. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>.","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.","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, 2022, vol. 221, p. 23:1–23:3, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i> (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>"},"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"}],"language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPIcs.SAND.2022.23","title":"Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model","year":"2022","author":[{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel","id":"3902"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-224-2"]},"date_updated":"2022-10-27T08:45:52Z","intvolume":"       221","date_created":"2022-05-03T00:13:06Z","type":"conference","department":[{"_id":"79"}],"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)"},{"date_updated":"2022-11-02T08:56:16Z","year":"2022","status":"public","title":"2022 Edsger W. Dijkstra Prize in Distributed Computing","author":[{"first_name":"Marcos","last_name":"Aguiliera","full_name":"Aguiliera, Marcos"},{"first_name":"Andréa W.","last_name":"Richa","full_name":"Richa, Andréa W."},{"last_name":"Schwarzmann","first_name":"Alexander A.","full_name":"Schwarzmann, Alexander A."},{"full_name":"Panconesi, Alessandro","last_name":"Panconesi","first_name":"Alessandro"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"last_name":"Woelfel","first_name":"Philipp","full_name":"Woelfel, Philipp"}],"user_id":"15504","doi":"10.1145/3519270.3538411","editor":[{"first_name":"Alessia","last_name":"Milani","full_name":"Milani, Alessia"},{"full_name":"Woelfel, Philipp","first_name":"Philipp","last_name":"Woelfel"}],"page":"1","_id":"33967","publisher":"ACM","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"publication":"PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022","citation":{"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 <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>, 2022, p. 1, doi: <a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>.","apa":"Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler, C., &#38; Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing. In A. Milani &#38; P. Woelfel (Eds.), <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i> (p. 1). ACM. <a href=\"https://doi.org/10.1145/3519270.3538411\">https://doi.org/10.1145/3519270.3538411</a>","mla":"Aguiliera, Marcos, et al. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:<a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>.","bibtex":"@inproceedings{Aguiliera_Richa_Schwarzmann_Panconesi_Scheideler_Woelfel_2022, title={2022 Edsger W. Dijkstra Prize in Distributed Computing}, DOI={<a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>}, 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 <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>, edited by Alessia Milani and Philipp Woelfel, 1. ACM, 2022. <a href=\"https://doi.org/10.1145/3519270.3538411\">https://doi.org/10.1145/3519270.3538411</a>.","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. <i>PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022</i>. ACM; 2022:1. doi:<a href=\"https://doi.org/10.1145/3519270.3538411\">10.1145/3519270.3538411</a>","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."},"type":"conference","department":[{"_id":"79"}],"date_created":"2022-11-02T08:53:37Z"},{"citation":{"mla":"Scheideler, Christian, editor. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","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} }","ama":"Scheideler C, ed. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022.","ieee":"C. Scheideler, Ed., <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>, vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","apa":"Scheideler, C. (Ed.). (2022). <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i> (Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.","chicago":"Scheideler, Christian, ed. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Vol. 246. LIPIcs. 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."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"date_created":"2022-11-02T08:55:30Z","department":[{"_id":"79"}],"type":"conference_editor","publication_identifier":{"isbn":["978-3-95977-255-6"]},"title":"36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA","year":"2022","status":"public","intvolume":"       246","date_updated":"2022-11-02T08:56:13Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"33968","series_title":"LIPIcs","language":[{"iso":"eng"}],"editor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"volume":246,"user_id":"15504"},{"doi":"10.17619/UNIPB/1-1673 ","user_id":"15504","language":[{"iso":"eng"}],"_id":"30239","date_updated":"2023-03-17T07:22:04Z","author":[{"last_name":"Kolb","first_name":"Christina","full_name":"Kolb, Christina"}],"status":"public","title":"Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks","year":"2022","department":[{"_id":"79"}],"type":"dissertation","date_created":"2022-03-11T06:05:54Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"citation":{"bibtex":"@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>}, author={Kolb, Christina}, year={2022} }","ama":"Kolb C. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>","mla":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>.","chicago":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>.","short":"C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022.","ieee":"C. Kolb, <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. 2022.","apa":"Kolb, C. (2022). <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>"}},{"_id":"21096","language":[{"iso":"eng"}],"article_number":"104697","doi":"10.1016/j.ic.2021.104697","user_id":"15504","publication_identifier":{"issn":["0890-5401"]},"author":[{"id":"39241","full_name":"Knollmann, Till","first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"title":"A self-stabilizing Hashed Patricia Trie","status":"public","year":"2022","date_updated":"2023-03-27T07:56:48Z","publication_status":"published","date_created":"2021-01-29T09:39:40Z","department":[{"_id":"63"},{"_id":"79"}],"type":"journal_article","citation":{"chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>.","short":"T. Knollmann, C. Scheideler, Information and Computation (2022).","ieee":"T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” <i>Information and Computation</i>, Art. no. 104697, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","apa":"Knollmann, T., &#38; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>, Article 104697. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>","bibtex":"@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }","ama":"Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 104697, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>."},"publication":"Information and Computation","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"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."}]},{"user_id":"15504","doi":"10.17619/UNIPB/1-1169 ","_id":"24887","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:40Z","author":[{"full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","first_name":"Kristian","id":"32229"}],"year":"2021","title":"Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter","status":"public","department":[{"_id":"79"}],"type":"dissertation","date_created":"2021-09-22T12:33:44Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"mla":"Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>.","bibtex":"@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>}, author={Hinnenthal, Kristian}, year={2021} }","ama":"Hinnenthal K. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>","ieee":"K. Hinnenthal, <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. 2021.","apa":"Hinnenthal, K. (2021). <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">https://doi.org/10.17619/UNIPB/1-1169 </a>","chicago":"Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">https://doi.org/10.17619/UNIPB/1-1169 </a>.","short":"K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021."},"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"department":[{"_id":"79"}],"keyword":["Robot Exploration","Finite Automaton","Hybrid Model for Programmable Matter","Convex Hull"],"type":"mastersthesis","date_created":"2021-09-29T12:37:39Z","file":[{"creator":"liedtke","date_created":"2021-09-29T12:34:47Z","date_updated":"2021-09-29T12:34:47Z","relation":"main_file","file_size":10114825,"access_level":"local","file_name":"Master - Thesis.pdf","content_type":"application/pdf","file_id":"25128"}],"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."}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"short":"D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","chicago":"Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>, 2021.","ieee":"D. J. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","apa":"Liedtke, D. J. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.","bibtex":"@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021} }","ama":"Liedtke DJ. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.; 2021.","mla":"Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021."},"file_date_updated":"2021-09-29T12:34:47Z","ddc":["000"],"user_id":"55557","language":[{"iso":"eng"}],"_id":"25126","has_accepted_license":"1","date_updated":"2022-01-06T06:56:53Z","author":[{"id":"55557","full_name":"Liedtke, David Jan","first_name":"David Jan","last_name":"Liedtke"}],"status":"public","title":"Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model","year":"2021"},{"doi":"10.1007/978-3-030-91081-5\\_34","user_id":"15504","editor":[{"first_name":"Colette","last_name":"Johnen","full_name":"Johnen, Colette"},{"full_name":"Michael Schiller, Elad","last_name":"Michael Schiller","first_name":"Elad"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"volume":13046,"page":"484-488","_id":"28917","language":[{"iso":"eng"}],"publisher":"Springer","series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:58:41Z","intvolume":"     13046","status":"public","title":"Coordinating Amoebots via Reconfigurable Circuits","year":"2021","author":[{"last_name":"Feldmann","first_name":"Michael","full_name":"Feldmann, Michael"},{"full_name":"Padalkin, Andreas","first_name":"Andreas","last_name":"Padalkin","id":"88238"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"last_name":"Dolev","first_name":"Shlomi","full_name":"Dolev, Shlomi"}],"type":"conference","department":[{"_id":"79"}],"date_created":"2021-12-15T09:37:38Z","publication":"Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings","citation":{"short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, Springer, 2021, pp. 484–488.","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” In <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">https://doi.org/10.1007/978-3-030-91081-5\\_34</a>.","apa":"Feldmann, M., Padalkin, A., Scheideler, C., &#38; Dolev, S. (2021). Coordinating Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, &#38; S. Schmid (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i> (Vol. 13046, pp. 484–488). Springer. <a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">https://doi.org/10.1007/978-3-030-91081-5\\_34</a>","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” in <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>, 2021, vol. 13046, pp. 484–488, doi: <a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>.","ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:<a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>","bibtex":"@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={13046}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}, publisher={Springer}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, editor={Johnen, Colette and Michael Schiller, Elad and Schmid, Stefan}, year={2021}, pages={484–488}, collection={Lecture Notes in Computer Science} }","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:<a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>."}},{"author":[{"last_name":"Suermann","first_name":"Dennis","full_name":"Suermann, Dennis"}],"title":"Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers","status":"public","year":"2021","date_updated":"2022-01-06T06:58:43Z","_id":"28998","language":[{"iso":"eng"}],"user_id":"15504","supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"citation":{"ieee":"D. Suermann, <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers</i>. 2021.","apa":"Suermann, D. (2021). <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers</i>.","short":"D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.","chicago":"Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>, 2021.","mla":"Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>. 2021.","bibtex":"@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }","ama":"Suermann D. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>.; 2021."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"date_created":"2021-12-16T06:41:25Z","department":[{"_id":"79"}],"type":"bachelorsthesis"},{"user_id":"15504","language":[{"iso":"eng"}],"_id":"27053","date_updated":"2022-01-06T06:57:33Z","author":[{"first_name":"Leon","last_name":"Everling","full_name":"Everling, Leon"}],"year":"2021","status":"public","title":"Selbststabilisierender Bakery Algorithmus für verteilte Systeme","department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2021-11-02T10:13:51Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"citation":{"ama":"Everling L. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>.; 2021.","bibtex":"@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für verteilte Systeme}, author={Everling, Leon}, year={2021} }","mla":"Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>. 2021.","short":"L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.","chicago":"Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>, 2021.","apa":"Everling, L. (2021). <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>.","ieee":"L. Everling, <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>. 2021."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}]},{"_id":"27072","language":[{"iso":"eng"}],"user_id":"15504","author":[{"last_name":"Adsul","first_name":"Vaibhav","full_name":"Adsul, Vaibhav"}],"title":"Peer-to-Peer Matching for Distributed Systems","year":"2021","status":"public","date_updated":"2022-01-06T06:57:33Z","date_created":"2021-11-03T06:12:47Z","department":[{"_id":"79"}],"type":"mastersthesis","supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"citation":{"short":"V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.","chicago":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>, 2021.","ieee":"V. Adsul, <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.","apa":"Adsul, V. (2021). <i>Peer-to-Peer Matching for Distributed Systems</i>.","bibtex":"@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }","ama":"Adsul V. <i>Peer-to-Peer Matching for Distributed Systems</i>.; 2021.","mla":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"language":[{"iso":"eng"}],"_id":"21084","user_id":"15504","title":"Derandomization and Local Graph Problems in the Node-Capacitated Clique","year":"2021","status":"public","author":[{"id":"50024","full_name":"Werthmann, Julian","first_name":"Julian","last_name":"Werthmann"}],"date_updated":"2022-01-06T06:54:44Z","date_created":"2021-01-26T13:58:14Z","type":"mastersthesis","department":[{"_id":"79"}],"citation":{"ieee":"J. Werthmann, <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021.","apa":"Werthmann, J. (2021). <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.","chicago":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>, 2021.","short":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","mla":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021.","bibtex":"@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }","ama":"Werthmann J. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.; 2021."},"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"date_created":"2021-02-09T07:09:22Z","department":[{"_id":"79"}],"type":"bachelorsthesis","citation":{"mla":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021.","bibtex":"@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }","ama":"Mengshi M. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.; 2021.","ieee":"M. Mengshi, <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021.","apa":"Mengshi, M. (2021). <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.","short":"M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.","chicago":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>, 2021."},"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"21197","language":[{"iso":"eng"}],"user_id":"15504","author":[{"last_name":"Mengshi","first_name":"Ma","full_name":"Mengshi, Ma"}],"status":"public","title":"Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter","year":"2021","date_updated":"2022-01-06T06:54:49Z"},{"date_created":"2021-04-15T05:51:43Z","department":[{"_id":"79"}],"type":"mastersthesis","citation":{"ieee":"D. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","mla":"Liedtke, David. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","apa":"Liedtke, D. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.","bibtex":"@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David}, year={2021} }","short":"D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","ama":"Liedtke D. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.; 2021.","chicago":"Liedtke, David. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>, 2021."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"_id":"21627","user_id":"15504","author":[{"full_name":"Liedtke, David","last_name":"Liedtke","first_name":"David"}],"status":"public","title":"Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model","year":"2021","date_updated":"2022-01-06T06:55:08Z"},{"file_date_updated":"2021-04-15T08:21:15Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"apa":"Feldmann, M. (2021). <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1113\">https://doi.org/10.17619/UNIPB/1-1113</a>","ieee":"M. Feldmann, <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. 2021.","short":"M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.","chicago":"Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1113\">https://doi.org/10.17619/UNIPB/1-1113</a>.","mla":"Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>.","ama":"Feldmann M. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>","bibtex":"@book{Feldmann_2021, title={Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>}, author={Feldmann, Michael}, year={2021} }"},"abstract":[{"text":"This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.\r\n\r\nIn the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.\r\nOur protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.\r\nWe furthermore provide a protocol that handles joining and leaving nodes.\r\nAs an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.\r\n\t\r\nThe second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.\r\nWe present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.\r\nEach of those protocols comes with unique properties that makes it interesting for certain distributed applications.\r\nGeneralized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.\r\nThe protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.\r\nThe supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.\r\n","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"file":[{"relation":"main_file","date_updated":"2021-04-15T08:21:15Z","file_name":"Dissertation_Michael_Feldmann.pdf","file_size":2617069,"access_level":"closed","file_id":"21629","success":1,"content_type":"application/pdf","creator":"mfeldma2","date_created":"2021-04-15T08:21:15Z"}],"date_created":"2021-04-15T08:23:52Z","type":"dissertation","department":[{"_id":"79"}],"title":"Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks","year":"2021","status":"public","author":[{"id":"23538","full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann"}],"date_updated":"2022-01-06T06:55:08Z","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"21628","ddc":["006"],"doi":"10.17619/UNIPB/1-1113","user_id":"23538"}]