[{"year":"2026","title":"Polylogarithmic time algorithms for shortest path forests in programmable matter","publication_identifier":{"issn":["0178-2770","1432-0452"]},"author":[{"last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"date_updated":"2026-05-29T12:13:09Z","publication_status":"published","intvolume":"        39","article_number":"15","language":[{"iso":"eng"}],"doi":"10.1007/s00446-026-00505-2","publication":"Distributed Computing","issue":"2","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n                  <jats:p>\r\n                    In this paper, we study the computation of shortest paths within the\r\n                    <jats:italic>geometric amoebot model</jats:italic>\r\n                    , a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts. We consider the\r\n                    <jats:italic>reconfigurable circuit extension</jats:italic>\r\n                    of the model where the amoebot structure is able to interconnect amoebots by so-called circuits. These circuits permit the instantaneous transmission of simple signals between connected amoebots. We propose distributed algorithms for the\r\n                    <jats:italic>shortest path forest problem</jats:italic>\r\n                    where, given a set of\r\n                    <jats:italic>k</jats:italic>\r\n                    sources and a set of\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\ell $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mi>ℓ</mml:mi>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    destinations, the amoebot structure has to compute a forest that connects each destination to its closest source on a shortest path. Our main results are two algorithms for hole-free structures. The first algorithm constructs a shortest path tree for a single source within\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(\\log \\ell )$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mo>log</mml:mo>\r\n                            <mml:mi>ℓ</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds, and the second algorithm a shortest path forest for an arbitrary number of sources within\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(\\log n \\log ^2 k)$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mo>log</mml:mo>\r\n                            <mml:mi>n</mml:mi>\r\n                            <mml:msup>\r\n                              <mml:mo>log</mml:mo>\r\n                              <mml:mn>2</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mi>k</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds. The former algorithm also provides an\r\n                    <jats:italic>O</jats:italic>\r\n                    (1) rounds solution for the\r\n                    <jats:italic>single pair shortest path problem</jats:italic>\r\n                    (SPSP) and an\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(\\log n)$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mo>log</mml:mo>\r\n                            <mml:mi>n</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds solution for the\r\n                    <jats:italic>single source shortest path problem</jats:italic>\r\n                    (SSSP) since these problems are special cases of the considered problem. Then, we adapt the latter algorithm to an offset version of the problem. This allows us to solve the problem for amoebot structures with holes within\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(h \\log ^3 n)$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mi>h</mml:mi>\r\n                            <mml:msup>\r\n                              <mml:mo>log</mml:mo>\r\n                              <mml:mn>3</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mi>n</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds w.h.p. where\r\n                    <jats:italic>h</jats:italic>\r\n                    denotes the number of holes.\r\n                  </jats:p>"}],"date_created":"2026-05-29T12:11:32Z","type":"journal_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"status":"public","_id":"65733","publisher":"Springer Science and Business Media LLC","user_id":"15578","volume":39,"citation":{"apa":"Padalkin, A., &#38; Scheideler, C. (2026). Polylogarithmic time algorithms for shortest path forests in programmable matter. <i>Distributed Computing</i>, <i>39</i>(2), Article 15. <a href=\"https://doi.org/10.1007/s00446-026-00505-2\">https://doi.org/10.1007/s00446-026-00505-2</a>","ieee":"A. Padalkin and C. Scheideler, “Polylogarithmic time algorithms for shortest path forests in programmable matter,” <i>Distributed Computing</i>, vol. 39, no. 2, Art. no. 15, 2026, doi: <a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>.","chicago":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” <i>Distributed Computing</i> 39, no. 2 (2026). <a href=\"https://doi.org/10.1007/s00446-026-00505-2\">https://doi.org/10.1007/s00446-026-00505-2</a>.","short":"A. Padalkin, C. Scheideler, Distributed Computing 39 (2026).","mla":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” <i>Distributed Computing</i>, vol. 39, no. 2, 15, Springer Science and Business Media LLC, 2026, doi:<a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>.","ama":"Padalkin A, Scheideler C. Polylogarithmic time algorithms for shortest path forests in programmable matter. <i>Distributed Computing</i>. 2026;39(2). doi:<a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>","bibtex":"@article{Padalkin_Scheideler_2026, title={Polylogarithmic time algorithms for shortest path forests in programmable matter}, volume={39}, DOI={<a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>}, number={215}, journal={Distributed Computing}, publisher={Springer Science and Business Media LLC}, author={Padalkin, Andreas and Scheideler, Christian}, year={2026} }"}},{"citation":{"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.","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>.","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.","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).","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.","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."},"publication":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","date_created":"2026-02-10T09:41:12Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"journal_article","author":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas","id":"88238"},{"full_name":"Kumar, Manish","last_name":"Kumar","first_name":"Manish"}],"year":"2025","status":"public","title":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","date_updated":"2026-02-11T09:11:49Z","language":[{"iso":"eng"}],"_id":"64098","user_id":"15578"},{"user_id":"15578","language":[{"iso":"eng"}],"_id":"64094","date_updated":"2026-02-11T09:11:42Z","year":"2025","status":"public","title":"AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"id":"63743","last_name":"Artmann","first_name":"Matthias","full_name":"Artmann, Matthias"},{"full_name":"Maurer, Tobias ","last_name":"Maurer","first_name":"Tobias "},{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel","id":"3902"}],"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"place":"SoCG 2025: 81:1-81:5","date_created":"2026-02-10T09:01:15Z","citation":{"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>.","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.","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.","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.","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} }"}},{"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2026-02-10T09:17:54Z","place":"DISC 2025: 7:1-7:22","citation":{"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.","short":"C. Scheideler, M. Artmann, A. Padalkin, in: DISC 2025: 7:1-7:22, 2025.","apa":"Scheideler, C., Artmann, M., &#38; Padalkin, A. (2025). <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>.","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.","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} }","mla":"Scheideler, Christian, et al. <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>. 2025."},"user_id":"15578","language":[{"iso":"eng"}],"_id":"64097","date_updated":"2026-02-11T09:11:19Z","year":"2025","title":"On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ","status":"public","author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"id":"63743","full_name":"Artmann, Matthias","first_name":"Matthias","last_name":"Artmann"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"}]},{"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","citation":{"short":"A. Padalkin, C. Scheideler, D. Warner, Natural Computing (2024).","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>.","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>","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>","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>."},"type":"journal_article","date_created":"2024-07-24T14:28:27Z","date_updated":"2024-07-24T14:28:43Z","publication_status":"published","year":"2024","status":"public","title":"The structural power of reconfigurable circuits in the amoebot model","author":[{"id":"88238","first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel","id":"3902"}],"publication_identifier":{"issn":["1567-7818","1572-9796"]},"doi":"10.1007/s11047-024-09981-6","user_id":"88238","_id":"55379","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}]},{"date_created":"2024-07-24T14:26:49Z","type":"conference","publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece","citation":{"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>.","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>","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.","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>.","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>.","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} }","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>"},"page":"26:1–26:5","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"55378","series_title":"LIPIcs","language":[{"iso":"eng"}],"user_id":"88238","doi":"10.4230/LIPICS.SAND.2024.26","volume":292,"editor":[{"full_name":"Casteigts, Arnaud","last_name":"Casteigts","first_name":"Arnaud"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"}],"title":"Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them","year":"2024","status":"public","author":[{"full_name":"Gupta, Siddharth","last_name":"Gupta","first_name":"Siddharth"},{"full_name":"van Kreveld, Marc J.","last_name":"van Kreveld","first_name":"Marc J."},{"full_name":"Michail, Othon","last_name":"Michail","first_name":"Othon"},{"last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238"}],"date_updated":"2024-07-24T14:26:57Z","intvolume":"       292"},{"date_created":"2024-07-24T14:25:07Z","type":"conference","publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece","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>","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>.","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.","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>.","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>.","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>","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} }"},"page":"18:1–18:20","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"55376","language":[{"iso":"eng"}],"series_title":"LIPIcs","doi":"10.4230/LIPICS.SAND.2024.18","user_id":"88238","editor":[{"full_name":"Casteigts, Arnaud","last_name":"Casteigts","first_name":"Arnaud"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"}],"volume":292,"status":"public","title":"Reconfiguration and Locomotion with Joint Movements in the Amoebot Model","year":"2024","author":[{"id":"88238","first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas"},{"full_name":"Kumar, Manish","last_name":"Kumar","first_name":"Manish"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"date_updated":"2024-07-24T14:25:46Z","intvolume":"       292"},{"_id":"55377","publisher":"ACM","language":[{"iso":"eng"}],"user_id":"88238","doi":"10.1145/3662158.3662776","title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter","year":"2024","status":"public","author":[{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"publication_status":"published","date_updated":"2024-07-24T14:26:23Z","date_created":"2024-07-24T14:26:10Z","type":"conference","publication":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","citation":{"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>.","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} }","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>","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>.","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>","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>.","short":"A. Padalkin, C. Scheideler, in: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024."}},{"user_id":"15578","_id":"64103","language":[{"iso":"eng"}],"page":"65 - 75","date_updated":"2026-02-11T09:11:58Z","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"}],"title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ","status":"public","year":"2024","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"conference","date_created":"2026-02-10T10:06:36Z","place":"PODC 2024: 65-75","citation":{"apa":"Scheideler, C., &#38; Padalkin, A. (2024). <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 65–75.","mla":"Scheideler, Christian, and Andreas Padalkin. <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 2024, pp. 65–75.","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.","short":"C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.","chicago":"Scheideler, Christian, and Andreas Padalkin. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 65–75. PODC 2024: 65-75, 2024.","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} }"}},{"status":"public","title":"The structural power of reconfigurable circuits in the amoebot model. ","year":"2024","author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"id":"88238","last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel","id":"3902"}],"date_updated":"2026-02-11T09:13:04Z","page":"603 - 625","language":[{"iso":"eng"}],"_id":"64100","user_id":"15578","publication":"The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (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.","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.","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.","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.","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.","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."},"date_created":"2026-02-10T09:56:23Z","type":"journal_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}]},{"_id":"64105","language":[{"iso":"eng"}],"user_id":"15578","status":"public","title":"Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ","year":"2024","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas","id":"88238"},{"first_name":"Manish ","last_name":"Kumar ","full_name":"Kumar , Manish "}],"date_updated":"2026-02-11T09:12:18Z","place":"SAND 2024: 18:1-18:20","date_created":"2026-02-10T10:15:08Z","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"apa":"Scheideler, C., Padalkin, A., &#38; Kumar , M. (2024). <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>.","ieee":"C. Scheideler, A. Padalkin, and M. Kumar , “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ,” 2024.","short":"C. Scheideler, A. Padalkin, M. Kumar , in: SAND 2024: 18:1-18:20, 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.","mla":"Scheideler, Christian, et al. <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>. 2024.","ama":"Scheideler C, Padalkin A, Kumar  M. Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. . In: ; 2024.","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} }"}},{"author":[{"full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann"},{"id":"88238","first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Dolev, Shlomi","first_name":"Shlomi","last_name":"Dolev"}],"title":"Coordinating Amoebots via Reconfigurable Circuits","year":"2022","status":"public","intvolume":"        29","date_updated":"2022-05-04T12:31:27Z","_id":"31060","language":[{"iso":"eng"}],"page":"317–343","volume":29,"user_id":"15504","doi":"10.1089/cmb.2021.0363","citation":{"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>.","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>","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.","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>.","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>.","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} }","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>"},"issue":"4","publication":"J. Comput. Biol.","date_created":"2022-05-04T12:29:22Z","department":[{"_id":"79"}],"type":"journal_article"},{"date_updated":"2022-11-17T14:18:24Z","intvolume":"       238","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","year":"2022","publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"author":[{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"id":"3902","full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"}],"doi":"10.4230/LIPIcs.DNA.28.8","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","type":"conference","department":[{"_id":"79"}],"date_created":"2022-08-08T17:32:19Z","status":"public","user_id":"477","editor":[{"first_name":"Thomas E.","last_name":"Ouldridge","full_name":"Ouldridge, Thomas E."},{"last_name":"Wickham","first_name":"Shelley F. J.","full_name":"Wickham, Shelley F. J."}],"volume":238,"page":"8:1–8:22","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"32602","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"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"}],"citation":{"bibtex":"@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","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.","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>.","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 8:1–8:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","apa":"Padalkin, A., Scheideler, C., &#38; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>"},"place":"Dagstuhl, Germany"},{"citation":{"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>.","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>","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>.","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>.","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} }","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>"},"publication":"Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings","date_created":"2021-12-15T09:37:38Z","department":[{"_id":"79"}],"type":"conference","author":[{"first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael"},{"last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"full_name":"Dolev, Shlomi","last_name":"Dolev","first_name":"Shlomi"}],"year":"2021","title":"Coordinating Amoebots via Reconfigurable Circuits","status":"public","intvolume":"     13046","date_updated":"2022-01-06T06:58:41Z","language":[{"iso":"eng"}],"_id":"28917","series_title":"Lecture Notes in Computer Science","publisher":"Springer","page":"484-488","editor":[{"first_name":"Colette","last_name":"Johnen","full_name":"Johnen, Colette"},{"last_name":"Michael Schiller","first_name":"Elad","full_name":"Michael Schiller, Elad"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"volume":13046,"doi":"10.1007/978-3-030-91081-5\\_34","user_id":"15504"},{"citation":{"bibtex":"@book{Padalkin_2019, place={Rheinische Friedrich-Wilhelms-Universität Bonn}, title={Fire Containment by Back Burning on Grids}, author={Padalkin, Andreas}, year={2019} }","ama":"Padalkin A. <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.","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.","mla":"Padalkin, Andreas. <i>Fire Containment by Back Burning on Grids</i>. 2019.","apa":"Padalkin, A. (2019). <i>Fire Containment by Back Burning on Grids</i>."},"supervisor":[{"full_name":"Langetepe, Elmar","last_name":"Langetepe","first_name":"Elmar"}],"extern":"1","date_created":"2021-09-29T12:42:25Z","place":"Rheinische Friedrich-Wilhelms-Universität Bonn","type":"mastersthesis","author":[{"id":"88238","last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas"}],"status":"public","title":"Fire Containment by Back Burning on Grids","year":"2019","date_updated":"2022-01-06T06:56:53Z","_id":"25130","language":[{"iso":"eng"}],"user_id":"88238"},{"date_updated":"2022-01-06T06:56:53Z","title":"Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen Netzes auf einem FPGA","year":"2016","status":"public","author":[{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"}],"user_id":"88238","language":[{"iso":"eng"}],"_id":"25129","extern":"1","supervisor":[{"full_name":"Anlauf, Joachim","last_name":"Anlauf","first_name":"Joachim"}],"citation":{"ieee":"A. Padalkin, <i>Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen Netzes auf einem FPGA</i>. Rheinische Friedrich-Wilhelms-Universität Bonn, 2016.","mla":"Padalkin, Andreas. <i>Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden Neuronalen Netzes Auf Einem FPGA</i>. 2016.","apa":"Padalkin, A. (2016). <i>Modulbasierte Realisierung eines mittels Backpropagation lernenden Neuronalen Netzes auf einem FPGA</i>.","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} }","chicago":"Padalkin, Andreas. <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.","short":"A. Padalkin, Modulbasierte Realisierung Eines Mittels Backpropagation Lernenden Neuronalen Netzes Auf Einem FPGA, Rheinische Friedrich-Wilhelms-Universität Bonn, 2016."},"type":"bachelorsthesis","place":"Rheinische Friedrich-Wilhelms-Universität Bonn","date_created":"2021-09-29T12:40:16Z"}]