[{"volume":39,"user_id":"15578","_id":"65733","publisher":"Springer Science and Business Media LLC","status":"public","citation":{"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>.","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} }","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>","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>.","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>","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)."},"doi":"10.1007/s00446-026-00505-2","language":[{"iso":"eng"}],"article_number":"15","intvolume":"        39","date_updated":"2026-05-29T12:13:09Z","publication_status":"published","author":[{"id":"88238","first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"publication_identifier":{"issn":["0178-2770","1432-0452"]},"year":"2026","title":"Polylogarithmic time algorithms for shortest path forests in programmable matter","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"journal_article","date_created":"2026-05-29T12:11:32Z","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>"}],"publication":"Distributed Computing","issue":"2"},{"abstract":[{"text":"The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed algorithm that enables a group of modules to reconfigure into a rhombus shape, starting from an arbitrary side-connected configuration. It is connectivity-preserving and operates under minimal assumptions: one leader module, common chirality, constant memory per module, and visibility and communication restricted to immediate neighbors. Unlike prior work, which relaxes the original sliding square move-set, our approach uses the unmodified move-set, addressing the additional challenge of handling locked configurations. Our algorithm is sequential in nature and operates with a worst-case time complexity of O(n^2) rounds, which is optimal for sequential algorithms. To improve runtime, we introduce two parallel variants of the algorithm. Both rely on a spanning tree data structure, allowing modules to make decisions based on local connectivity. Our experimental results show a significant speedup for the first variant, and a linear average runtime for the second variant, which is worst-case optimal for parallel algorithms.","lang":"eng"}],"publication":"Stabilization, Safety, and Security of Distributed Systems","department":[{"_id":"79"}],"type":"conference","date_created":"2025-11-23T21:07:12Z","publication_status":"published","date_updated":"2026-02-11T08:31:14Z","author":[{"last_name":"Kostitsyna","first_name":"Irina","full_name":"Kostitsyna, Irina"},{"full_name":"Liedtke, David Jan","last_name":"Liedtke","first_name":"David Jan","id":"55557"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"publication_identifier":{"isbn":["9783032111265","9783032111272"],"issn":["0302-9743","1611-3349"]},"title":"Invited Paper: Distributed Rhombus Formation of Sliding Squares","year":"2025","doi":"10.1007/978-3-032-11127-2_26","language":[{"iso":"eng"}],"citation":{"chicago":"Kostitsyna, Irina, David Jan Liedtke, and Christian Scheideler. “Invited Paper: Distributed Rhombus Formation of Sliding Squares.” In <i>Stabilization, Safety, and Security of Distributed Systems</i>, edited by Silvia Bonomi, Partha Sarathi Mandal, Peter Robinson, Gokarna Sharma, and Sebastien Tixeuil, 325–42. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">https://doi.org/10.1007/978-3-032-11127-2_26</a>.","short":"I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: S. Bonomi, P.S. Mandal, P. Robinson, G. Sharma, S. Tixeuil (Eds.), Stabilization, Safety, and Security of Distributed Systems, Springer Nature Switzerland, Cham, 2025, pp. 325–342.","ieee":"I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Invited Paper: Distributed Rhombus Formation of Sliding Squares,” in <i>Stabilization, Safety, and Security of Distributed Systems</i>, Kathmandu, 2025, pp. 325–342, doi: <a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>.","apa":"Kostitsyna, I., Liedtke, D. J., &#38; Scheideler, C. (2025). Invited Paper: Distributed Rhombus Formation of Sliding Squares. In S. Bonomi, P. S. Mandal, P. Robinson, G. Sharma, &#38; S. Tixeuil (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems</i> (pp. 325–342). Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">https://doi.org/10.1007/978-3-032-11127-2_26</a>","bibtex":"@inproceedings{Kostitsyna_Liedtke_Scheideler_2025, place={Cham}, title={Invited Paper: Distributed Rhombus Formation of Sliding Squares}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems}, publisher={Springer Nature Switzerland}, author={Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}, editor={Bonomi, Silvia and Mandal, Partha Sarathi and Robinson, Peter and Sharma, Gokarna and Tixeuil, Sebastien}, year={2025}, pages={325–342} }","ama":"Kostitsyna I, Liedtke DJ, Scheideler C. Invited Paper: Distributed Rhombus Formation of Sliding Squares. In: Bonomi S, Mandal PS, Robinson P, Sharma G, Tixeuil S, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>. Springer Nature Switzerland; 2025:325-342. doi:<a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>","mla":"Kostitsyna, Irina, et al. “Invited Paper: Distributed Rhombus Formation of Sliding Squares.” <i>Stabilization, Safety, and Security of Distributed Systems</i>, edited by Silvia Bonomi et al., Springer Nature Switzerland, 2025, pp. 325–42, doi:<a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>."},"place":"Cham","conference":{"end_date":"2025-10-11","location":"Kathmandu","name":"27th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2025-10-09"},"status":"public","editor":[{"full_name":"Bonomi, Silvia","first_name":"Silvia","last_name":"Bonomi"},{"last_name":"Mandal","first_name":"Partha Sarathi","full_name":"Mandal, Partha Sarathi"},{"full_name":"Robinson, Peter","last_name":"Robinson","first_name":"Peter"},{"last_name":"Sharma","first_name":"Gokarna","full_name":"Sharma, Gokarna"},{"first_name":"Sebastien","last_name":"Tixeuil","full_name":"Tixeuil, Sebastien"}],"user_id":"15578","_id":"62285","publisher":"Springer Nature Switzerland","page":"325-342"},{"date_updated":"2026-02-11T09:11:49Z","status":"public","year":"2025","title":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"},{"last_name":"Kumar","first_name":"Manish","full_name":"Kumar, Manish"}],"user_id":"15578","_id":"64098","language":[{"iso":"eng"}],"publication":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","citation":{"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.","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.","short":"C. Scheideler, A. Padalkin, M. Kumar, Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025) (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} }","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>.","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."},"type":"journal_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2026-02-10T09:41:12Z"},{"date_updated":"2026-02-11T09:11:42Z","status":"public","year":"2025","title":"AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"id":"63743","full_name":"Artmann, Matthias","last_name":"Artmann","first_name":"Matthias"},{"last_name":"Maurer","first_name":"Tobias ","full_name":"Maurer, Tobias "},{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel","id":"3902"}],"user_id":"15578","language":[{"iso":"eng"}],"_id":"64094","citation":{"short":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, D. Warner, in: SoCG 2025: 81:1-81:5, 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>.","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.","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} }","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."},"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"place":"SoCG 2025: 81:1-81:5","date_created":"2026-02-10T09:01:15Z"},{"language":[{"iso":"eng"}],"_id":"64096","user_id":"15578","status":"public","year":"2025","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. ","author":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Jinfeng","last_name":"Dou","full_name":"Dou, Jinfeng","id":"92888"},{"full_name":"Götte, Thorsten ","last_name":"Götte","first_name":"Thorsten "},{"first_name":"Henning","last_name":"Hillebrandt","full_name":"Hillebrandt, Henning","id":"74425"},{"id":"50024","first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian"}],"date_updated":"2026-02-11T09:11:29Z","date_created":"2026-02-10T09:10:14Z","place":"ITCS 2025: 45:1-45:26","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"chicago":"Scheideler, Christian, Jinfeng Dou, Thorsten  Götte, Henning Hillebrandt, and Julian Werthmann. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. .” ITCS 2025: 45:1-45:26, 2025.","short":"C. Scheideler, J. Dou, T. Götte, H. Hillebrandt, J. Werthmann, in: ITCS 2025: 45:1-45:26, 2025.","ieee":"C. Scheideler, J. Dou, T. Götte, H. Hillebrandt, and J. Werthmann, “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. ,” 2025.","apa":"Scheideler, C., Dou, J., Götte, T., Hillebrandt, H., &#38; Werthmann, J. (2025). <i>Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. </i>.","bibtex":"@inproceedings{Scheideler_Dou_Götte_Hillebrandt_Werthmann_2025, place={ITCS 2025: 45:1-45:26}, title={Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. }, author={Scheideler, Christian and Dou, Jinfeng and Götte, Thorsten  and Hillebrandt, Henning and Werthmann, Julian}, year={2025} }","ama":"Scheideler C, Dou J, Götte T, Hillebrandt H, Werthmann J. Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. . In: ; 2025.","mla":"Scheideler, Christian, et al. <i>Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. </i>. 2025."}},{"date_created":"2026-02-10T09:49:03Z","place":"SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"book_editor","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"bibtex":"@book{Scheideler_Meeks_2025, place={SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title={4th Symposium on Algorithmic Foundations of Dynamic Networks.}, year={2025} }","ama":"Scheideler C, Meeks K, eds. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i>; 2025.","mla":"Scheideler, Christian, and Kitty Meeks, editors. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i> 2025.","chicago":"Scheideler, Christian, and Kitty Meeks, eds. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i> SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","short":"C. Scheideler, K. Meeks, eds., 4th Symposium on Algorithmic Foundations of Dynamic Networks., SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ieee":"C. Scheideler and K. Meeks, Eds., <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i> SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","apa":"Scheideler, C., &#38; Meeks, K. (Eds.). (2025). <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i>"},"language":[{"iso":"eng"}],"_id":"64099","user_id":"15578","editor":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Meeks, Kitty","first_name":"Kitty","last_name":"Meeks"}],"status":"public","year":"2025","title":"4th Symposium on Algorithmic Foundations of Dynamic Networks.","publication_identifier":{"unknown":["ISBN 978-3-95977-368-3"]},"date_updated":"2026-02-11T09:11:09Z"},{"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":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"id":"63743","first_name":"Matthias","last_name":"Artmann","full_name":"Artmann, Matthias"},{"last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238"}]},{"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"conference","place":"Euro-Par (3) 2025: 48-62","date_created":"2026-02-10T09:04:56Z","citation":{"bibtex":"@inproceedings{Scheideler_Augustine _Werthmann_2025, place={Euro-Par (3) 2025: 48-62}, title={Supervised Distributed Computing. }, author={Scheideler, Christian and Augustine , John  and Werthmann, Julian}, year={2025} }","chicago":"Scheideler, Christian, John  Augustine , and Julian Werthmann. “Supervised Distributed Computing. .” Euro-Par (3) 2025: 48-62, 2025.","short":"C. Scheideler, J. Augustine , J. Werthmann, in: Euro-Par (3) 2025: 48-62, 2025.","ama":"Scheideler C, Augustine  J, Werthmann J. Supervised Distributed Computing. . In: ; 2025.","ieee":"C. Scheideler, J. Augustine , and J. Werthmann, “Supervised Distributed Computing. ,” 2025.","apa":"Scheideler, C., Augustine , J., &#38; Werthmann, J. (2025). <i>Supervised Distributed Computing. </i>.","mla":"Scheideler, Christian, et al. <i>Supervised Distributed Computing. </i>. 2025."},"user_id":"15578","language":[{"iso":"eng"}],"_id":"64095","date_updated":"2026-02-11T09:11:35Z","author":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Augustine , John ","first_name":"John ","last_name":"Augustine "},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"title":"Supervised Distributed Computing. ","year":"2025","status":"public"},{"page":"45:1–45:26","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"59268","user_id":"34727","volume":325,"editor":[{"full_name":"Meka, Raghu","first_name":"Raghu","last_name":"Meka"}],"status":"public","place":"Dagstuhl, Germany","citation":{"mla":"Dou, Jinfeng, et al. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs.” <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>, edited by Raghu Meka, vol. 325, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, p. 45:1–45:26, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>.","bibtex":"@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2025, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs}, volume={325}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>}, booktitle={16th Innovations in Theoretical Computer Science Conference (ITCS 2025)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, editor={Meka, Raghu}, year={2025}, pages={45:1–45:26}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In: Meka R, ed. <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>. Vol 325. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2025:45:1–45:26. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>","ieee":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs,” in <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>, 2025, vol. 325, p. 45:1–45:26, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>.","apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &#38; Werthmann, J. (2025). Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In R. Meka (Ed.), <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i> (Vol. 325, p. 45:1–45:26). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">https://doi.org/10.4230/LIPIcs.ITCS.2025.45</a>","chicago":"Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs.” In <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>, edited by Raghu Meka, 325:45:1–45:26. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">https://doi.org/10.4230/LIPIcs.ITCS.2025.45</a>.","short":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: R. Meka (Ed.), 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025, p. 45:1–45:26."},"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ITCS.2025.45","year":"2025","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs","author":[{"last_name":"Dou","first_name":"Jinfeng","full_name":"Dou, Jinfeng","id":"92888"},{"full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten","id":"34727"},{"full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning","id":"74425"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"publication_identifier":{"isbn":["978-3-95977-361-4"],"issn":["1868-8969"]},"date_updated":"2025-10-15T12:57:11Z","intvolume":"       325","date_created":"2025-04-02T14:09:19Z","type":"conference","publication":"16th Innovations in Theoretical Computer Science Conference (ITCS 2025)"},{"type":"journal_article","department":[{"_id":"79"}],"date_created":"2025-11-03T10:19:53Z","publication":"Theoretical Computer Science","citation":{"mla":"Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” <i>Theoretical Computer Science</i>, vol. 1057, 115552, Elsevier BV, 2025, doi:<a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>.","ama":"Hinnenthal K, Liedtke DJ, Scheideler C. Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures. <i>Theoretical Computer Science</i>. 2025;1057. doi:<a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>","bibtex":"@article{Hinnenthal_Liedtke_Scheideler_2025, title={Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures}, volume={1057}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>}, number={115552}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian}, year={2025} }","apa":"Hinnenthal, K., Liedtke, D. J., &#38; Scheideler, C. (2025). Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures. <i>Theoretical Computer Science</i>, <i>1057</i>, Article 115552. <a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">https://doi.org/10.1016/j.tcs.2025.115552</a>","ieee":"K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures,” <i>Theoretical Computer Science</i>, vol. 1057, Art. no. 115552, 2025, doi: <a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>.","chicago":"Hinnenthal, Kristian, David Jan Liedtke, and Christian Scheideler. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” <i>Theoretical Computer Science</i> 1057 (2025). <a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">https://doi.org/10.1016/j.tcs.2025.115552</a>.","short":"K. Hinnenthal, D.J. Liedtke, C. Scheideler, Theoretical Computer Science 1057 (2025)."},"doi":"10.1016/j.tcs.2025.115552","user_id":"55557","volume":1057,"article_number":"115552","language":[{"iso":"eng"}],"_id":"62051","publisher":"Elsevier BV","date_updated":"2025-11-03T10:21:52Z","publication_status":"published","intvolume":"      1057","title":"Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures","status":"public","year":"2025","author":[{"last_name":"Hinnenthal","first_name":"Kristian","full_name":"Hinnenthal, Kristian","id":"32229"},{"full_name":"Liedtke, David Jan","last_name":"Liedtke","first_name":"David Jan","id":"55557"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"publication_identifier":{"issn":["0304-3975"]}},{"language":[{"iso":"eng"}],"_id":"61184","publisher":"Springer Nature Switzerland","user_id":"50024","doi":"10.1007/978-3-031-99872-0_4","title":"Supervised Distributed Computing","year":"2025","status":"public","author":[{"full_name":"Augustine, John","last_name":"Augustine","first_name":"John"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"id":"50024","last_name":"Werthmann","first_name":"Julian","full_name":"Werthmann, Julian"}],"publication_identifier":{"isbn":["9783031998713","9783031998720"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2025-09-11T08:33:27Z","date_created":"2025-09-11T08:30:57Z","place":"Cham","type":"conference","publication":"Lecture Notes in Computer Science","citation":{"short":"J. Augustine, C. Scheideler, J. Werthmann, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","chicago":"Augustine, John, Christian Scheideler, and Julian Werthmann. “Supervised Distributed Computing.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">https://doi.org/10.1007/978-3-031-99872-0_4</a>.","ieee":"J. Augustine, C. Scheideler, and J. Werthmann, “Supervised Distributed Computing,” 2025, doi: <a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>.","apa":"Augustine, J., Scheideler, C., &#38; Werthmann, J. (2025). Supervised Distributed Computing. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">https://doi.org/10.1007/978-3-031-99872-0_4</a>","bibtex":"@inproceedings{Augustine_Scheideler_Werthmann_2025, place={Cham}, title={Supervised Distributed Computing}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Augustine, John and Scheideler, Christian and Werthmann, Julian}, year={2025} }","ama":"Augustine J, Scheideler C, Werthmann J. Supervised Distributed Computing. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>","mla":"Augustine, John, et al. “Supervised Distributed Computing.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>."}},{"status":"public","page":"15:1–15:20","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","_id":"54807","user_id":"55557","volume":292,"editor":[{"full_name":"Casteigts, Arnaud","first_name":"Arnaud","last_name":"Casteigts"},{"full_name":"Kuhn, Fabian","last_name":"Kuhn","first_name":"Fabian"}],"citation":{"bibtex":"@inproceedings{Hinnenthal_Liedtke_Scheideler_2024, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures}, volume={292}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2024.15\">10.4230/LIPIcs.SAND.2024.15</a>}, booktitle={3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian}, editor={Casteigts, Arnaud and Kuhn, Fabian}, year={2024}, pages={15:1–15:20}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Hinnenthal K, Liedtke DJ, Scheideler C. Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. In: Casteigts A, Kuhn F, eds. <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)</i>. Vol 292. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2024:15:1–15:20. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2024.15\">10.4230/LIPIcs.SAND.2024.15</a>","mla":"Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)</i>, edited by Arnaud Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024, p. 15:1–15:20, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2024.15\">10.4230/LIPIcs.SAND.2024.15</a>.","short":"K. Hinnenthal, D.J. Liedtke, C. Scheideler, in: A. Casteigts, F. Kuhn (Eds.), 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2024, p. 15:1–15:20.","chicago":"Hinnenthal, Kristian, David Jan Liedtke, and Christian Scheideler. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” In <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)</i>, edited by Arnaud Casteigts and Fabian Kuhn, 292:15:1–15:20. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2024.15\">https://doi.org/10.4230/LIPIcs.SAND.2024.15</a>.","ieee":"K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures,” in <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)</i>, 2024, vol. 292, p. 15:1–15:20, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2024.15\">10.4230/LIPIcs.SAND.2024.15</a>.","apa":"Hinnenthal, K., Liedtke, D. J., &#38; Scheideler, C. (2024). Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. In A. Casteigts &#38; F. Kuhn (Eds.), <i>3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)</i> (Vol. 292, p. 15:1–15:20). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2024.15\">https://doi.org/10.4230/LIPIcs.SAND.2024.15</a>"},"place":"Dagstuhl, Germany","title":"Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures","year":"2024","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-315-7"]},"author":[{"id":"32229","last_name":"Hinnenthal","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"full_name":"Liedtke, David Jan","first_name":"David Jan","last_name":"Liedtke","id":"55557"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"date_updated":"2024-07-18T09:32:49Z","intvolume":"       292","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SAND.2024.15","publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)","abstract":[{"lang":"eng","text":"This paper considers the shape formation problem within the 3D hybrid model, where a single agent with a strictly limited viewing range and the computational capacity of a deterministic finite automaton manipulates passive tiles through pick-up, movement, and placement actions. The goal is to reconfigure a set of tiles into a specific shape termed an icicle. The icicle, identified as a dense, hole-free structure, is strategically chosen to function as an intermediate shape for more intricate shape formation tasks. It is designed for easy exploration by a finite state agent, enabling the identification of tiles that can be lifted without breaking connectivity. Compared to the line shape, the icicle presents distinct advantages, including a reduced diameter and the presence of multiple removable tiles. We propose an algorithm that transforms an arbitrary initially connected tile structure into an icicle in 𝒪(n³) steps, matching the runtime of the line formation algorithm from prior work. Our theoretical contribution is accompanied by an extensive experimental analysis, indicating that our algorithm decreases the diameter of tile structures on average."}],"date_created":"2024-06-18T07:45:34Z","keyword":["Programmable Matter","Shape Formation","3D Model","Finite Automaton"],"type":"conference","department":[{"_id":"79"}]},{"editor":[{"full_name":"Emek, Yuval","first_name":"Yuval","last_name":"Emek"}],"user_id":"55557","_id":"54802","publisher":"Springer Nature Switzerland","status":"public","place":"Cham","citation":{"chicago":"Kostitsyna, Irina, David Jan Liedtke, and Christian Scheideler. “Universal Coating by 3D Hybrid Programmable Matter.” In <i>Structural Information and Communication Complexity</i>, edited by Yuval Emek. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-60603-8_21\">https://doi.org/10.1007/978-3-031-60603-8_21</a>.","short":"I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: Y. Emek (Ed.), Structural Information and Communication Complexity, Springer Nature Switzerland, Cham, 2024.","apa":"Kostitsyna, I., Liedtke, D. J., &#38; Scheideler, C. (2024). Universal Coating by 3D Hybrid Programmable Matter. In Y. Emek (Ed.), <i>Structural Information and Communication Complexity</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-60603-8_21\">https://doi.org/10.1007/978-3-031-60603-8_21</a>","ieee":"I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Universal Coating by 3D Hybrid Programmable Matter,” in <i>Structural Information and Communication Complexity</i>, Y. Emek, Ed. Cham: Springer Nature Switzerland, 2024.","ama":"Kostitsyna I, Liedtke DJ, Scheideler C. Universal Coating by 3D Hybrid Programmable Matter. In: Emek Y, ed. <i>Structural Information and Communication Complexity</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-60603-8_21\">10.1007/978-3-031-60603-8_21</a>","bibtex":"@inbook{Kostitsyna_Liedtke_Scheideler_2024, place={Cham}, title={Universal Coating by 3D Hybrid Programmable Matter}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-60603-8_21\">10.1007/978-3-031-60603-8_21</a>}, booktitle={Structural Information and Communication Complexity}, publisher={Springer Nature Switzerland}, author={Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}, editor={Emek, Yuval}, year={2024} }","mla":"Kostitsyna, Irina, et al. “Universal Coating by 3D Hybrid Programmable Matter.” <i>Structural Information and Communication Complexity</i>, edited by Yuval Emek, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-60603-8_21\">10.1007/978-3-031-60603-8_21</a>."},"doi":"10.1007/978-3-031-60603-8_21","language":[{"iso":"eng"}],"date_updated":"2024-07-18T09:32:58Z","publication_status":"published","author":[{"full_name":"Kostitsyna, Irina","last_name":"Kostitsyna","first_name":"Irina"},{"id":"55557","first_name":"David Jan","last_name":"Liedtke","full_name":"Liedtke, David Jan"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031606021","9783031606038"]},"year":"2024","title":"Universal Coating by 3D Hybrid Programmable Matter","department":[{"_id":"79"}],"type":"book_chapter","keyword":["Programmable Matter","Coating","Finite Automaton","3D"],"date_created":"2024-06-18T07:36:04Z","abstract":[{"text":"Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size n with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.","lang":"eng"}],"publication":"Structural Information and Communication Complexity"},{"publication":"Natural Computing","citation":{"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>.","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>.","short":"A. Padalkin, C. Scheideler, D. Warner, Natural Computing (2024).","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>"},"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"}],"date_created":"2024-07-24T14:28:27Z","type":"journal_article","year":"2024","status":"public","title":"The structural power of reconfigurable circuits in the amoebot model","publication_identifier":{"issn":["1567-7818","1572-9796"]},"author":[{"full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas","id":"88238"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"id":"3902","full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner"}],"publication_status":"published","date_updated":"2024-07-24T14:28:43Z","language":[{"iso":"eng"}],"_id":"55379","publisher":"Springer Science and Business Media LLC","user_id":"88238","doi":"10.1007/s11047-024-09981-6"},{"_id":"55376","language":[{"iso":"eng"}],"series_title":"LIPIcs","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"18:1–18:20","editor":[{"first_name":"Arnaud","last_name":"Casteigts","full_name":"Casteigts, Arnaud"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"}],"volume":292,"doi":"10.4230/LIPICS.SAND.2024.18","user_id":"88238","author":[{"id":"88238","first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas"},{"last_name":"Kumar","first_name":"Manish","full_name":"Kumar, Manish"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"title":"Reconfiguration and Locomotion with Joint Movements in the Amoebot Model","status":"public","year":"2024","intvolume":"       292","date_updated":"2024-07-24T14:25:46Z","date_created":"2024-07-24T14:25:07Z","type":"conference","citation":{"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>","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>.","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>.","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.","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>.","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>"},"publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece"},{"user_id":"88238","doi":"10.1145/3662158.3662776","_id":"55377","publisher":"ACM","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2024-07-24T14:26:23Z","title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter","year":"2024","status":"public","author":[{"id":"88238","last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"type":"conference","date_created":"2024-07-24T14:26:10Z","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>","short":"A. Padalkin, C. Scheideler, in: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024.","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>."}},{"user_id":"15578","_id":"64104","language":[{"iso":"eng"}],"date_updated":"2026-02-11T09:12:05Z","title":"Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20","status":"public","year":"2024","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Hinnenthal ","first_name":"Kristian ","full_name":"Hinnenthal , Kristian "},{"full_name":"Liedtke, David Jan","last_name":"Liedtke","first_name":"David Jan","id":"55557"}],"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2026-02-10T10:12:18Z","place":"CoRR abs/2401.17734 (2024)","citation":{"chicago":"Scheideler, Christian, Kristian  Hinnenthal , and David Jan Liedtke. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20.” CoRR abs/2401.17734 (2024), 2024.","short":"C. Scheideler, K. Hinnenthal , D.J. Liedtke, in: CoRR abs/2401.17734 (2024), 2024.","apa":"Scheideler, C., Hinnenthal , K., &#38; Liedtke, D. J. (2024). <i>Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20</i>.","ieee":"C. Scheideler, K. Hinnenthal , and D. J. Liedtke, “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20,” 2024.","ama":"Scheideler C, Hinnenthal  K, Liedtke DJ. Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20. In: ; 2024.","bibtex":"@inproceedings{Scheideler_Hinnenthal _Liedtke_2024, place={CoRR abs/2401.17734 (2024)}, title={Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20}, author={Scheideler, Christian and Hinnenthal , Kristian  and Liedtke, David Jan}, year={2024} }","mla":"Scheideler, Christian, et al. <i>Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20</i>. 2024."}},{"citation":{"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} }","chicago":"Scheideler, Christian, and Andreas Padalkin. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 65–75. PODC 2024: 65-75, 2024.","short":"C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.","ama":"Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . In: ; 2024:65-75.","ieee":"C. Scheideler and A. Padalkin, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 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.","mla":"Scheideler, Christian, and Andreas Padalkin. <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 2024, pp. 65–75."},"date_created":"2026-02-10T10:06:36Z","place":"PODC 2024: 65-75","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"conference","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"id":"88238","last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas"}],"title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ","status":"public","year":"2024","date_updated":"2026-02-11T09:11:58Z","language":[{"iso":"eng"}],"_id":"64103","page":"65 - 75","user_id":"15578"},{"date_created":"2026-02-10T10:21:39Z","place":"SIROCCO 2024: 384-401","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"conference","citation":{"ieee":"C. Scheideler, I. Kostitsyna, and D. J. Liedtke, “Universal Coating by 3D Hybrid Programmable Matter.,” 2024.","apa":"Scheideler, C., Kostitsyna, I., &#38; Liedtke, D. J. (2024). <i>Universal Coating by 3D Hybrid Programmable Matter.</i>","short":"C. Scheideler, I. Kostitsyna, D.J. Liedtke, in: SIROCCO 2024: 384-401, 2024.","chicago":"Scheideler, Christian, Irina  Kostitsyna, and David Jan Liedtke. “Universal Coating by 3D Hybrid Programmable Matter.” SIROCCO 2024: 384-401, 2024.","mla":"Scheideler, Christian, et al. <i>Universal Coating by 3D Hybrid Programmable Matter.</i> 2024.","bibtex":"@inproceedings{Scheideler_Kostitsyna_Liedtke_2024, place={SIROCCO 2024: 384-401}, title={Universal Coating by 3D Hybrid Programmable Matter.}, author={Scheideler, Christian and Kostitsyna, Irina  and Liedtke, David Jan}, year={2024} }","ama":"Scheideler C, Kostitsyna I, Liedtke DJ. Universal Coating by 3D Hybrid Programmable Matter. In: ; 2024."},"language":[{"iso":"eng"}],"_id":"64106","user_id":"15578","author":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Kostitsyna, Irina ","last_name":"Kostitsyna","first_name":"Irina "},{"id":"55557","first_name":"David Jan","last_name":"Liedtke","full_name":"Liedtke, David Jan"}],"status":"public","title":"Universal Coating by 3D Hybrid Programmable Matter.","year":"2024","date_updated":"2026-02-11T09:12:11Z"},{"page":"603 - 625","_id":"64100","language":[{"iso":"eng"}],"user_id":"15578","title":"The structural power of reconfigurable circuits in the amoebot model. ","status":"public","year":"2024","author":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"88238","last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"id":"3902","last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel"}],"date_updated":"2026-02-11T09:13:04Z","date_created":"2026-02-10T09:56:23Z","type":"journal_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"publication":"The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)","citation":{"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.","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.","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} }","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.","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.","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.","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."}}]