[{"type":"conference","status":"public","_id":"64094","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"language":[{"iso":"eng"}],"place":"SoCG 2025: 81:1-81:5","year":"2025","citation":{"ama":"Scheideler C, Artmann M, Maurer T, Padalkin A, Warner D. AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). . In: ; 2025.","chicago":"Scheideler, Christian, Matthias Artmann, Tobias  Maurer, Andreas Padalkin, and Daniel Warner. “AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). .” SoCG 2025: 81:1-81:5, 2025.","ieee":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, and D. Warner, “AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ,” 2025.","mla":"Scheideler, Christian, et al. <i>AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). </i>. 2025.","short":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, D. Warner, in: SoCG 2025: 81:1-81:5, 2025.","bibtex":"@inproceedings{Scheideler_Artmann_Maurer_Padalkin_Warner_2025, place={SoCG 2025: 81:1-81:5}, title={AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). }, author={Scheideler, Christian and Artmann, Matthias and Maurer, Tobias  and Padalkin, Andreas and Warner, Daniel}, year={2025} }","apa":"Scheideler, C., Artmann, M., Maurer, T., Padalkin, A., &#38; Warner, D. (2025). <i>AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). </i>."},"date_updated":"2026-02-11T09:11:42Z","date_created":"2026-02-10T09:01:15Z","author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Matthias","last_name":"Artmann","full_name":"Artmann, Matthias","id":"63743"},{"last_name":"Maurer","full_name":"Maurer, Tobias ","first_name":"Tobias "},{"full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin","first_name":"Andreas"},{"last_name":"Warner","id":"3902","full_name":"Warner, Daniel","first_name":"Daniel"}],"title":"AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). "},{"citation":{"apa":"Padalkin, A., Scheideler, C., &#38; Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. <i>Natural Computing</i>. <a href=\"https://doi.org/10.1007/s11047-024-09981-6\">https://doi.org/10.1007/s11047-024-09981-6</a>","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>Natural Computing</i>, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s11047-024-09981-6\">10.1007/s11047-024-09981-6</a>.","short":"A. Padalkin, C. Scheideler, D. Warner, Natural Computing (2024).","bibtex":"@article{Padalkin_Scheideler_Warner_2024, title={The structural power of reconfigurable circuits in the amoebot model}, DOI={<a href=\"https://doi.org/10.1007/s11047-024-09981-6\">10.1007/s11047-024-09981-6</a>}, journal={Natural Computing}, publisher={Springer Science and Business Media LLC}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, year={2024} }","ama":"Padalkin A, Scheideler C, Warner D. The structural power of reconfigurable circuits in the amoebot model. <i>Natural Computing</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s11047-024-09981-6\">10.1007/s11047-024-09981-6</a>","chicago":"Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>Natural Computing</i>, 2024. <a href=\"https://doi.org/10.1007/s11047-024-09981-6\">https://doi.org/10.1007/s11047-024-09981-6</a>.","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The structural power of reconfigurable circuits in the amoebot model,” <i>Natural Computing</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s11047-024-09981-6\">10.1007/s11047-024-09981-6</a>."},"year":"2024","publication_identifier":{"issn":["1567-7818","1572-9796"]},"publication_status":"published","doi":"10.1007/s11047-024-09981-6","title":"The structural power of reconfigurable circuits in the amoebot model","author":[{"full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin","first_name":"Andreas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"last_name":"Warner","full_name":"Warner, Daniel","id":"3902","first_name":"Daniel"}],"date_created":"2024-07-24T14:28:27Z","publisher":"Springer Science and Business Media LLC","date_updated":"2024-07-24T14:28:43Z","status":"public","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>The <jats:italic>amoebot model</jats:italic> (Derakhshandeh et al. in: SPAA ACM, pp 220–222. <jats:ext-link xmlns:xlink=\"http://www.w3.org/1999/xlink\" ext-link-type=\"doi\" xlink:href=\"10.1145/2612669.2612712\">https://doi.org/10.1145/2612669.2612712</jats:ext-link>, 2014) has been proposed as a model for programmable matter consisting of tiny, robotic elements called <jats:italic>amoebots</jats:italic>. We consider the <jats:italic>reconfigurable circuit extension</jats:italic> (Feldmann et al. in J Comput Biol 29(4):317–343. <jats:ext-link xmlns:xlink=\"http://www.w3.org/1999/xlink\" ext-link-type=\"doi\" xlink:href=\"10.1089/cmb.2021.0363\">https://doi.org/10.1089/cmb.2021.0363</jats:ext-link>, 2022) of the geometric amoebot model that allows the amoebot structure to interconnect amoebots by so-called <jats:italic>circuits</jats:italic>. A circuit permits the instantaneous transmission of signals between the connected amoebots. In this paper, we examine the structural power of the reconfigurable circuits. We start with fundamental problems like the <jats:italic>stripe computation problem</jats:italic> where, given any connected amoebot structure <jats:italic>S</jats:italic>, an amoebot <jats:italic>u</jats:italic> in <jats:italic>S</jats:italic>, and some axis <jats:italic>X</jats:italic>, all amoebots belonging to axis <jats:italic>X</jats:italic> through <jats:italic>u</jats:italic> have to be identified. Second, we consider the <jats:italic>global maximum problem</jats:italic>, which identifies an amoebot at the highest possible position with respect to some direction in some given amoebot (sub)structure. A solution to this problem can be used to solve the <jats:italic>skeleton problem</jats:italic>, where a cycle of amoebots has to be found in the given amoebot structure which contains all boundary amoebots. A canonical solution to that problem can be used to come up with a canonical path, which provides a unique characterization of the shape of the given amoebot structure. Constructing canonical paths for different directions allows the amoebots to set up a spanning tree and to check symmetry properties of the given amoebot structure. The problems are important for a number of applications like rapid shape transformation, energy dissemination, and structural monitoring. Interestingly, the reconfigurable circuit extension allows polylogarithmic-time solutions to all of these problems.</jats:p>","lang":"eng"}],"publication":"Natural Computing","type":"journal_article","language":[{"iso":"eng"}],"user_id":"88238","_id":"55379"},{"year":"2024","citation":{"chicago":"Scheideler, Christian, Andreas Padalkin, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model. .” <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 2024, 603–25.","ieee":"C. Scheideler, A. Padalkin, and D. Warner, “The structural power of reconfigurable circuits in the amoebot model. ,” <i>The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)</i>, pp. 603–625, 2024.","ama":"Scheideler C, Padalkin A, Warner D. The structural power of reconfigurable circuits in the amoebot model. . <i>The structural power of reconfigurable circuits in the amoebot model Nat Comput 23(4): 603-625 (2024)</i>. Published online 2024:603-625.","apa":"Scheideler, C., Padalkin, A., &#38; Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. . <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 603–625.","short":"C. Scheideler, A. Padalkin, D. Warner, The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024) (2024) 603–625.","bibtex":"@article{Scheideler_Padalkin_Warner_2024, title={The structural power of reconfigurable circuits in the amoebot model. }, journal={The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)}, author={Scheideler, Christian and Padalkin, Andreas and Warner, Daniel}, year={2024}, pages={603–625} }","mla":"Scheideler, Christian, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model. .” <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 2024, pp. 603–25."},"page":"603 - 625","date_updated":"2026-02-11T09:13:04Z","author":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Andreas","id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel","id":"3902"}],"date_created":"2026-02-10T09:56:23Z","title":"The structural power of reconfigurable circuits in the amoebot model. ","type":"journal_article","publication":"The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)","status":"public","_id":"64100","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"language":[{"iso":"eng"}]},{"title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","date_created":"2022-08-08T17:32:19Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","year":"2022","language":[{"iso":"eng"}],"publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","doi":"10.4230/LIPIcs.DNA.28.8","author":[{"first_name":"Andreas","last_name":"Padalkin","id":"88238","full_name":"Padalkin, Andreas"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Daniel","last_name":"Warner","id":"3902","full_name":"Warner, Daniel"}],"volume":238,"date_updated":"2022-11-17T14:18:24Z","citation":{"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>.","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.","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)} }","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>","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>.","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>.","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>"},"page":"8:1–8:22","intvolume":"       238","place":"Dagstuhl, Germany","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"32602","status":"public","editor":[{"last_name":"Ouldridge","full_name":"Ouldridge, Thomas E.","first_name":"Thomas E."},{"full_name":"Wickham, Shelley F. J.","last_name":"Wickham","first_name":"Shelley F. J."}],"type":"conference"},{"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"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"}],"_id":"32603","status":"public","editor":[{"last_name":"Ouldridge","full_name":"Ouldridge, Thomas E.","first_name":"Thomas E."},{"first_name":"Shelley F. J.","last_name":"Wickham","full_name":"Wickham, Shelley F. J."}],"type":"conference","doi":"10.4230/LIPIcs.DNA.28.9","author":[{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel","id":"3902"}],"volume":238,"date_updated":"2022-11-17T14:17:09Z","citation":{"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.","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)} }","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>","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>.","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>.","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>"},"intvolume":"       238","page":"9:1–9:22","place":"Dagstuhl, Germany","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"language":[{"iso":"eng"}],"publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","title":"Fault-Tolerant Shape Formation in the Amoebot Model","date_created":"2022-08-08T17:42:43Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","year":"2022"},{"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-224-2"]},"citation":{"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>","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>.","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.","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>","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>.","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>."},"page":"23:1–23:3","intvolume":"       221","place":"Dagstuhl, Germany","author":[{"full_name":"Kostitsyna, Irina","last_name":"Kostitsyna","first_name":"Irina"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Daniel","full_name":"Warner, Daniel","id":"3902","last_name":"Warner"}],"volume":221,"date_updated":"2022-10-27T08:45:52Z","doi":"10.4230/LIPIcs.SAND.2022.23","type":"conference","status":"public","editor":[{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"first_name":"Othon","full_name":"Michail, Othon","last_name":"Michail"}],"user_id":"15504","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"79"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"30987","year":"2022","date_created":"2022-05-03T00:13:06Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","title":"Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"20709","user_id":"3902","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"SOFSEM 2011: Theory and Practice of Computer Science","title":"Collisionless Gathering of Robots with an Extent","doi":"10.1007/978-3-642-18381-2_15","date_updated":"2022-01-06T06:54:33Z","date_created":"2020-12-12T11:15:30Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Martina","last_name":"Hüllmann","full_name":"Hüllmann, Martina"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"first_name":"Alexander","last_name":"Klaas","full_name":"Klaas, Alexander"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"full_name":"Kurras, Sven","last_name":"Kurras","first_name":"Sven"},{"first_name":"Marcus","full_name":"Märtens, Marcus","last_name":"Märtens"},{"first_name":"Friedhelm Meyer","full_name":"auf der Heide, Friedhelm Meyer","last_name":"auf der Heide"},{"last_name":"Raupach","full_name":"Raupach, Christoph","first_name":"Christoph"},{"first_name":"Kamil","full_name":"Swierkot, Kamil","last_name":"Swierkot"},{"first_name":"Daniel","last_name":"Warner","id":"3902","full_name":"Warner, Daniel"},{"first_name":"Christoph","full_name":"Weddemann, Christoph","last_name":"Weddemann"},{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"}],"place":"Berlin, Heidelberg","year":"2011","citation":{"short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.","mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>.","ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, Berlin, Heidelberg, 2011.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]}},{"date_updated":"2022-01-06T06:54:33Z","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Martina","full_name":"Hüllmann, Martina","last_name":"Hüllmann"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"first_name":"Alexander","full_name":"Klaas, Alexander","last_name":"Klaas"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Sven","full_name":"Kurras, Sven","last_name":"Kurras"},{"first_name":"Marcus","full_name":"Märtens, Marcus","last_name":"Märtens"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Christoph","full_name":"Raupach, Christoph","last_name":"Raupach"},{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"},{"first_name":"Daniel","full_name":"Warner, Daniel","id":"3902","last_name":"Warner"},{"first_name":"Christoph","full_name":"Weddemann, Christoph","last_name":"Weddemann"},{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"}],"date_created":"2020-12-12T12:22:41Z","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","doi":"10.1007/978-3-642-22012-8_52","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"publication_status":"published","year":"2011","place":"Berlin, Heidelberg","citation":{"ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>"},"_id":"20710","department":[{"_id":"63"}],"user_id":"3902","language":[{"iso":"eng"}],"publication":"Automata, Languages and Programming","type":"book_chapter","status":"public"},{"citation":{"ama":"Monien B, Lorenz U, Warner D. Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In: <i>Taschenbuch Der Algorithmen</i>. Berlin, Heidelberg; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">10.1007/978-3-540-76394-9_28</a>","chicago":"Monien, Burkhard, Ulf Lorenz, and Daniel Warner. “Der Alphabeta-Algorithmus Für Spielbäume: Wie Bringe Ich Meinen Computer Zum Schachspielen?” In <i>Taschenbuch Der Algorithmen</i>. Berlin, Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">https://doi.org/10.1007/978-3-540-76394-9_28</a>.","ieee":"B. Monien, U. Lorenz, and D. Warner, “Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?,” in <i>Taschenbuch der Algorithmen</i>, Berlin, Heidelberg, 2008.","apa":"Monien, B., Lorenz, U., &#38; Warner, D. (2008). Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In <i>Taschenbuch der Algorithmen</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">https://doi.org/10.1007/978-3-540-76394-9_28</a>","mla":"Monien, Burkhard, et al. “Der Alphabeta-Algorithmus Für Spielbäume: Wie Bringe Ich Meinen Computer Zum Schachspielen?” <i>Taschenbuch Der Algorithmen</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">10.1007/978-3-540-76394-9_28</a>.","short":"B. Monien, U. Lorenz, D. Warner, in: Taschenbuch Der Algorithmen, Berlin, Heidelberg, 2008.","bibtex":"@inbook{Monien_Lorenz_Warner_2008, place={Berlin, Heidelberg}, title={Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">10.1007/978-3-540-76394-9_28</a>}, booktitle={Taschenbuch der Algorithmen}, author={Monien, Burkhard and Lorenz, Ulf and Warner, Daniel}, year={2008} }"},"year":"2008","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540763932","9783540763949"]},"publication_status":"published","doi":"10.1007/978-3-540-76394-9_28","title":"Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?","date_created":"2020-12-12T12:25:55Z","author":[{"full_name":"Monien, Burkhard","last_name":"Monien","first_name":"Burkhard"},{"first_name":"Ulf","last_name":"Lorenz","full_name":"Lorenz, Ulf"},{"full_name":"Warner, Daniel","id":"3902","last_name":"Warner","first_name":"Daniel"}],"date_updated":"2022-01-06T06:54:33Z","status":"public","publication":"Taschenbuch der Algorithmen","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"68"}],"user_id":"3902","_id":"20711"}]