--- _id: '62285' abstract: - lang: eng 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.' author: - first_name: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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. Stabilization, Safety, and Security of Distributed Systems. Springer Nature Switzerland; 2025:325-342. doi:10.1007/978-3-032-11127-2_26' apa: 'Kostitsyna, I., Liedtke, D. J., & Scheideler, C. (2025). Invited Paper: Distributed Rhombus Formation of Sliding Squares. In S. Bonomi, P. S. Mandal, P. Robinson, G. Sharma, & S. Tixeuil (Eds.), Stabilization, Safety, and Security of Distributed Systems (pp. 325–342). Springer Nature Switzerland. https://doi.org/10.1007/978-3-032-11127-2_26' bibtex: '@inproceedings{Kostitsyna_Liedtke_Scheideler_2025, place={Cham}, title={Invited Paper: Distributed Rhombus Formation of Sliding Squares}, DOI={10.1007/978-3-032-11127-2_26}, 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 Stabilization, Safety, and Security of Distributed Systems, edited by Silvia Bonomi, Partha Sarathi Mandal, Peter Robinson, Gokarna Sharma, and Sebastien Tixeuil, 325–42. Cham: Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-032-11127-2_26.' ieee: 'I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Invited Paper: Distributed Rhombus Formation of Sliding Squares,” in Stabilization, Safety, and Security of Distributed Systems, Kathmandu, 2025, pp. 325–342, doi: 10.1007/978-3-032-11127-2_26.' mla: 'Kostitsyna, Irina, et al. “Invited Paper: Distributed Rhombus Formation of Sliding Squares.” Stabilization, Safety, and Security of Distributed Systems, edited by Silvia Bonomi et al., Springer Nature Switzerland, 2025, pp. 325–42, doi:10.1007/978-3-032-11127-2_26.' 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.' 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 date_created: 2025-11-23T21:07:12Z date_updated: 2026-02-11T08:31:14Z department: - _id: '79' doi: 10.1007/978-3-032-11127-2_26 editor: - first_name: Silvia full_name: Bonomi, Silvia last_name: Bonomi - first_name: Partha Sarathi full_name: Mandal, Partha Sarathi last_name: Mandal - first_name: Peter full_name: Robinson, Peter last_name: Robinson - first_name: Gokarna full_name: Sharma, Gokarna last_name: Sharma - first_name: Sebastien full_name: Tixeuil, Sebastien last_name: Tixeuil language: - iso: eng page: 325-342 place: Cham publication: Stabilization, Safety, and Security of Distributed Systems publication_identifier: isbn: - '9783032111265' - '9783032111272' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: 'Invited Paper: Distributed Rhombus Formation of Sliding Squares' type: conference user_id: '15578' year: '2025' ... --- _id: '64098' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Manish full_name: Kumar, Manish last_name: Kumar citation: ama: 'Scheideler C, Padalkin A, Kumar M. Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025). Reconfiguration and locomotion with joint movements in the amoebot model Auton Robots 49(3): 22 (2025). Published online 2025.' apa: 'Scheideler, C., Padalkin, A., & Kumar, M. (2025). Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025). Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (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} }' chicago: 'Scheideler, Christian, Andreas Padalkin, and Manish Kumar. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025).” Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025), 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),” Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025), 2025.' mla: 'Scheideler, Christian, et al. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025).” Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025), 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).' date_created: 2026-02-10T09:41:12Z date_updated: 2026-02-11T09:11:49Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng publication: 'Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)' status: public title: 'Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)' type: journal_article user_id: '15578' year: '2025' ... --- _id: '64094' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Matthias full_name: Artmann, Matthias id: '63743' last_name: Artmann - first_name: 'Tobias ' full_name: 'Maurer, Tobias ' last_name: Maurer - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Daniel full_name: Warner, Daniel id: '3902' last_name: Warner 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.' apa: 'Scheideler, C., Artmann, M., Maurer, T., Padalkin, A., & Warner, D. (2025). AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). .' 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} }' 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.' mla: 'Scheideler, Christian, et al. AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). . 2025.' short: 'C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, D. Warner, in: SoCG 2025: 81:1-81:5, 2025.' date_created: 2026-02-10T09:01:15Z date_updated: 2026-02-11T09:11:42Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng place: 'SoCG 2025: 81:1-81:5' status: public title: 'AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ' type: conference user_id: '15578' year: '2025' ... --- _id: '64096' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Jinfeng full_name: Dou, Jinfeng id: '92888' last_name: Dou - first_name: 'Thorsten ' full_name: 'Götte, Thorsten ' last_name: Götte - first_name: Henning full_name: Hillebrandt, Henning id: '74425' last_name: Hillebrandt - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: 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.' apa: Scheideler, C., Dou, J., Götte, T., Hillebrandt, H., & Werthmann, J. (2025). Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. . 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} }' 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.' 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. mla: Scheideler, Christian, et al. Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. . 2025. short: 'C. Scheideler, J. Dou, T. Götte, H. Hillebrandt, J. Werthmann, in: ITCS 2025: 45:1-45:26, 2025.' date_created: 2026-02-10T09:10:14Z date_updated: 2026-02-11T09:11:29Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng place: 'ITCS 2025: 45:1-45:26' status: public title: 'Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. ' type: conference user_id: '15578' year: '2025' ... --- _id: '64099' citation: ama: Scheideler C, Meeks K, eds. 4th Symposium on Algorithmic Foundations of Dynamic Networks.; 2025. apa: Scheideler, C., & Meeks, K. (Eds.). (2025). 4th Symposium on Algorithmic Foundations of Dynamic Networks. 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} }' chicago: Scheideler, Christian, and Kitty 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., 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. mla: Scheideler, Christian, and Kitty Meeks, editors. 4th Symposium on Algorithmic Foundations of Dynamic Networks. 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. date_created: 2026-02-10T09:49:03Z date_updated: 2026-02-11T09:11:09Z department: - _id: '34' - _id: '7' - _id: '79' editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Kitty full_name: Meeks, Kitty last_name: Meeks language: - iso: eng place: SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik publication_identifier: unknown: - ISBN 978-3-95977-368-3 status: public title: 4th Symposium on Algorithmic Foundations of Dynamic Networks. type: book_editor user_id: '15578' year: '2025' ... --- _id: '64097' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Matthias full_name: Artmann, Matthias id: '63743' last_name: Artmann - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin citation: ama: 'Scheideler C, Artmann M, Padalkin A. On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. . In: ; 2025.' apa: Scheideler, C., Artmann, M., & Padalkin, A. (2025). On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. . 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} }' chicago: 'Scheideler, Christian, Matthias Artmann, and Andreas Padalkin. “On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. .” DISC 2025: 7:1-7:22, 2025.' ieee: C. Scheideler, M. Artmann, and A. Padalkin, “On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ,” 2025. mla: Scheideler, Christian, et al. On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. . 2025. short: 'C. Scheideler, M. Artmann, A. Padalkin, in: DISC 2025: 7:1-7:22, 2025.' date_created: 2026-02-10T09:17:54Z date_updated: 2026-02-11T09:11:19Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng place: 'DISC 2025: 7:1-7:22' status: public title: 'On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ' type: conference user_id: '15578' year: '2025' ... --- _id: '64095' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: 'John ' full_name: 'Augustine , John ' last_name: 'Augustine ' - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Scheideler C, Augustine J, Werthmann J. Supervised Distributed Computing. . In: ; 2025.' apa: Scheideler, C., Augustine , J., & Werthmann, J. (2025). Supervised Distributed Computing. . 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.' ieee: C. Scheideler, J. Augustine , and J. Werthmann, “Supervised Distributed Computing. ,” 2025. mla: Scheideler, Christian, et al. Supervised Distributed Computing. . 2025. short: 'C. Scheideler, J. Augustine , J. Werthmann, in: Euro-Par (3) 2025: 48-62, 2025.' date_created: 2026-02-10T09:04:56Z date_updated: 2026-02-11T09:11:35Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng place: 'Euro-Par (3) 2025: 48-62' status: public title: 'Supervised Distributed Computing. ' type: conference user_id: '15578' year: '2025' ... --- _id: '61184' author: - first_name: John full_name: Augustine, John last_name: Augustine - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Augustine J, Scheideler C, Werthmann J. Supervised Distributed Computing. In: Lecture Notes in Computer Science. Springer Nature Switzerland; 2025. doi:10.1007/978-3-031-99872-0_4' apa: Augustine, J., Scheideler, C., & Werthmann, J. (2025). Supervised Distributed Computing. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-031-99872-0_4 bibtex: '@inproceedings{Augustine_Scheideler_Werthmann_2025, place={Cham}, title={Supervised Distributed Computing}, DOI={10.1007/978-3-031-99872-0_4}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Augustine, John and Scheideler, Christian and Werthmann, Julian}, year={2025} }' chicago: 'Augustine, John, Christian Scheideler, and Julian Werthmann. “Supervised Distributed Computing.” In Lecture Notes in Computer Science. Cham: Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-99872-0_4.' ieee: 'J. Augustine, C. Scheideler, and J. Werthmann, “Supervised Distributed Computing,” 2025, doi: 10.1007/978-3-031-99872-0_4.' mla: Augustine, John, et al. “Supervised Distributed Computing.” Lecture Notes in Computer Science, Springer Nature Switzerland, 2025, doi:10.1007/978-3-031-99872-0_4. short: 'J. Augustine, C. Scheideler, J. Werthmann, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.' date_created: 2025-09-11T08:30:57Z date_updated: 2025-09-11T08:33:27Z doi: 10.1007/978-3-031-99872-0_4 language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783031998713' - '9783031998720' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: Supervised Distributed Computing type: conference user_id: '50024' year: '2025' ... --- _id: '59268' author: - first_name: Jinfeng full_name: Dou, Jinfeng id: '92888' last_name: Dou - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Henning full_name: Hillebrandt, Henning id: '74425' last_name: Hillebrandt - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: 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. 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Vol 325. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2025:45:1–45:26. doi:10.4230/LIPIcs.ITCS.2025.45' apa: Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2025). Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science Conference (ITCS 2025) (Vol. 325, p. 45:1–45:26). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.45 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={10.4230/LIPIcs.ITCS.2025.45}, 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)} }' 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 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), 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. https://doi.org/10.4230/LIPIcs.ITCS.2025.45.' 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 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), 2025, vol. 325, p. 45:1–45:26, doi: 10.4230/LIPIcs.ITCS.2025.45.' mla: Dou, Jinfeng, et al. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs.” 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), edited by Raghu Meka, vol. 325, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, p. 45:1–45:26, doi:10.4230/LIPIcs.ITCS.2025.45. 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.' date_created: 2025-04-02T14:09:19Z date_updated: 2025-10-15T12:57:11Z doi: 10.4230/LIPIcs.ITCS.2025.45 editor: - first_name: Raghu full_name: Meka, Raghu last_name: Meka intvolume: ' 325' language: - iso: eng page: 45:1–45:26 place: Dagstuhl, Germany publication: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025) publication_identifier: isbn: - 978-3-95977-361-4 issn: - 1868-8969 publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs type: conference user_id: '34727' volume: 325 year: '2025' ... --- _id: '62051' article_number: '115552' author: - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Hinnenthal K, Liedtke DJ, Scheideler C. Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures. Theoretical Computer Science. 2025;1057. doi:10.1016/j.tcs.2025.115552' apa: 'Hinnenthal, K., Liedtke, D. J., & Scheideler, C. (2025). Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures. Theoretical Computer Science, 1057, Article 115552. https://doi.org/10.1016/j.tcs.2025.115552' 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={10.1016/j.tcs.2025.115552}, number={115552}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian}, year={2025} }' chicago: 'Hinnenthal, Kristian, David Jan Liedtke, and Christian Scheideler. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” Theoretical Computer Science 1057 (2025). https://doi.org/10.1016/j.tcs.2025.115552.' ieee: 'K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures,” Theoretical Computer Science, vol. 1057, Art. no. 115552, 2025, doi: 10.1016/j.tcs.2025.115552.' mla: 'Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” Theoretical Computer Science, vol. 1057, 115552, Elsevier BV, 2025, doi:10.1016/j.tcs.2025.115552.' short: K. Hinnenthal, D.J. Liedtke, C. Scheideler, Theoretical Computer Science 1057 (2025). date_created: 2025-11-03T10:19:53Z date_updated: 2025-11-03T10:21:52Z department: - _id: '79' doi: 10.1016/j.tcs.2025.115552 intvolume: ' 1057' language: - iso: eng publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published publisher: Elsevier BV status: public title: 'Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures' type: journal_article user_id: '55557' volume: 1057 year: '2025' ... --- _id: '54807' 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 \U0001D4AA(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." author: - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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. 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024). Vol 292. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2024:15:1–15:20. doi:10.4230/LIPIcs.SAND.2024.15' apa: 'Hinnenthal, K., Liedtke, D. J., & Scheideler, C. (2024). Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. In A. Casteigts & F. Kuhn (Eds.), 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024) (Vol. 292, p. 15:1–15:20). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2024.15' 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={10.4230/LIPIcs.SAND.2024.15}, 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)} }' 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 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), 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. https://doi.org/10.4230/LIPIcs.SAND.2024.15.' 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 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), 2024, vol. 292, p. 15:1–15:20, doi: 10.4230/LIPIcs.SAND.2024.15.' mla: 'Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), edited by Arnaud Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024, p. 15:1–15:20, doi:10.4230/LIPIcs.SAND.2024.15.' 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.' date_created: 2024-06-18T07:45:34Z date_updated: 2024-07-18T09:32:49Z department: - _id: '79' doi: 10.4230/LIPIcs.SAND.2024.15 editor: - first_name: Arnaud full_name: Casteigts, Arnaud last_name: Casteigts - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn intvolume: ' 292' keyword: - Programmable Matter - Shape Formation - 3D Model - Finite Automaton language: - iso: eng page: 15:1–15:20 place: Dagstuhl, Germany publication: 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024) publication_identifier: isbn: - 978-3-95977-315-7 issn: - 1868-8969 publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures' type: conference user_id: '55557' volume: 292 year: '2024' ... --- _id: '54802' 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 full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kostitsyna I, Liedtke DJ, Scheideler C. Universal Coating by 3D Hybrid Programmable Matter. In: Emek Y, ed. Structural Information and Communication Complexity. Springer Nature Switzerland; 2024. doi:10.1007/978-3-031-60603-8_21' apa: Kostitsyna, I., Liedtke, D. J., & Scheideler, C. (2024). Universal Coating by 3D Hybrid Programmable Matter. In Y. Emek (Ed.), Structural Information and Communication Complexity. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-60603-8_21 bibtex: '@inbook{Kostitsyna_Liedtke_Scheideler_2024, place={Cham}, title={Universal Coating by 3D Hybrid Programmable Matter}, DOI={10.1007/978-3-031-60603-8_21}, 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} }' chicago: 'Kostitsyna, Irina, David Jan Liedtke, and Christian Scheideler. “Universal Coating by 3D Hybrid Programmable Matter.” In Structural Information and Communication Complexity, edited by Yuval Emek. Cham: Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-60603-8_21.' ieee: 'I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Universal Coating by 3D Hybrid Programmable Matter,” in Structural Information and Communication Complexity, Y. Emek, Ed. Cham: Springer Nature Switzerland, 2024.' mla: Kostitsyna, Irina, et al. “Universal Coating by 3D Hybrid Programmable Matter.” Structural Information and Communication Complexity, edited by Yuval Emek, Springer Nature Switzerland, 2024, doi:10.1007/978-3-031-60603-8_21. short: 'I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: Y. Emek (Ed.), Structural Information and Communication Complexity, Springer Nature Switzerland, Cham, 2024.' date_created: 2024-06-18T07:36:04Z date_updated: 2024-07-18T09:32:58Z department: - _id: '79' doi: 10.1007/978-3-031-60603-8_21 editor: - first_name: Yuval full_name: Emek, Yuval last_name: Emek keyword: - Programmable Matter - Coating - Finite Automaton - 3D language: - iso: eng place: Cham publication: Structural Information and Communication Complexity publication_identifier: isbn: - '9783031606021' - '9783031606038' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature Switzerland status: public title: Universal Coating by 3D Hybrid Programmable Matter type: book_chapter user_id: '55557' year: '2024' ... --- _id: '55379' abstract: - lang: eng text: 'AbstractThe amoebot model (Derakhshandeh et al. in: SPAA ACM, pp 220–222. https://doi.org/10.1145/2612669.2612712, 2014) has been proposed as a model for programmable matter consisting of tiny, robotic elements called amoebots. We consider the reconfigurable circuit extension (Feldmann et al. in J Comput Biol 29(4):317–343. https://doi.org/10.1089/cmb.2021.0363, 2022) of the geometric amoebot model that allows the amoebot structure to interconnect amoebots by so-called circuits. 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 stripe computation problem where, given any connected amoebot structure S, an amoebot u in S, and some axis X, all amoebots belonging to axis X through u have to be identified. Second, we consider the global maximum problem, 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 skeleton problem, 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.' author: - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Daniel full_name: Warner, Daniel id: '3902' last_name: Warner citation: ama: Padalkin A, Scheideler C, Warner D. The structural power of reconfigurable circuits in the amoebot model. Natural Computing. Published online 2024. doi:10.1007/s11047-024-09981-6 apa: Padalkin, A., Scheideler, C., & Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. Natural Computing. https://doi.org/10.1007/s11047-024-09981-6 bibtex: '@article{Padalkin_Scheideler_Warner_2024, title={The structural power of reconfigurable circuits in the amoebot model}, DOI={10.1007/s11047-024-09981-6}, journal={Natural Computing}, publisher={Springer Science and Business Media LLC}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, year={2024} }' chicago: Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” Natural Computing, 2024. https://doi.org/10.1007/s11047-024-09981-6. ieee: 'A. Padalkin, C. Scheideler, and D. Warner, “The structural power of reconfigurable circuits in the amoebot model,” Natural Computing, 2024, doi: 10.1007/s11047-024-09981-6.' mla: Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” Natural Computing, Springer Science and Business Media LLC, 2024, doi:10.1007/s11047-024-09981-6. short: A. Padalkin, C. Scheideler, D. Warner, Natural Computing (2024). date_created: 2024-07-24T14:28:27Z date_updated: 2024-07-24T14:28:43Z doi: 10.1007/s11047-024-09981-6 language: - iso: eng publication: Natural Computing publication_identifier: issn: - 1567-7818 - 1572-9796 publication_status: published publisher: Springer Science and Business Media LLC status: public title: The structural power of reconfigurable circuits in the amoebot model type: journal_article user_id: '88238' year: '2024' ... --- _id: '55376' author: - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Manish full_name: Kumar, Manish last_name: Kumar - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Padalkin A, Kumar M, Scheideler C. Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. In: Casteigts A, Kuhn F, eds. 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece. Vol 292. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:18:1–18:20. doi:10.4230/LIPICS.SAND.2024.18' apa: Padalkin, A., Kumar, M., & Scheideler, C. (2024). Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. In A. Casteigts & F. Kuhn (Eds.), 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece (Vol. 292, p. 18:1–18:20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SAND.2024.18 bibtex: '@inproceedings{Padalkin_Kumar_Scheideler_2024, series={LIPIcs}, title={Reconfiguration and Locomotion with Joint Movements in the Amoebot Model}, volume={292}, DOI={10.4230/LIPICS.SAND.2024.18}, 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} }' chicago: Padalkin, Andreas, Manish Kumar, and Christian Scheideler. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model.” In 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece, edited by Arnaud Casteigts and Fabian Kuhn, 292:18:1–18:20. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPICS.SAND.2024.18. ieee: 'A. Padalkin, M. Kumar, and C. Scheideler, “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model,” in 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece, 2024, vol. 292, p. 18:1–18:20, doi: 10.4230/LIPICS.SAND.2024.18.' mla: Padalkin, Andreas, et al. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model.” 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece, edited by Arnaud Casteigts and Fabian Kuhn, vol. 292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 18:1–18:20, doi:10.4230/LIPICS.SAND.2024.18. 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.' date_created: 2024-07-24T14:25:07Z date_updated: 2024-07-24T14:25:46Z doi: 10.4230/LIPICS.SAND.2024.18 editor: - first_name: Arnaud full_name: Casteigts, Arnaud last_name: Casteigts - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn intvolume: ' 292' language: - iso: eng page: 18:1–18:20 publication: 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: Reconfiguration and Locomotion with Joint Movements in the Amoebot Model type: conference user_id: '88238' volume: 292 year: '2024' ... --- _id: '55377' author: - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Padalkin A, Scheideler C. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. ACM; 2024. doi:10.1145/3662158.3662776' apa: Padalkin, A., & Scheideler, C. (2024). Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. https://doi.org/10.1145/3662158.3662776 bibtex: '@inproceedings{Padalkin_Scheideler_2024, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter}, DOI={10.1145/3662158.3662776}, booktitle={Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing}, publisher={ACM}, author={Padalkin, Andreas and Scheideler, Christian}, year={2024} }' chicago: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” In Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. ACM, 2024. https://doi.org/10.1145/3662158.3662776. ieee: 'A. Padalkin and C. Scheideler, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter,” 2024, doi: 10.1145/3662158.3662776.' mla: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024, doi:10.1145/3662158.3662776. short: 'A. Padalkin, C. Scheideler, in: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024.' date_created: 2024-07-24T14:26:10Z date_updated: 2024-07-24T14:26:23Z doi: 10.1145/3662158.3662776 language: - iso: eng publication: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing publication_status: published publisher: ACM status: public title: Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter type: conference user_id: '88238' year: '2024' ... --- _id: '64104' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: 'Kristian ' full_name: 'Hinnenthal , Kristian ' last_name: 'Hinnenthal ' - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke citation: 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., & Liedtke, D. J. (2024). Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20.' 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} }' 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.' mla: 'Scheideler, Christian, et al. Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20. 2024.' short: 'C. Scheideler, K. Hinnenthal , D.J. Liedtke, in: CoRR abs/2401.17734 (2024), 2024.' date_created: 2026-02-10T10:12:18Z date_updated: 2026-02-11T09:12:05Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng place: CoRR abs/2401.17734 (2024) status: public title: 'Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20' type: conference user_id: '15578' year: '2024' ... --- _id: '64103' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin citation: ama: 'Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . In: ; 2024:65-75.' apa: Scheideler, C., & Padalkin, A. (2024). Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . 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} }' 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. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . 2024, pp. 65–75. short: 'C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75.' date_created: 2026-02-10T10:06:36Z date_updated: 2026-02-11T09:11:58Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng page: 65 - 75 place: 'PODC 2024: 65-75' status: public title: 'Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ' type: conference user_id: '15578' year: '2024' ... --- _id: '64106' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: 'Irina ' full_name: 'Kostitsyna, Irina ' last_name: Kostitsyna - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke citation: ama: 'Scheideler C, Kostitsyna I, Liedtke DJ. Universal Coating by 3D Hybrid Programmable Matter. In: ; 2024.' apa: Scheideler, C., Kostitsyna, I., & Liedtke, D. J. (2024). Universal Coating by 3D Hybrid Programmable Matter. 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. mla: Scheideler, Christian, et al. Universal Coating by 3D Hybrid Programmable Matter. 2024. short: 'C. Scheideler, I. Kostitsyna, D.J. Liedtke, in: SIROCCO 2024: 384-401, 2024.' date_created: 2026-02-10T10:21:39Z date_updated: 2026-02-11T09:12:11Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng place: 'SIROCCO 2024: 384-401' status: public title: Universal Coating by 3D Hybrid Programmable Matter. type: conference user_id: '15578' year: '2024' ... --- _id: '64100' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Andreas full_name: Padalkin, Andreas id: '88238' last_name: Padalkin - first_name: Daniel full_name: Warner, Daniel id: '3902' last_name: Warner citation: ama: 'Scheideler C, Padalkin A, Warner D. The structural power of reconfigurable circuits in the amoebot model. . The structural power of reconfigurable circuits in the amoebot model Nat Comput 23(4): 603-625 (2024). Published online 2024:603-625.' apa: 'Scheideler, C., Padalkin, A., & Warner, D. (2024). The structural power of reconfigurable circuits in the amoebot model. . The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (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} }' chicago: 'Scheideler, Christian, Andreas Padalkin, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model. .” The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024), 2024, 603–25.' ieee: 'C. Scheideler, A. Padalkin, and D. Warner, “The structural power of reconfigurable circuits in the amoebot model. ,” The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024), pp. 603–625, 2024.' mla: 'Scheideler, Christian, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model. .” The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024), 2024, pp. 603–25.' short: 'C. Scheideler, A. Padalkin, D. Warner, The Structural Power of Reconfigurable Circuits in the Amoebot Model. Nat. Comput. 23(4): 603-625 (2024) (2024) 603–625.' date_created: 2026-02-10T09:56:23Z date_updated: 2026-02-11T09:13:04Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng page: 603 - 625 publication: 'The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)' status: public title: 'The structural power of reconfigurable circuits in the amoebot model. ' type: journal_article user_id: '15578' year: '2024' ... --- _id: '64101' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: 'Sam ' full_name: 'Coy, Sam ' last_name: Coy - first_name: 'Arthur ' full_name: 'Czumaj, Arthur ' last_name: Czumaj - first_name: 'Philipp ' full_name: 'Schneider, Philipp ' last_name: Schneider - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Scheideler C, Coy S, Czumaj A, Schneider P, Werthmann J. Routing schemes for hybrid communication networks. . Routing schemes for hybrid communication networks Theor Comput Sci 985: 114352 (2024). Published online 2024.' apa: 'Scheideler, C., Coy, S., Czumaj, A., Schneider, P., & Werthmann, J. (2024). Routing schemes for hybrid communication networks. . Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (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} }' chicago: 'Scheideler, Christian, Sam Coy, Arthur Czumaj, Philipp Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks. .” Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024), 2024.' ieee: 'C. Scheideler, S. Coy, A. Czumaj, P. Schneider, and J. Werthmann, “Routing schemes for hybrid communication networks. ,” Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024), 2024.' mla: 'Scheideler, Christian, et al. “Routing Schemes for Hybrid Communication Networks. .” Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024), 2024.' short: 'C. Scheideler, S. Coy, A. Czumaj, P. Schneider, J. Werthmann, Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024) (2024).' date_created: 2026-02-10T10:00:43Z date_updated: 2026-02-11T09:12:57Z department: - _id: '34' - _id: '7' - _id: '79' language: - iso: eng publication: 'Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)' status: public title: 'Routing schemes for hybrid communication networks. ' type: journal_article user_id: '15578' year: '2024' ...