[{"citation":{"bibtex":"@book{Berger_2026, title={Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters}, author={Berger, Thilo }, year={2026} }","mla":"Berger, Thilo. <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>. 2026.","short":"T. Berger, Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters, 2026.","apa":"Berger, T. (2026). <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>.","ama":"Berger T. <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>.; 2026.","chicago":"Berger, Thilo . <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>, 2026.","ieee":"T. Berger, <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>. 2026."},"year":"2026","title":"Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2026-02-27T12:16:02Z","author":[{"last_name":"Berger","full_name":"Berger, Thilo ","first_name":"Thilo "}],"date_updated":"2026-02-27T12:17:20Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"64783"},{"type":"mastersthesis","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"59624","language":[{"iso":"eng"}],"citation":{"ama":"Showmik MJB. <i>Enhancing Blockchain Efficiency via Median Rule</i>.; 2025.","ieee":"M. J. B. Showmik, <i>Enhancing Blockchain Efficiency via Median Rule</i>. 2025.","chicago":"Showmik, Md Jannatul Baki. <i>Enhancing Blockchain Efficiency via Median Rule</i>, 2025.","mla":"Showmik, Md Jannatul Baki. <i>Enhancing Blockchain Efficiency via Median Rule</i>. 2025.","short":"M.J.B. Showmik, Enhancing Blockchain Efficiency via Median Rule, 2025.","bibtex":"@book{Showmik_2025, title={Enhancing Blockchain Efficiency via Median Rule}, author={Showmik, Md Jannatul Baki}, year={2025} }","apa":"Showmik, M. J. B. (2025). <i>Enhancing Blockchain Efficiency via Median Rule</i>."},"year":"2025","date_created":"2025-04-22T08:24:39Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"Md Jannatul Baki","full_name":"Showmik, Md Jannatul Baki","last_name":"Showmik"}],"date_updated":"2025-04-22T08:26:45Z","title":"Enhancing Blockchain Efficiency via Median Rule"},{"type":"conference","status":"public","editor":[{"full_name":"Bonomi, Silvia","last_name":"Bonomi","first_name":"Silvia"},{"first_name":"Partha Sarathi","full_name":"Mandal, Partha Sarathi","last_name":"Mandal"},{"last_name":"Robinson","full_name":"Robinson, Peter","first_name":"Peter"},{"first_name":"Gokarna","last_name":"Sharma","full_name":"Sharma, Gokarna"},{"full_name":"Tixeuil, Sebastien","last_name":"Tixeuil","first_name":"Sebastien"}],"department":[{"_id":"79"}],"user_id":"15578","_id":"62285","publication_identifier":{"isbn":["9783032111265","9783032111272"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"325-342","citation":{"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>","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>.","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.","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} }","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>.","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>.","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>"},"place":"Cham","author":[{"full_name":"Kostitsyna, Irina","last_name":"Kostitsyna","first_name":"Irina"},{"last_name":"Liedtke","id":"55557","full_name":"Liedtke, David Jan","first_name":"David Jan"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2026-02-11T08:31:14Z","conference":{"location":"Kathmandu","end_date":"2025-10-11","start_date":"2025-10-09","name":"27th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)"},"doi":"10.1007/978-3-032-11127-2_26","publication":"Stabilization, Safety, and Security of Distributed Systems","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"}],"language":[{"iso":"eng"}],"year":"2025","date_created":"2025-11-23T21:07:12Z","publisher":"Springer Nature Switzerland","title":"Invited Paper: Distributed Rhombus Formation of Sliding Squares"},{"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.","ieee":"C. Scheideler, A. Padalkin, and M. Kumar, “Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025),” <i>Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)</i>, 2025.","ama":"Scheideler C, Padalkin A, Kumar M. Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025). <i>Reconfiguration and locomotion with joint movements in the amoebot model Auton Robots 49(3): 22 (2025)</i>. Published online 2025.","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.","short":"C. Scheideler, A. Padalkin, M. Kumar, Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025) (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>."},"year":"2025","author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin"},{"full_name":"Kumar, Manish","last_name":"Kumar","first_name":"Manish"}],"date_created":"2026-02-10T09:41:12Z","date_updated":"2026-02-11T09:11:49Z","title":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","publication":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","type":"journal_article","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"64098","language":[{"iso":"eng"}]},{"title":"AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ","date_updated":"2026-02-11T09:11:42Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Matthias","last_name":"Artmann","id":"63743","full_name":"Artmann, Matthias"},{"first_name":"Tobias ","last_name":"Maurer","full_name":"Maurer, Tobias "},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"},{"first_name":"Daniel","id":"3902","full_name":"Warner, Daniel","last_name":"Warner"}],"date_created":"2026-02-10T09:01:15Z","year":"2025","place":"SoCG 2025: 81:1-81:5","citation":{"ama":"Scheideler C, Artmann M, Maurer T, Padalkin A, Warner D. AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). . In: ; 2025.","chicago":"Scheideler, Christian, Matthias Artmann, Tobias  Maurer, Andreas Padalkin, and Daniel Warner. “AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). .” SoCG 2025: 81:1-81:5, 2025.","ieee":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, and D. Warner, “AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ,” 2025.","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>.","short":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, D. Warner, in: SoCG 2025: 81:1-81:5, 2025.","bibtex":"@inproceedings{Scheideler_Artmann_Maurer_Padalkin_Warner_2025, place={SoCG 2025: 81:1-81:5}, title={AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). }, author={Scheideler, Christian and Artmann, Matthias and Maurer, Tobias  and Padalkin, Andreas and Warner, Daniel}, year={2025} }","mla":"Scheideler, Christian, et al. <i>AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). </i>. 2025."},"language":[{"iso":"eng"}],"_id":"64094","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","status":"public","type":"conference"},{"year":"2025","place":"ITCS 2025: 45:1-45:26","citation":{"short":"C. Scheideler, J. Dou, T. Götte, H. Hillebrandt, J. Werthmann, in: ITCS 2025: 45:1-45:26, 2025.","mla":"Scheideler, Christian, et al. <i>Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. </i>. 2025.","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} }","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>.","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.","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.","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."},"date_updated":"2026-02-11T09:11:29Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"last_name":"Dou","id":"92888","full_name":"Dou, Jinfeng","first_name":"Jinfeng"},{"first_name":"Thorsten ","full_name":"Götte, Thorsten ","last_name":"Götte"},{"first_name":"Henning","full_name":"Hillebrandt, Henning","id":"74425","last_name":"Hillebrandt"},{"last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian","first_name":"Julian"}],"date_created":"2026-02-10T09:10:14Z","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. ","type":"conference","status":"public","_id":"64096","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","language":[{"iso":"eng"}]},{"type":"book_editor","editor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Meeks, Kitty","last_name":"Meeks","first_name":"Kitty"}],"status":"public","_id":"64099","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","language":[{"iso":"eng"}],"publication_identifier":{"unknown":["ISBN 978-3-95977-368-3"]},"year":"2025","place":"SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"apa":"Scheideler, C., &#38; Meeks, K. (Eds.). (2025). <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i>","mla":"Scheideler, Christian, and Kitty Meeks, editors. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i> 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.","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} }","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.","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.","ama":"Scheideler C, Meeks K, eds. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i>; 2025."},"date_updated":"2026-02-11T09:11:09Z","date_created":"2026-02-10T09:49:03Z","title":"4th Symposium on Algorithmic Foundations of Dynamic Networks."},{"year":"2025","place":"DISC 2025: 7:1-7:22","citation":{"ama":"Scheideler C, Artmann M, Padalkin A. On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. . In: ; 2025.","ieee":"C. Scheideler, M. Artmann, and A. Padalkin, “On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ,” 2025.","chicago":"Scheideler, Christian, Matthias Artmann, and Andreas Padalkin. “On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. .” DISC 2025: 7:1-7:22, 2025.","short":"C. Scheideler, M. Artmann, A. Padalkin, in: DISC 2025: 7:1-7:22, 2025.","mla":"Scheideler, Christian, et al. <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>. 2025.","bibtex":"@inproceedings{Scheideler_Artmann_Padalkin_2025, place={DISC 2025: 7:1-7:22}, title={On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. }, author={Scheideler, Christian and Artmann, Matthias and Padalkin, Andreas}, year={2025} }","apa":"Scheideler, C., Artmann, M., &#38; Padalkin, A. (2025). <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>."},"date_updated":"2026-02-11T09:11:19Z","author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Artmann, Matthias","id":"63743","last_name":"Artmann","first_name":"Matthias"},{"first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin"}],"date_created":"2026-02-10T09:17:54Z","title":"On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ","type":"conference","status":"public","_id":"64097","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"language":[{"iso":"eng"}]},{"type":"conference","status":"public","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"64095","language":[{"iso":"eng"}],"citation":{"ama":"Scheideler C, Augustine  J, Werthmann J. Supervised Distributed Computing. . In: ; 2025.","chicago":"Scheideler, Christian, John  Augustine , and Julian Werthmann. “Supervised Distributed Computing. .” Euro-Par (3) 2025: 48-62, 2025.","ieee":"C. Scheideler, J. Augustine , and J. Werthmann, “Supervised Distributed Computing. ,” 2025.","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} }","short":"C. Scheideler, J. Augustine , J. Werthmann, in: Euro-Par (3) 2025: 48-62, 2025.","mla":"Scheideler, Christian, et al. <i>Supervised Distributed Computing. </i>. 2025.","apa":"Scheideler, C., Augustine , J., &#38; Werthmann, J. (2025). <i>Supervised Distributed Computing. </i>."},"place":"Euro-Par (3) 2025: 48-62","year":"2025","date_created":"2026-02-10T09:04:56Z","author":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Augustine , John ","last_name":"Augustine ","first_name":"John "},{"first_name":"Julian","full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann"}],"date_updated":"2026-02-11T09:11:35Z","title":"Supervised Distributed Computing. "},{"_id":"62051","department":[{"_id":"79"}],"user_id":"55557","article_number":"115552","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","type":"journal_article","status":"public","date_updated":"2025-11-03T10:21:52Z","publisher":"Elsevier BV","volume":1057,"date_created":"2025-11-03T10:19:53Z","author":[{"first_name":"Kristian","last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian"},{"id":"55557","full_name":"Liedtke, David Jan","last_name":"Liedtke","first_name":"David Jan"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures","doi":"10.1016/j.tcs.2025.115552","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","year":"2025","intvolume":"      1057","citation":{"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>.","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>","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>","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>.","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} }","short":"K. Hinnenthal, D.J. Liedtke, C. Scheideler, Theoretical Computer Science 1057 (2025)."}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"62247","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","year":"2025","citation":{"ieee":"F. Werner, <i>Monoton erreichbarer Delaunaygraph</i>. 2025.","chicago":"Werner, Felix. <i>Monoton Erreichbarer Delaunaygraph</i>, 2025.","ama":"Werner F. <i>Monoton Erreichbarer Delaunaygraph</i>.; 2025.","apa":"Werner, F. (2025). <i>Monoton erreichbarer Delaunaygraph</i>.","short":"F. Werner, Monoton Erreichbarer Delaunaygraph, 2025.","bibtex":"@book{Werner_2025, title={Monoton erreichbarer Delaunaygraph}, author={Werner, Felix}, year={2025} }","mla":"Werner, Felix. <i>Monoton Erreichbarer Delaunaygraph</i>. 2025."},"title":"Monoton erreichbarer Delaunaygraph","date_updated":"2025-11-19T09:15:02Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"last_name":"Werner","full_name":"Werner, Felix","first_name":"Felix"}],"date_created":"2025-11-19T09:13:37Z"},{"language":[{"iso":"eng"}],"_id":"52318","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","status":"public","type":"bachelorsthesis","title":"Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung","date_updated":"2024-03-05T12:53:25Z","date_created":"2024-03-05T12:52:59Z","author":[{"first_name":"Svitlana","last_name":"Dorociak","full_name":"Dorociak, Svitlana"}],"supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"year":"2024","citation":{"ama":"Dorociak S. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>.; 2024.","ieee":"S. Dorociak, <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>. 2024.","chicago":"Dorociak, Svitlana. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>, 2024.","apa":"Dorociak, S. (2024). <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>.","mla":"Dorociak, Svitlana. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>. 2024.","short":"S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024.","bibtex":"@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }"}},{"status":"public","citation":{"ama":"De Groote C. <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>.; 2024.","ieee":"C. De Groote, <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>. 2024.","chicago":"De Groote, Carsten. <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>, 2024.","bibtex":"@book{De Groote_2024, title={A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes}, author={De Groote, Carsten}, year={2024} }","short":"C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes, 2024.","mla":"De Groote, Carsten. <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>. 2024.","apa":"De Groote, C. (2024). <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>."},"year":"2024","type":"mastersthesis","language":[{"iso":"eng"}],"title":"A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"Carsten","full_name":"De Groote, Carsten","last_name":"De Groote"}],"user_id":"15578","date_created":"2024-04-09T11:35:20Z","_id":"53374","date_updated":"2024-04-09T11:35:41Z"},{"_id":"53373","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_updated":"2024-04-09T11:32:20Z","author":[{"first_name":"Rajesh","last_name":"Doddegowda","full_name":"Doddegowda, Rajesh"}],"date_created":"2024-04-09T11:31:47Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"Optimal Drone Strategies For Packet Delivery","year":"2024","citation":{"bibtex":"@book{Doddegowda_2024, title={Optimal Drone Strategies For Packet Delivery}, author={Doddegowda, Rajesh}, year={2024} }","short":"R. Doddegowda, Optimal Drone Strategies For Packet Delivery, 2024.","mla":"Doddegowda, Rajesh. <i>Optimal Drone Strategies For Packet Delivery</i>. 2024.","apa":"Doddegowda, R. (2024). <i>Optimal Drone Strategies For Packet Delivery</i>.","ama":"Doddegowda R. <i>Optimal Drone Strategies For Packet Delivery</i>.; 2024.","chicago":"Doddegowda, Rajesh. <i>Optimal Drone Strategies For Packet Delivery</i>, 2024.","ieee":"R. Doddegowda, <i>Optimal Drone Strategies For Packet Delivery</i>. 2024."}},{"_id":"53372","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_updated":"2024-04-09T11:29:24Z","author":[{"last_name":"Thakur","full_name":"Thakur, Heena","first_name":"Heena"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2024-04-09T11:28:39Z","title":"Evaluating the Implications","year":"2024","citation":{"bibtex":"@book{Thakur_2024, title={Evaluating the Implications}, author={Thakur, Heena}, year={2024} }","mla":"Thakur, Heena. <i>Evaluating the Implications</i>. 2024.","short":"H. Thakur, Evaluating the Implications, 2024.","apa":"Thakur, H. (2024). <i>Evaluating the Implications</i>.","chicago":"Thakur, Heena. <i>Evaluating the Implications</i>, 2024.","ieee":"H. Thakur, <i>Evaluating the Implications</i>. 2024.","ama":"Thakur H. <i>Evaluating the Implications</i>.; 2024."}},{"title":"Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads ","language":[{"iso":"eng"}],"_id":"55002","date_updated":"2024-07-03T13:11:26Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","date_created":"2024-07-03T13:09:48Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"author":[{"first_name":"Dominik","last_name":"Delgado Steuter","full_name":"Delgado Steuter, Dominik"}],"year":"2024","status":"public","citation":{"apa":"Delgado Steuter, D. (2024). <i>Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads </i>.","mla":"Delgado Steuter, Dominik. <i>Realizing Concurrency on Top of the Microkernel SeL4 via Improved Threads </i>. 2024.","short":"D. Delgado Steuter, Realizing Concurrency on Top of the Microkernel SeL4 via Improved Threads , 2024.","bibtex":"@book{Delgado Steuter_2024, title={Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads }, author={Delgado Steuter, Dominik}, year={2024} }","ama":"Delgado Steuter D. <i>Realizing Concurrency on Top of the Microkernel SeL4 via Improved Threads </i>.; 2024.","ieee":"D. Delgado Steuter, <i>Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads </i>. 2024.","chicago":"Delgado Steuter, Dominik. <i>Realizing Concurrency on Top of the Microkernel SeL4 via Improved Threads </i>, 2024."},"type":"bachelorsthesis"},{"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"55003","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"last_name":"Artmann","full_name":"Artmann, Matthias","first_name":"Matthias"}],"date_created":"2024-07-03T14:01:54Z","date_updated":"2024-07-03T14:02:14Z","title":"On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits","citation":{"apa":"Artmann, M. (2024). <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>.","short":"M. Artmann, On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits, 2024.","bibtex":"@book{Artmann_2024, title={On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits}, author={Artmann, Matthias}, year={2024} }","mla":"Artmann, Matthias. <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>. 2024.","chicago":"Artmann, Matthias. <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>, 2024.","ieee":"M. Artmann, <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>. 2024.","ama":"Artmann M. <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>.; 2024."},"year":"2024"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"55092","citation":{"chicago":"Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>, 2024.","ieee":"V. M. Eranki, <i>Fever: Optimal Responsive View Synchronisation</i>. 2024.","ama":"Eranki VM. <i>Fever: Optimal Responsive View Synchronisation</i>.; 2024.","apa":"Eranki, V. M. (2024). <i>Fever: Optimal Responsive View Synchronisation</i>.","short":"V.M. Eranki, Fever: Optimal Responsive View Synchronisation, 2024.","mla":"Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>. 2024.","bibtex":"@book{Eranki_2024, title={Fever: Optimal Responsive View Synchronisation}, author={Eranki, Varun Maitreya}, year={2024} }"},"year":"2024","title":"Fever: Optimal Responsive View Synchronisation","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2024-07-05T12:37:07Z","author":[{"first_name":"Varun Maitreya","full_name":"Eranki, Varun Maitreya","last_name":"Eranki"}],"date_updated":"2024-07-05T12:37:40Z"},{"editor":[{"first_name":"Arnaud","last_name":"Casteigts","full_name":"Casteigts, Arnaud"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"}],"abstract":[{"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.","lang":"eng"}],"status":"public","type":"conference","publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)","keyword":["Programmable Matter","Shape Formation","3D Model","Finite Automaton"],"language":[{"iso":"eng"}],"_id":"54807","user_id":"55557","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"79"}],"year":"2024","place":"Dagstuhl, Germany","citation":{"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.","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>.","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)} }","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>","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>.","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>.","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>"},"intvolume":"       292","page":"15:1–15:20","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-315-7"]},"title":"Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures","doi":"10.4230/LIPIcs.SAND.2024.15","date_updated":"2024-07-18T09:32:49Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","author":[{"last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","id":"32229","first_name":"Kristian"},{"first_name":"David Jan","last_name":"Liedtke","id":"55557","full_name":"Liedtke, David Jan"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2024-06-18T07:45:34Z","volume":292},{"user_id":"55557","department":[{"_id":"79"}],"_id":"54802","language":[{"iso":"eng"}],"keyword":["Programmable Matter","Coating","Finite Automaton","3D"],"type":"book_chapter","publication":"Structural Information and Communication Complexity","status":"public","editor":[{"first_name":"Yuval","full_name":"Emek, Yuval","last_name":"Emek"}],"abstract":[{"lang":"eng","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."}],"author":[{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"last_name":"Liedtke","id":"55557","full_name":"Liedtke, David Jan","first_name":"David Jan"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2024-06-18T07:36:04Z","publisher":"Springer Nature Switzerland","date_updated":"2024-07-18T09:32:58Z","doi":"10.1007/978-3-031-60603-8_21","title":"Universal Coating by 3D Hybrid Programmable Matter","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031606021","9783031606038"]},"citation":{"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>","short":"I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: Y. Emek (Ed.), Structural Information and Communication Complexity, Springer Nature Switzerland, Cham, 2024.","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>.","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>","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.","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>."},"year":"2024","place":"Cham"}]