[{"type":"bachelorsthesis","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"62247","language":[{"iso":"eng"}],"citation":{"ama":"Werner F. <i>Monoton Erreichbarer Delaunaygraph</i>.; 2025.","chicago":"Werner, Felix. <i>Monoton Erreichbarer Delaunaygraph</i>, 2025.","ieee":"F. Werner, <i>Monoton erreichbarer Delaunaygraph</i>. 2025.","apa":"Werner, F. (2025). <i>Monoton erreichbarer Delaunaygraph</i>.","short":"F. Werner, Monoton Erreichbarer Delaunaygraph, 2025.","mla":"Werner, Felix. <i>Monoton Erreichbarer Delaunaygraph</i>. 2025.","bibtex":"@book{Werner_2025, title={Monoton erreichbarer Delaunaygraph}, author={Werner, Felix}, year={2025} }"},"year":"2025","author":[{"first_name":"Felix","full_name":"Werner, Felix","last_name":"Werner"}],"date_created":"2025-11-19T09:13:37Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2025-11-19T09:15:02Z","title":"Monoton erreichbarer Delaunaygraph"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"52318","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","year":"2024","citation":{"chicago":"Dorociak, Svitlana. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>, 2024.","ieee":"S. Dorociak, <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>. 2024.","ama":"Dorociak S. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>.; 2024.","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} }","apa":"Dorociak, S. (2024). <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>."},"title":"Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung","date_updated":"2024-03-05T12:53:25Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"first_name":"Svitlana","full_name":"Dorociak, Svitlana","last_name":"Dorociak"}],"date_created":"2024-03-05T12:52:59Z"},{"type":"mastersthesis","status":"public","citation":{"apa":"De Groote, C. (2024). <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>.","short":"C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes, 2024.","bibtex":"@book{De Groote_2024, title={A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes}, author={De Groote, Carsten}, year={2024} }","mla":"De Groote, Carsten. <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>. 2024.","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."},"year":"2024","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"full_name":"De Groote, Carsten","last_name":"De Groote","first_name":"Carsten"}],"date_created":"2024-04-09T11:35:20Z","_id":"53374","date_updated":"2024-04-09T11:35:41Z","language":[{"iso":"eng"}],"title":"A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes"},{"citation":{"bibtex":"@book{Doddegowda_2024, title={Optimal Drone Strategies For Packet Delivery}, author={Doddegowda, Rajesh}, year={2024} }","mla":"Doddegowda, Rajesh. <i>Optimal Drone Strategies For Packet Delivery</i>. 2024.","short":"R. Doddegowda, Optimal Drone Strategies For Packet Delivery, 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."},"year":"2024","title":"Optimal Drone Strategies For Packet Delivery","author":[{"last_name":"Doddegowda","full_name":"Doddegowda, Rajesh","first_name":"Rajesh"}],"date_created":"2024-04-09T11:31:47Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2024-04-09T11:32:20Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"53373"},{"author":[{"full_name":"Thakur, Heena","last_name":"Thakur","first_name":"Heena"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2024-04-09T11:28:39Z","date_updated":"2024-04-09T11:29:24Z","title":"Evaluating the Implications","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."},"year":"2024","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"53372","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"date_updated":"2024-07-03T13:11:26Z","_id":"55002","user_id":"15578","date_created":"2024-07-03T13:09:48Z","author":[{"full_name":"Delgado Steuter, Dominik","last_name":"Delgado Steuter","first_name":"Dominik"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"title":"Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads ","language":[{"iso":"eng"}],"type":"bachelorsthesis","year":"2024","citation":{"ama":"Delgado Steuter D. <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.","ieee":"D. Delgado Steuter, <i>Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads </i>. 2024.","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} }","apa":"Delgado Steuter, D. (2024). <i>Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads </i>."},"status":"public"},{"language":[{"iso":"eng"}],"_id":"55003","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"status":"public","type":"mastersthesis","title":"On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits","date_updated":"2024-07-03T14:02:14Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"first_name":"Matthias","last_name":"Artmann","full_name":"Artmann, Matthias"}],"date_created":"2024-07-03T14:01:54Z","year":"2024","citation":{"ama":"Artmann M. <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.","short":"M. Artmann, On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits, 2024.","mla":"Artmann, Matthias. <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>. 2024.","bibtex":"@book{Artmann_2024, title={On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits}, author={Artmann, Matthias}, year={2024} }","apa":"Artmann, M. (2024). <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>."}},{"year":"2024","citation":{"apa":"Eranki, V. M. (2024). <i>Fever: Optimal Responsive View Synchronisation</i>.","bibtex":"@book{Eranki_2024, title={Fever: Optimal Responsive View Synchronisation}, author={Eranki, Varun Maitreya}, year={2024} }","mla":"Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>. 2024.","short":"V.M. Eranki, Fever: Optimal Responsive View Synchronisation, 2024.","ama":"Eranki VM. <i>Fever: Optimal Responsive View Synchronisation</i>.; 2024.","ieee":"V. M. Eranki, <i>Fever: Optimal Responsive View Synchronisation</i>. 2024.","chicago":"Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>, 2024."},"date_updated":"2024-07-05T12:37:40Z","date_created":"2024-07-05T12:37:07Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"last_name":"Eranki","full_name":"Eranki, Varun Maitreya","first_name":"Varun Maitreya"}],"title":"Fever: Optimal Responsive View Synchronisation","type":"mastersthesis","status":"public","_id":"55092","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["978-3-95977-315-7"],"issn":["1868-8969"]},"year":"2024","place":"Dagstuhl, Germany","intvolume":"       292","page":"15:1–15:20","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,” 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>","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.","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>"},"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_updated":"2024-07-18T09:32:49Z","volume":292,"date_created":"2024-06-18T07:45:34Z","author":[{"first_name":"Kristian","id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal"},{"first_name":"David Jan","id":"55557","full_name":"Liedtke, David Jan","last_name":"Liedtke"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"title":"Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures","doi":"10.4230/LIPIcs.SAND.2024.15","publication":"3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)","type":"conference","editor":[{"full_name":"Casteigts, Arnaud","last_name":"Casteigts","first_name":"Arnaud"},{"full_name":"Kuhn, Fabian","last_name":"Kuhn","first_name":"Fabian"}],"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","_id":"54807","department":[{"_id":"79"}],"user_id":"55557","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","keyword":["Programmable Matter","Shape Formation","3D Model","Finite Automaton"],"language":[{"iso":"eng"}]},{"department":[{"_id":"79"}],"user_id":"55557","_id":"54802","language":[{"iso":"eng"}],"keyword":["Programmable Matter","Coating","Finite Automaton","3D"],"publication":"Structural Information and Communication Complexity","type":"book_chapter","status":"public","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"}],"editor":[{"first_name":"Yuval","full_name":"Emek, Yuval","last_name":"Emek"}],"author":[{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"last_name":"Liedtke","full_name":"Liedtke, David Jan","id":"55557","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_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031606021","9783031606038"]},"publication_status":"published","citation":{"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} }","short":"I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: Y. Emek (Ed.), Structural Information and Communication Complexity, Springer Nature Switzerland, Cham, 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>.","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.","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>.","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>"},"year":"2024","place":"Cham"},{"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"64104","language":[{"iso":"eng"}],"type":"conference","status":"public","author":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Kristian ","full_name":"Hinnenthal , Kristian ","last_name":"Hinnenthal "},{"last_name":"Liedtke","full_name":"Liedtke, David Jan","id":"55557","first_name":"David Jan"}],"date_created":"2026-02-10T10:12:18Z","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","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.","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.","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>.","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.","short":"C. Scheideler, K. Hinnenthal , D.J. Liedtke, in: CoRR abs/2401.17734 (2024), 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} }"},"year":"2024","place":"CoRR abs/2401.17734 (2024)"},{"title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Andreas","last_name":"Padalkin","full_name":"Padalkin, Andreas","id":"88238"}],"date_created":"2026-02-10T10:06:36Z","date_updated":"2026-02-11T09:11:58Z","citation":{"ama":"Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . In: ; 2024: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.","ieee":"C. Scheideler and A. Padalkin, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 2024, pp. 65–75.","mla":"Scheideler, Christian, and Andreas Padalkin. <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 2024, pp. 65–75.","bibtex":"@inproceedings{Scheideler_Padalkin_2024, place={PODC 2024: 65-75}, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. }, author={Scheideler, Christian and Padalkin, Andreas}, year={2024}, pages={65–75} }","short":"C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.","apa":"Scheideler, C., &#38; Padalkin, A. (2024). <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 65–75."},"page":"65 - 75","place":"PODC 2024: 65-75","year":"2024","language":[{"iso":"eng"}],"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"64103","status":"public","type":"conference"},{"type":"conference","status":"public","_id":"64106","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"language":[{"iso":"eng"}],"place":"SIROCCO 2024: 384-401","year":"2024","citation":{"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.","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} }","chicago":"Scheideler, Christian, Irina  Kostitsyna, and David Jan Liedtke. “Universal Coating by 3D Hybrid Programmable Matter.” SIROCCO 2024: 384-401, 2024.","ieee":"C. Scheideler, I. Kostitsyna, and D. J. Liedtke, “Universal Coating by 3D Hybrid Programmable Matter.,” 2024.","ama":"Scheideler C, Kostitsyna I, Liedtke DJ. Universal Coating by 3D Hybrid Programmable Matter. In: ; 2024."},"date_updated":"2026-02-11T09:12:11Z","date_created":"2026-02-10T10:21:39Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina ","first_name":"Irina "},{"last_name":"Liedtke","full_name":"Liedtke, David Jan","id":"55557","first_name":"David Jan"}],"title":"Universal Coating by 3D Hybrid Programmable Matter."},{"title":"The structural power of reconfigurable circuits in the amoebot model. ","date_updated":"2026-02-11T09:13:04Z","date_created":"2026-02-10T09:56:23Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Andreas","id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin"},{"first_name":"Daniel","full_name":"Warner, Daniel","id":"3902","last_name":"Warner"}],"year":"2024","citation":{"apa":"Scheideler, C., Padalkin, A., &#38; Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. . <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 603–625.","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.","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.","bibtex":"@article{Scheideler_Padalkin_Warner_2024, title={The structural power of reconfigurable circuits in the amoebot model. }, journal={The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)}, author={Scheideler, Christian and Padalkin, Andreas and Warner, Daniel}, year={2024}, pages={603–625} }","ama":"Scheideler C, Padalkin A, Warner D. The structural power of reconfigurable circuits in the amoebot model. . <i>The structural power of reconfigurable circuits in the amoebot model Nat Comput 23(4): 603-625 (2024)</i>. Published online 2024:603-625.","chicago":"Scheideler, Christian, Andreas Padalkin, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model. .” <i>The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024)</i>, 2024, 603–25.","ieee":"C. Scheideler, A. Padalkin, and D. Warner, “The structural power of reconfigurable circuits in the amoebot model. ,” <i>The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)</i>, pp. 603–625, 2024."},"page":"603 - 625","language":[{"iso":"eng"}],"_id":"64100","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"status":"public","type":"journal_article","publication":"The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)"},{"language":[{"iso":"eng"}],"_id":"64101","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","status":"public","publication":"Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)","type":"journal_article","title":"Routing schemes for hybrid communication networks. ","date_updated":"2026-02-11T09:12:57Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Sam ","full_name":"Coy, Sam ","last_name":"Coy"},{"first_name":"Arthur ","last_name":"Czumaj","full_name":"Czumaj, Arthur "},{"last_name":"Schneider","full_name":"Schneider, Philipp ","first_name":"Philipp "},{"full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann","first_name":"Julian"}],"date_created":"2026-02-10T10:00:43Z","year":"2024","citation":{"short":"C. Scheideler, S. Coy, A. Czumaj, P. Schneider, J. Werthmann, Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024) (2024).","mla":"Scheideler, Christian, et al. “Routing Schemes for Hybrid Communication Networks. .” <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","bibtex":"@article{Scheideler_Coy_Czumaj_Schneider_Werthmann_2024, title={Routing schemes for hybrid communication networks. }, journal={Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)}, author={Scheideler, Christian and Coy, Sam  and Czumaj, Arthur  and Schneider, Philipp  and Werthmann, Julian}, year={2024} }","apa":"Scheideler, C., Coy, S., Czumaj, A., Schneider, P., &#38; Werthmann, J. (2024). Routing schemes for hybrid communication networks. . <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>.","ieee":"C. Scheideler, S. Coy, A. Czumaj, P. Schneider, and J. Werthmann, “Routing schemes for hybrid communication networks. ,” <i>Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","chicago":"Scheideler, Christian, Sam  Coy, Arthur  Czumaj, Philipp  Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks. .” <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","ama":"Scheideler C, Coy S, Czumaj A, Schneider P, Werthmann J. Routing schemes for hybrid communication networks. . <i>Routing schemes for hybrid communication networks Theor Comput Sci 985: 114352 (2024)</i>. Published online 2024."}},{"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"64102","language":[{"iso":"eng"}],"type":"conference","status":"public","date_created":"2026-02-10T10:04:11Z","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"}],"date_updated":"2026-02-11T09:12:28Z","publisher":"ApPLIED@PODC 2024","title":"Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. ","citation":{"mla":"Scheideler, Christian, and Jinfeng Dou. <i>Invited Paper: Blockchains Made Lightweight: A Median Rule for State Machine Replication. </i>. ApPLIED@PODC 2024, 2024.","short":"C. Scheideler, J. Dou, in: ApPLIED@PODC 2024, 2024.","bibtex":"@inproceedings{Scheideler_Dou_2024, title={Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. }, publisher={ApPLIED@PODC 2024}, author={Scheideler, Christian and Dou, Jinfeng}, year={2024} }","apa":"Scheideler, C., &#38; Dou, J. (2024). <i>Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. </i>.","ama":"Scheideler C, Dou J. Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. . In: ApPLIED@PODC 2024; 2024.","ieee":"C. Scheideler and J. Dou, “Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. ,” 2024.","chicago":"Scheideler, Christian, and Jinfeng Dou. “Invited Paper: Blockchains Made Lightweight: A Median Rule for State Machine Replication. .” ApPLIED@PODC 2024, 2024."},"year":"2024"},{"status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"64105","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"place":"SAND 2024: 18:1-18:20","year":"2024","citation":{"ieee":"C. Scheideler, A. Padalkin, and M. Kumar , “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ,” 2024.","chicago":"Scheideler, Christian, Andreas Padalkin, and Manish  Kumar . “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. .” SAND 2024: 18:1-18:20, 2024.","ama":"Scheideler C, Padalkin A, Kumar  M. Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. . In: ; 2024.","bibtex":"@inproceedings{Scheideler_Padalkin_Kumar _2024, place={SAND 2024: 18:1-18:20}, title={Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. }, author={Scheideler, Christian and Padalkin, Andreas and Kumar , Manish }, year={2024} }","mla":"Scheideler, Christian, et al. <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>. 2024.","short":"C. Scheideler, A. Padalkin, M. Kumar , in: SAND 2024: 18:1-18:20, 2024.","apa":"Scheideler, C., Padalkin, A., &#38; Kumar , M. (2024). <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. </i>."},"title":"Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. ","date_updated":"2026-02-11T09:12:18Z","author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin","first_name":"Andreas"},{"full_name":"Kumar , Manish ","last_name":"Kumar ","first_name":"Manish "}],"date_created":"2026-02-10T10:15:08Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"57319","status":"public","type":"mastersthesis","title":"Hexagon Shape Formation in the Amoebot Model with Immobilized Particles","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Roja","last_name":"Raj","full_name":"Raj, Roja"}],"date_created":"2024-11-22T09:18:01Z","date_updated":"2024-11-22T09:19:25Z","citation":{"ama":"Raj R. <i>Hexagon Shape Formation in the Amoebot Model with Immobilized Particles</i>.; 2024.","ieee":"R. Raj, <i>Hexagon Shape Formation in the Amoebot Model with Immobilized Particles</i>. 2024.","chicago":"Raj, Roja. <i>Hexagon Shape Formation in the Amoebot Model with Immobilized Particles</i>, 2024.","short":"R. Raj, Hexagon Shape Formation in the Amoebot Model with Immobilized Particles, 2024.","bibtex":"@book{Raj_2024, title={Hexagon Shape Formation in the Amoebot Model with Immobilized Particles}, author={Raj, Roja}, year={2024} }","mla":"Raj, Roja. <i>Hexagon Shape Formation in the Amoebot Model with Immobilized Particles</i>. 2024.","apa":"Raj, R. (2024). <i>Hexagon Shape Formation in the Amoebot Model with Immobilized Particles</i>."},"year":"2024"},{"_id":"61172","project":[{"_id":"5","name":"SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen"}],"department":[{"_id":"79"}],"user_id":"50024","article_number":"114352","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","type":"journal_article","status":"public","date_updated":"2025-09-10T14:52:21Z","publisher":"Elsevier BV","volume":985,"author":[{"full_name":"Coy, Sam","last_name":"Coy","first_name":"Sam"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Philipp","last_name":"Schneider","full_name":"Schneider, Philipp"},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"date_created":"2025-09-10T14:26:11Z","title":"Routing Schemes for Hybrid Communication Networks","doi":"10.1016/j.tcs.2023.114352","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","year":"2024","intvolume":"       985","citation":{"short":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical Computer Science 985 (2024).","mla":"Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","bibtex":"@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>}, number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}, year={2024} }","apa":"Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024). Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>, <i>985</i>, Article 114352. <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>","ama":"Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>. 2024;985. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>","chicago":"Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i> 985 (2024). <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>.","ieee":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>, vol. 985, Art. no. 114352, 2024, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>."}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","_id":"49494","citation":{"chicago":"Nickel, Alexander. <i>Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames</i>, 2023.","ieee":"A. Nickel, <i>Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames</i>. 2023.","ama":"Nickel A. <i>Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames</i>.; 2023.","apa":"Nickel, A. (2023). <i>Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames</i>.","mla":"Nickel, Alexander. <i>Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames</i>. 2023.","short":"A. Nickel, Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.","bibtex":"@book{Nickel_2023, title={Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames}, author={Nickel, Alexander}, year={2023} }"},"year":"2023","title":"Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames","date_created":"2023-12-05T15:22:55Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"}],"author":[{"first_name":"Alexander","full_name":"Nickel, Alexander","last_name":"Nickel"}],"date_updated":"2023-12-05T15:23:12Z"}]