--- _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' ... --- _id: '28917' 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. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5\_34' apa: Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2021). Coordinating Amoebots via Reconfigurable Circuits. 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 (Vol. 13046, pp. 484–488). Springer. https://doi.org/10.1007/978-3-030-91081-5\_34 bibtex: '@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={13046}, DOI={10.1007/978-3-030-91081-5\_34}, 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} }' chicago: Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” In Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5\_34. ieee: 'M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” in Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, 2021, vol. 13046, pp. 484–488, doi: 10.1007/978-3-030-91081-5\_34.' mla: Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5\_34. 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.' date_created: 2021-12-15T09:37:38Z date_updated: 2022-01-06T06:58:41Z department: - _id: '79' doi: 10.1007/978-3-030-91081-5\_34 editor: - first_name: Colette full_name: Johnen, Colette last_name: Johnen - first_name: Elad full_name: Michael Schiller, Elad last_name: Michael Schiller - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid intvolume: ' 13046' language: - iso: eng page: 484-488 publication: Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Coordinating Amoebots via Reconfigurable Circuits type: conference user_id: '15504' volume: 13046 year: '2021' ... --- _id: '28998' author: - first_name: Dennis full_name: Suermann, Dennis last_name: Suermann citation: ama: Suermann D. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers.; 2021. apa: Suermann, D. (2021). Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers. bibtex: '@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }' chicago: Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021. ieee: D. Suermann, Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers. 2021. mla: Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers. 2021. short: D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021. date_created: 2021-12-16T06:41:25Z date_updated: 2022-01-06T06:58:43Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers type: bachelorsthesis user_id: '15504' year: '2021' ... --- _id: '27053' author: - first_name: Leon full_name: Everling, Leon last_name: Everling citation: ama: Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021. apa: Everling, L. (2021). Selbststabilisierender Bakery Algorithmus für verteilte Systeme. bibtex: '@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für verteilte Systeme}, author={Everling, Leon}, year={2021} }' chicago: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021. ieee: L. Everling, Selbststabilisierender Bakery Algorithmus für verteilte Systeme. 2021. mla: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme. 2021. short: L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021. date_created: 2021-11-02T10:13:51Z date_updated: 2022-01-06T06:57:33Z department: - _id: '79' 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: Selbststabilisierender Bakery Algorithmus für verteilte Systeme type: bachelorsthesis user_id: '15504' year: '2021' ... --- _id: '27072' author: - first_name: Vaibhav full_name: Adsul, Vaibhav last_name: Adsul citation: ama: Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021. apa: Adsul, V. (2021). Peer-to-Peer Matching for Distributed Systems. bibtex: '@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }' chicago: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021. ieee: V. Adsul, Peer-to-Peer Matching for Distributed Systems. 2021. mla: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021. short: V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021. date_created: 2021-11-03T06:12:47Z date_updated: 2022-01-06T06:57:33Z department: - _id: '79' 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: Peer-to-Peer Matching for Distributed Systems type: mastersthesis user_id: '15504' year: '2021' ... --- _id: '21084' author: - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021. apa: Werthmann, J. (2021). Derandomization and Local Graph Problems in the Node-Capacitated Clique. bibtex: '@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }' chicago: Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021. ieee: J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021. mla: Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021. short: J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021. date_created: 2021-01-26T13:58:14Z date_updated: 2022-01-06T06:54:44Z department: - _id: '79' 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: Derandomization and Local Graph Problems in the Node-Capacitated Clique type: mastersthesis user_id: '15504' year: '2021' ... --- _id: '21197' author: - first_name: Ma full_name: Mengshi, Ma last_name: Mengshi citation: ama: Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021. apa: Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. bibtex: '@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }' chicago: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021. ieee: M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021. mla: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021. short: M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021. date_created: 2021-02-09T07:09:22Z date_updated: 2022-01-06T06:54:49Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C - _id: '5' name: SFB 901 - Subproject A1 - _id: '13' name: SFB 901 - Subproject C1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter type: bachelorsthesis user_id: '15504' year: '2021' ... --- _id: '21627' author: - first_name: David full_name: Liedtke, David last_name: Liedtke citation: ama: Liedtke D. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021. apa: Liedtke, D. (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}, year={2021} }' chicago: Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021. ieee: D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021. mla: Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021. short: D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021. date_created: 2021-04-15T05:51:43Z date_updated: 2022-01-06T06:55:08Z department: - _id: '79' 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: '15504' year: '2021' ... --- _id: '21628' abstract: - lang: eng 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" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann citation: ama: Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113 apa: Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. https://doi.org/10.17619/UNIPB/1-1113 bibtex: '@book{Feldmann_2021, title={Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}, DOI={10.17619/UNIPB/1-1113}, author={Feldmann, Michael}, year={2021} }' chicago: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. https://doi.org/10.17619/UNIPB/1-1113. ieee: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021. mla: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113. short: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. date_created: 2021-04-15T08:23:52Z date_updated: 2022-01-06T06:55:08Z ddc: - '006' department: - _id: '79' doi: 10.17619/UNIPB/1-1113 file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2021-04-15T08:21:15Z date_updated: 2021-04-15T08:21:15Z file_id: '21629' file_name: Dissertation_Michael_Feldmann.pdf file_size: 2617069 relation: main_file success: 1 file_date_updated: 2021-04-15T08:21:15Z has_accepted_license: '1' 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: Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks type: dissertation user_id: '23538' year: '2021' ... --- _id: '30217' author: - first_name: Sam full_name: Coy, Sam last_name: Coy - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Michael full_name: Feldmann, Michael last_name: Feldmann - first_name: Kristian full_name: Hinnenthal, Kristian last_name: Hinnenthal - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Philipp full_name: Schneider, Philipp last_name: Schneider - first_name: Martijn full_name: Struijs, Martijn last_name: Struijs citation: ama: 'Coy S, Czumaj A, Feldmann M, et al. Near-Shortest Path Routing in Hybrid Communication Networks. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. Vol 217. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:11:1–11:23. doi:10.4230/LIPIcs.OPODIS.2021.11' apa: Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P., & Struijs, M. (2021). Near-Shortest Path Routing in Hybrid Communication Networks. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France (Vol. 217, p. 11:1–11:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11 bibtex: '@inproceedings{Coy_Czumaj_Feldmann_Hinnenthal_Kuhn_Scheideler_Schneider_Struijs_2021, series={LIPIcs}, title={Near-Shortest Path Routing in Hybrid Communication Networks}, volume={217}, DOI={10.4230/LIPIcs.OPODIS.2021.11}, booktitle={25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Coy, Sam and Czumaj, Artur and Feldmann, Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp and Struijs, Martijn}, editor={Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, year={2021}, pages={11:1–11:23}, collection={LIPIcs} }' chicago: Coy, Sam, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. “Near-Shortest Path Routing in Hybrid Communication Networks.” In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11. ieee: 'S. Coy et al., “Near-Shortest Path Routing in Hybrid Communication Networks,” in 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, 2021, vol. 217, p. 11:1–11:23, doi: 10.4230/LIPIcs.OPODIS.2021.11.' mla: Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.” 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11. short: 'S. Coy, A. Czumaj, M. Feldmann, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, M. Struijs, in: Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23.' date_created: 2022-03-09T10:43:28Z date_updated: 2022-03-09T10:46:34Z department: - _id: '79' doi: 10.4230/LIPIcs.OPODIS.2021.11 editor: - first_name: Quentin full_name: Bramas, Quentin last_name: Bramas - first_name: Vincent full_name: Gramoli, Vincent last_name: Gramoli - first_name: Alessia full_name: Milani, Alessia last_name: Milani intvolume: ' 217' language: - iso: eng page: 11:1–11:23 publication: 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: Near-Shortest Path Routing in Hybrid Communication Networks type: conference user_id: '15504' volume: 217 year: '2021' ... --- _id: '20221' author: - first_name: Paresh Kishor full_name: Yeole, Paresh Kishor last_name: Yeole citation: ama: Yeole PK. Plurality Consensus in Hybrid Networks.; 2020. apa: Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks. bibtex: '@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }' chicago: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020. ieee: P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020. mla: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020. short: P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020. date_created: 2020-10-29T07:45:57Z date_updated: 2022-01-06T06:54:23Z department: - _id: '79' 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: Plurality Consensus in Hybrid Networks type: mastersthesis user_id: '15504' year: '2020' ...