[{"year":"2025","citation":{"bibtex":"@article{Scheideler_Padalkin_Kumar_2025, title={Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}, journal={Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}, author={Scheideler, Christian and Padalkin, Andreas and Kumar, Manish}, year={2025} }","short":"C. Scheideler, A. Padalkin, M. Kumar, Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025) (2025).","mla":"Scheideler, Christian, et al. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025).” <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025)</i>, 2025.","apa":"Scheideler, C., Padalkin, A., &#38; Kumar, M. (2025). Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025). <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025)</i>.","chicago":"Scheideler, Christian, Andreas Padalkin, and Manish Kumar. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025).” <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025)</i>, 2025.","ieee":"C. Scheideler, A. Padalkin, and M. Kumar, “Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025),” <i>Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)</i>, 2025.","ama":"Scheideler C, Padalkin A, Kumar M. Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025). <i>Reconfiguration and locomotion with joint movements in the amoebot model Auton Robots 49(3): 22 (2025)</i>. Published online 2025."},"date_updated":"2026-02-11T09:11:49Z","date_created":"2026-02-10T09:41:12Z","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Andreas","last_name":"Padalkin","id":"88238","full_name":"Padalkin, Andreas"},{"first_name":"Manish","last_name":"Kumar","full_name":"Kumar, Manish"}],"title":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","type":"journal_article","publication":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","status":"public","_id":"64098","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"language":[{"iso":"eng"}]},{"title":"AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ","date_updated":"2026-02-11T09:11:42Z","date_created":"2026-02-10T09:01:15Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Artmann","id":"63743","full_name":"Artmann, Matthias","first_name":"Matthias"},{"last_name":"Maurer","full_name":"Maurer, Tobias ","first_name":"Tobias "},{"last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238","first_name":"Andreas"},{"full_name":"Warner, Daniel","id":"3902","last_name":"Warner","first_name":"Daniel"}],"year":"2025","place":"SoCG 2025: 81:1-81:5","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.","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.","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.","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>.","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} }","short":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, D. Warner, in: SoCG 2025: 81:1-81:5, 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."},"language":[{"iso":"eng"}],"_id":"64094","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","status":"public","type":"conference"},{"title":"On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ","author":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"last_name":"Artmann","full_name":"Artmann, Matthias","id":"63743","first_name":"Matthias"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"}],"date_created":"2026-02-10T09:17:54Z","date_updated":"2026-02-11T09:11:19Z","citation":{"apa":"Scheideler, C., Artmann, M., &#38; Padalkin, A. (2025). <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>.","mla":"Scheideler, Christian, et al. <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>. 2025.","bibtex":"@inproceedings{Scheideler_Artmann_Padalkin_2025, place={DISC 2025: 7:1-7:22}, title={On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. }, author={Scheideler, Christian and Artmann, Matthias and Padalkin, Andreas}, year={2025} }","short":"C. Scheideler, M. Artmann, A. Padalkin, in: DISC 2025: 7:1-7:22, 2025.","chicago":"Scheideler, Christian, Matthias Artmann, and Andreas Padalkin. “On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. .” DISC 2025: 7:1-7:22, 2025.","ieee":"C. Scheideler, M. Artmann, and A. Padalkin, “On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ,” 2025.","ama":"Scheideler C, Artmann M, Padalkin A. On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. . In: ; 2025."},"place":"DISC 2025: 7:1-7:22","year":"2025","language":[{"iso":"eng"}],"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"64097","status":"public","type":"conference"},{"type":"journal_article","publication":"Natural Computing","abstract":[{"lang":"eng","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>"}],"status":"public","_id":"55379","user_id":"88238","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1567-7818","1572-9796"]},"year":"2024","citation":{"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>","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>.","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>.","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>","short":"A. Padalkin, C. Scheideler, D. Warner, Natural Computing (2024).","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>.","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} }"},"date_updated":"2024-07-24T14:28:43Z","publisher":"Springer Science and Business Media LLC","author":[{"first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"last_name":"Warner","full_name":"Warner, Daniel","id":"3902","first_name":"Daniel"}],"date_created":"2024-07-24T14:28:27Z","title":"The structural power of reconfigurable circuits in the amoebot model","doi":"10.1007/s11047-024-09981-6"},{"type":"conference","publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece","editor":[{"last_name":"Casteigts","full_name":"Casteigts, Arnaud","first_name":"Arnaud"},{"last_name":"Kuhn","full_name":"Kuhn, Fabian","first_name":"Fabian"}],"status":"public","_id":"55378","user_id":"88238","series_title":"LIPIcs","language":[{"iso":"eng"}],"year":"2024","citation":{"bibtex":"@inproceedings{Gupta_van Kreveld_Michail_Padalkin_2024, series={LIPIcs}, title={Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them}, volume={292}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.26\">10.4230/LIPICS.SAND.2024.26</a>}, booktitle={3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Gupta, Siddharth and van Kreveld, Marc J. and Michail, Othon and Padalkin, Andreas}, editor={Casteigts, Arnaud and Kuhn, Fabian}, year={2024}, pages={26:1–26:5}, collection={LIPIcs} }","short":"S. Gupta, M.J. van Kreveld, O. Michail, A. Padalkin, in: A. Casteigts, F. Kuhn (Eds.), 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 26:1–26:5.","mla":"Gupta, Siddharth, et al. “Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them.” <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>, edited by Arnaud Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 26:1–26:5, doi:<a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.26\">10.4230/LIPICS.SAND.2024.26</a>.","apa":"Gupta, S., van Kreveld, M. J., Michail, O., &#38; Padalkin, A. (2024). Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. In A. Casteigts &#38; F. Kuhn (Eds.), <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i> (Vol. 292, p. 26:1–26:5). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.26\">https://doi.org/10.4230/LIPICS.SAND.2024.26</a>","chicago":"Gupta, Siddharth, Marc J. van Kreveld, Othon Michail, and Andreas Padalkin. “Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them.” In <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>, edited by Arnaud Casteigts and Fabian Kuhn, 292:26:1–26:5. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.26\">https://doi.org/10.4230/LIPICS.SAND.2024.26</a>.","ieee":"S. Gupta, M. J. van Kreveld, O. Michail, and A. Padalkin, “Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them,” in <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>, 2024, vol. 292, p. 26:1–26:5, doi: <a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.26\">10.4230/LIPICS.SAND.2024.26</a>.","ama":"Gupta S, van Kreveld MJ, Michail O, Padalkin A. Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. In: Casteigts A, Kuhn F, eds. <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>. Vol 292. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:26:1–26:5. doi:<a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.26\">10.4230/LIPICS.SAND.2024.26</a>"},"intvolume":"       292","page":"26:1–26:5","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2024-07-24T14:26:57Z","author":[{"first_name":"Siddharth","full_name":"Gupta, Siddharth","last_name":"Gupta"},{"first_name":"Marc J.","last_name":"van Kreveld","full_name":"van Kreveld, Marc J."},{"first_name":"Othon","last_name":"Michail","full_name":"Michail, Othon"},{"first_name":"Andreas","id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin"}],"date_created":"2024-07-24T14:26:49Z","volume":292,"title":"Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them","doi":"10.4230/LIPICS.SAND.2024.26"},{"_id":"55376","user_id":"88238","series_title":"LIPIcs","language":[{"iso":"eng"}],"publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece","type":"conference","editor":[{"full_name":"Casteigts, Arnaud","last_name":"Casteigts","first_name":"Arnaud"},{"full_name":"Kuhn, Fabian","last_name":"Kuhn","first_name":"Fabian"}],"status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2024-07-24T14:25:46Z","volume":292,"date_created":"2024-07-24T14:25:07Z","author":[{"last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238","first_name":"Andreas"},{"first_name":"Manish","full_name":"Kumar, Manish","last_name":"Kumar"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Reconfiguration and Locomotion with Joint Movements in the Amoebot Model","doi":"10.4230/LIPICS.SAND.2024.18","year":"2024","page":"18:1–18:20","intvolume":"       292","citation":{"apa":"Padalkin, A., Kumar, M., &#38; Scheideler, C. (2024). Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. In A. Casteigts &#38; F. Kuhn (Eds.), <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i> (Vol. 292, p. 18:1–18:20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.18\">https://doi.org/10.4230/LIPICS.SAND.2024.18</a>","mla":"Padalkin, Andreas, et al. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model.” <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>, edited by Arnaud Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 18:1–18:20, doi:<a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.18\">10.4230/LIPICS.SAND.2024.18</a>.","short":"A. Padalkin, M. Kumar, C. Scheideler, in: A. Casteigts, F. Kuhn (Eds.), 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 18:1–18:20.","bibtex":"@inproceedings{Padalkin_Kumar_Scheideler_2024, series={LIPIcs}, title={Reconfiguration and Locomotion with Joint Movements in the Amoebot Model}, volume={292}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.18\">10.4230/LIPICS.SAND.2024.18</a>}, booktitle={3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Kumar, Manish and Scheideler, Christian}, editor={Casteigts, Arnaud and Kuhn, Fabian}, year={2024}, pages={18:1–18:20}, collection={LIPIcs} }","ama":"Padalkin A, Kumar M, Scheideler C. Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. In: Casteigts A, Kuhn F, eds. <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>. Vol 292. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:18:1–18:20. doi:<a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.18\">10.4230/LIPICS.SAND.2024.18</a>","ieee":"A. Padalkin, M. Kumar, and C. Scheideler, “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model,” in <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>, 2024, vol. 292, p. 18:1–18:20, doi: <a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.18\">10.4230/LIPICS.SAND.2024.18</a>.","chicago":"Padalkin, Andreas, Manish Kumar, and Christian Scheideler. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model.” In <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece</i>, edited by Arnaud Casteigts and Fabian Kuhn, 292:18:1–18:20. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPICS.SAND.2024.18\">https://doi.org/10.4230/LIPICS.SAND.2024.18</a>."}},{"year":"2024","citation":{"ama":"Padalkin A, Scheideler C. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. In: <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>","chicago":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” In <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3662158.3662776\">https://doi.org/10.1145/3662158.3662776</a>.","ieee":"A. Padalkin and C. Scheideler, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter,” 2024, doi: <a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>.","short":"A. Padalkin, C. Scheideler, in: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024.","bibtex":"@inproceedings{Padalkin_Scheideler_2024, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>}, booktitle={Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing}, publisher={ACM}, author={Padalkin, Andreas and Scheideler, Christian}, year={2024} }","mla":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>.","apa":"Padalkin, A., &#38; Scheideler, C. (2024). Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>. <a href=\"https://doi.org/10.1145/3662158.3662776\">https://doi.org/10.1145/3662158.3662776</a>"},"publication_status":"published","title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter","doi":"10.1145/3662158.3662776","date_updated":"2024-07-24T14:26:23Z","publisher":"ACM","date_created":"2024-07-24T14:26:10Z","author":[{"first_name":"Andreas","last_name":"Padalkin","id":"88238","full_name":"Padalkin, Andreas"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"status":"public","type":"conference","publication":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","language":[{"iso":"eng"}],"_id":"55377","user_id":"88238"},{"status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"64103","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"year":"2024","place":"PODC 2024: 65-75","citation":{"chicago":"Scheideler, Christian, and Andreas Padalkin. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 65–75. PODC 2024: 65-75, 2024.","ieee":"C. Scheideler and A. Padalkin, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 2024, pp. 65–75.","ama":"Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . In: ; 2024:65-75.","bibtex":"@inproceedings{Scheideler_Padalkin_2024, place={PODC 2024: 65-75}, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. }, author={Scheideler, Christian and Padalkin, Andreas}, year={2024}, pages={65–75} }","short":"C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.","mla":"Scheideler, Christian, and Andreas Padalkin. <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 2024, pp. 65–75.","apa":"Scheideler, C., &#38; Padalkin, A. (2024). <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 65–75."},"page":"65 - 75","title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ","date_updated":"2026-02-11T09:11:58Z","author":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin"}],"date_created":"2026-02-10T10:06:36Z"},{"publication":"The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)","type":"journal_article","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"64100","language":[{"iso":"eng"}],"page":"603 - 625","citation":{"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.","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.","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} }","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.","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.","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."},"year":"2024","date_created":"2026-02-10T09:56:23Z","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_updated":"2026-02-11T09:13:04Z","title":"The structural power of reconfigurable circuits in the amoebot model. "},{"title":"Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ","date_updated":"2026-02-11T09:12:18Z","date_created":"2026-02-10T10:15:08Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Andreas","id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin"},{"first_name":"Manish ","full_name":"Kumar , Manish ","last_name":"Kumar "}],"year":"2024","place":"SAND 2024: 18:1-18:20","citation":{"ama":"Scheideler C, Padalkin A, Kumar  M. Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. . In: ; 2024.","ieee":"C. Scheideler, A. Padalkin, and M. Kumar , “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ,” 2024.","chicago":"Scheideler, Christian, Andreas Padalkin, and Manish  Kumar . “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. .” SAND 2024: 18:1-18:20, 2024.","apa":"Scheideler, C., Padalkin, A., &#38; Kumar , M. (2024). <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>.","bibtex":"@inproceedings{Scheideler_Padalkin_Kumar _2024, place={SAND 2024: 18:1-18:20}, title={Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. }, author={Scheideler, Christian and Padalkin, Andreas and Kumar , Manish }, year={2024} }","mla":"Scheideler, Christian, et al. <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>. 2024.","short":"C. Scheideler, A. Padalkin, M. Kumar , in: SAND 2024: 18:1-18:20, 2024."},"language":[{"iso":"eng"}],"_id":"64105","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","status":"public","type":"conference"},{"type":"journal_article","publication":"J. Comput. Biol.","status":"public","_id":"31060","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"issue":"4","year":"2022","citation":{"bibtex":"@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={29}, DOI={<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>}, number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343} }","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” <i>J. Comput. Biol.</i>, vol. 29, no. 4, 2022, pp. 317–343, doi:<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>.","apa":"Feldmann, M., Padalkin, A., Scheideler, C., &#38; Dolev, S. (2022). Coordinating Amoebots via Reconfigurable Circuits. <i>J. Comput. Biol.</i>, <i>29</i>(4), 317–343. <a href=\"https://doi.org/10.1089/cmb.2021.0363\">https://doi.org/10.1089/cmb.2021.0363</a>","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” <i>J. Comput. Biol.</i>, vol. 29, no. 4, pp. 317–343, 2022, doi: <a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>.","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” <i>J. Comput. Biol.</i> 29, no. 4 (2022): 317–343. <a href=\"https://doi.org/10.1089/cmb.2021.0363\">https://doi.org/10.1089/cmb.2021.0363</a>.","ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. <i>J Comput Biol</i>. 2022;29(4):317–343. doi:<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>"},"page":"317–343","intvolume":"        29","date_updated":"2022-05-04T12:31:27Z","author":[{"last_name":"Feldmann","full_name":"Feldmann, Michael","first_name":"Michael"},{"first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Shlomi","full_name":"Dolev, Shlomi","last_name":"Dolev"}],"date_created":"2022-05-04T12:29:22Z","volume":29,"title":"Coordinating Amoebots via Reconfigurable Circuits","doi":"10.1089/cmb.2021.0363"},{"doi":"10.4230/LIPIcs.DNA.28.8","author":[{"last_name":"Padalkin","id":"88238","full_name":"Padalkin, Andreas","first_name":"Andreas"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Warner","id":"3902","full_name":"Warner, Daniel","first_name":"Daniel"}],"volume":238,"date_updated":"2022-11-17T14:18:24Z","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)} }","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.","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>.","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>","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>","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>."},"intvolume":"       238","page":"8:1–8:22","place":"Dagstuhl, Germany","publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"user_id":"477","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"79"}],"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"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"},{"_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."},{"first_name":"Shelley F. J.","full_name":"Wickham, Shelley F. J.","last_name":"Wickham"}],"type":"conference","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)"},{"page":"484-488","intvolume":"     13046","citation":{"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} }","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.","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>.","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>","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>","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>.","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>."},"year":"2021","volume":13046,"date_created":"2021-12-15T09:37:38Z","author":[{"first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"full_name":"Dolev, Shlomi","last_name":"Dolev","first_name":"Shlomi"}],"publisher":"Springer","date_updated":"2022-01-06T06:58:41Z","doi":"10.1007/978-3-030-91081-5\\_34","title":"Coordinating Amoebots via Reconfigurable Circuits","publication":"Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings","type":"conference","status":"public","editor":[{"first_name":"Colette","full_name":"Johnen, Colette","last_name":"Johnen"},{"last_name":"Michael Schiller","full_name":"Michael Schiller, Elad","first_name":"Elad"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"department":[{"_id":"79"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","_id":"28917","language":[{"iso":"eng"}]},{"place":"Rheinische Friedrich-Wilhelms-Universität Bonn","year":"2019","citation":{"ama":"Padalkin A. <i>Fire Containment by Back Burning on Grids</i>.; 2019.","chicago":"Padalkin, Andreas. <i>Fire Containment by Back Burning on Grids</i>. Rheinische Friedrich-Wilhelms-Universität Bonn, 2019.","ieee":"A. Padalkin, <i>Fire Containment by Back Burning on Grids</i>. Rheinische Friedrich-Wilhelms-Universität Bonn, 2019.","bibtex":"@book{Padalkin_2019, place={Rheinische Friedrich-Wilhelms-Universität Bonn}, title={Fire Containment by Back Burning on Grids}, author={Padalkin, Andreas}, year={2019} }","mla":"Padalkin, Andreas. <i>Fire Containment by Back Burning on Grids</i>. 2019.","short":"A. Padalkin, Fire Containment by Back Burning on Grids, Rheinische Friedrich-Wilhelms-Universität Bonn, 2019.","apa":"Padalkin, A. (2019). <i>Fire Containment by Back Burning on Grids</i>."},"date_updated":"2022-01-06T06:56:53Z","date_created":"2021-09-29T12:42:25Z","supervisor":[{"last_name":"Langetepe","full_name":"Langetepe, Elmar","first_name":"Elmar"}],"author":[{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"}],"title":"Fire Containment by Back Burning on Grids","type":"mastersthesis","status":"public","_id":"25130","user_id":"88238","language":[{"iso":"eng"}],"extern":"1"},{"_id":"25129","user_id":"88238","language":[{"iso":"eng"}],"extern":"1","type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:56:53Z","author":[{"last_name":"Padalkin","id":"88238","full_name":"Padalkin, Andreas","first_name":"Andreas"}],"supervisor":[{"full_name":"Anlauf, Joachim","last_name":"Anlauf","first_name":"Joachim"}],"date_created":"2021-09-29T12:40:16Z","title":"Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen Netzes auf einem FPGA","year":"2016","place":"Rheinische Friedrich-Wilhelms-Universität Bonn","citation":{"bibtex":"@book{Padalkin_2016, place={Rheinische Friedrich-Wilhelms-Universität Bonn}, title={Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen Netzes auf einem FPGA}, author={Padalkin, Andreas}, year={2016} }","mla":"Padalkin, Andreas. <i>Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden Neuronalen Netzes Auf Einem FPGA</i>. 2016.","short":"A. Padalkin, Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden Neuronalen Netzes Auf Einem FPGA, Rheinische Friedrich-Wilhelms-Universität Bonn, 2016.","apa":"Padalkin, A. (2016). <i>Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen Netzes auf einem FPGA</i>.","chicago":"Padalkin, Andreas. <i>Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden Neuronalen Netzes Auf Einem FPGA</i>. Rheinische Friedrich-Wilhelms-Universität Bonn, 2016.","ieee":"A. Padalkin, <i>Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen Netzes auf einem FPGA</i>. Rheinische Friedrich-Wilhelms-Universität Bonn, 2016.","ama":"Padalkin A. <i>Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden Neuronalen Netzes Auf Einem FPGA</i>.; 2016."}}]