[{"user_id":"15578","language":[{"iso":"eng"}],"_id":"64783","date_updated":"2026-02-27T12:17:20Z","author":[{"full_name":"Berger, Thilo ","first_name":"Thilo ","last_name":"Berger"}],"status":"public","year":"2026","title":"Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"mastersthesis","date_created":"2026-02-27T12:16:02Z","citation":{"mla":"Berger, Thilo. <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>. 2026.","bibtex":"@book{Berger_2026, title={Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters}, author={Berger, Thilo }, year={2026} }","ama":"Berger T. <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>.; 2026.","ieee":"T. Berger, <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>. 2026.","apa":"Berger, T. (2026). <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>.","chicago":"Berger, Thilo . <i>Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters</i>, 2026.","short":"T. Berger, Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters, 2026."},"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"citation":{"chicago":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” <i>Distributed Computing</i> 39, no. 2 (2026). <a href=\"https://doi.org/10.1007/s00446-026-00505-2\">https://doi.org/10.1007/s00446-026-00505-2</a>.","short":"A. Padalkin, C. Scheideler, Distributed Computing 39 (2026).","apa":"Padalkin, A., &#38; Scheideler, C. (2026). Polylogarithmic time algorithms for shortest path forests in programmable matter. <i>Distributed Computing</i>, <i>39</i>(2), Article 15. <a href=\"https://doi.org/10.1007/s00446-026-00505-2\">https://doi.org/10.1007/s00446-026-00505-2</a>","ieee":"A. Padalkin and C. Scheideler, “Polylogarithmic time algorithms for shortest path forests in programmable matter,” <i>Distributed Computing</i>, vol. 39, no. 2, Art. no. 15, 2026, doi: <a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>.","ama":"Padalkin A, Scheideler C. Polylogarithmic time algorithms for shortest path forests in programmable matter. <i>Distributed Computing</i>. 2026;39(2). doi:<a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>","bibtex":"@article{Padalkin_Scheideler_2026, title={Polylogarithmic time algorithms for shortest path forests in programmable matter}, volume={39}, DOI={<a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>}, number={215}, journal={Distributed Computing}, publisher={Springer Science and Business Media LLC}, author={Padalkin, Andreas and Scheideler, Christian}, year={2026} }","mla":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” <i>Distributed Computing</i>, vol. 39, no. 2, 15, Springer Science and Business Media LLC, 2026, doi:<a href=\"https://doi.org/10.1007/s00446-026-00505-2\">10.1007/s00446-026-00505-2</a>."},"user_id":"15578","volume":39,"_id":"65733","publisher":"Springer Science and Business Media LLC","status":"public","type":"journal_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2026-05-29T12:11:32Z","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n                  <jats:p>\r\n                    In this paper, we study the computation of shortest paths within the\r\n                    <jats:italic>geometric amoebot model</jats:italic>\r\n                    , a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts. We consider the\r\n                    <jats:italic>reconfigurable circuit extension</jats:italic>\r\n                    of the model where the amoebot structure is able to interconnect amoebots by so-called circuits. These circuits permit the instantaneous transmission of simple signals between connected amoebots. We propose distributed algorithms for the\r\n                    <jats:italic>shortest path forest problem</jats:italic>\r\n                    where, given a set of\r\n                    <jats:italic>k</jats:italic>\r\n                    sources and a set of\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\ell $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mi>ℓ</mml:mi>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    destinations, the amoebot structure has to compute a forest that connects each destination to its closest source on a shortest path. Our main results are two algorithms for hole-free structures. The first algorithm constructs a shortest path tree for a single source within\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(\\log \\ell )$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mo>log</mml:mo>\r\n                            <mml:mi>ℓ</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds, and the second algorithm a shortest path forest for an arbitrary number of sources within\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(\\log n \\log ^2 k)$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mo>log</mml:mo>\r\n                            <mml:mi>n</mml:mi>\r\n                            <mml:msup>\r\n                              <mml:mo>log</mml:mo>\r\n                              <mml:mn>2</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mi>k</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds. The former algorithm also provides an\r\n                    <jats:italic>O</jats:italic>\r\n                    (1) rounds solution for the\r\n                    <jats:italic>single pair shortest path problem</jats:italic>\r\n                    (SPSP) and an\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(\\log n)$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mo>log</mml:mo>\r\n                            <mml:mi>n</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds solution for the\r\n                    <jats:italic>single source shortest path problem</jats:italic>\r\n                    (SSSP) since these problems are special cases of the considered problem. Then, we adapt the latter algorithm to an offset version of the problem. This allows us to solve the problem for amoebot structures with holes within\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$O(h \\log ^3 n)$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>O</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mi>h</mml:mi>\r\n                            <mml:msup>\r\n                              <mml:mo>log</mml:mo>\r\n                              <mml:mn>3</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mi>n</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    rounds w.h.p. where\r\n                    <jats:italic>h</jats:italic>\r\n                    denotes the number of holes.\r\n                  </jats:p>"}],"issue":"2","publication":"Distributed Computing","doi":"10.1007/s00446-026-00505-2","article_number":"15","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2026-05-29T12:13:09Z","intvolume":"        39","year":"2026","title":"Polylogarithmic time algorithms for shortest path forests in programmable matter","publication_identifier":{"issn":["0178-2770","1432-0452"]},"author":[{"id":"88238","last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}]},{"publication":"Lecture Notes in Computer Science","citation":{"short":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2026.","chicago":"Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Fast Distributed Computation of Compact Routing Schemes.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2026. <a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">https://doi.org/10.1007/978-3-032-26465-7_19</a>.","apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &#38; Werthmann, J. (2026). Fast Distributed Computation of Compact Routing Schemes. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">https://doi.org/10.1007/978-3-032-26465-7_19</a>","ieee":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Fast Distributed Computation of Compact Routing Schemes,” 2026, doi: <a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>.","ama":"Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Fast Distributed Computation of Compact Routing Schemes. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2026. doi:<a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>","bibtex":"@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2026, place={Cham}, title={Fast Distributed Computation of Compact Routing Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, year={2026} }","mla":"Dou, Jinfeng, et al. “Fast Distributed Computation of Compact Routing Schemes.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2026, doi:<a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>."},"date_created":"2026-07-27T14:00:42Z","place":"Cham","type":"conference","department":[{"_id":"79"}],"year":"2026","title":"Fast Distributed Computation of Compact Routing Schemes","status":"public","author":[{"id":"92888","full_name":"Dou, Jinfeng","first_name":"Jinfeng","last_name":"Dou"},{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"id":"74425","full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"id":"50024","full_name":"Werthmann, Julian","first_name":"Julian","last_name":"Werthmann"}],"publication_identifier":{"isbn":["9783032264640","9783032264657"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2026-07-27T14:40:21Z","publisher":"Springer Nature Switzerland","_id":"66603","language":[{"iso":"eng"}],"user_id":"74425","doi":"10.1007/978-3-032-26465-7_19"},{"doi":"10.1145/3796701.3815939","user_id":"74425","language":[{"iso":"eng"}],"_id":"66602","publisher":"ACM","date_updated":"2026-07-27T14:39:53Z","publication_status":"published","author":[{"full_name":"Augustine, John","last_name":"Augustine","first_name":"John"},{"full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning","id":"74425"},{"full_name":"Kumar, Manish","first_name":"Manish","last_name":"Kumar"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"id":"50024","full_name":"Werthmann, Julian","first_name":"Julian","last_name":"Werthmann"}],"title":"Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers","year":"2026","status":"public","department":[{"_id":"79"}],"type":"conference","date_created":"2026-07-27T13:56:01Z","citation":{"short":"J. Augustine, H. Hillebrandt, M. Kumar, C. Scheideler, J. Werthmann, in: Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2026.","chicago":"Augustine, John, Henning Hillebrandt, Manish Kumar, Christian Scheideler, and Julian Werthmann. “Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers.” In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. ACM, 2026. <a href=\"https://doi.org/10.1145/3796701.3815939\">https://doi.org/10.1145/3796701.3815939</a>.","ieee":"J. Augustine, H. Hillebrandt, M. Kumar, C. Scheideler, and J. Werthmann, “Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers,” 2026, doi: <a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>.","apa":"Augustine, J., Hillebrandt, H., Kumar, M., Scheideler, C., &#38; Werthmann, J. (2026). Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers. <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. <a href=\"https://doi.org/10.1145/3796701.3815939\">https://doi.org/10.1145/3796701.3815939</a>","bibtex":"@inproceedings{Augustine_Hillebrandt_Kumar_Scheideler_Werthmann_2026, title={Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers}, DOI={<a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>}, booktitle={Proceedings of the ACM Symposium on Principles of Distributed Computing}, publisher={ACM}, author={Augustine, John and Hillebrandt, Henning and Kumar, Manish and Scheideler, Christian and Werthmann, Julian}, year={2026} }","ama":"Augustine J, Hillebrandt H, Kumar M, Scheideler C, Werthmann J. Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers. In: <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. ACM; 2026. doi:<a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>","mla":"Augustine, John, et al. “Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers.” <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, ACM, 2026, doi:<a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>."},"publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing"},{"type":"mastersthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2025-04-22T08:24:39Z","citation":{"mla":"Showmik, Md Jannatul Baki. <i>Enhancing Blockchain Efficiency via Median Rule</i>. 2025.","ama":"Showmik MJB. <i>Enhancing Blockchain Efficiency via Median Rule</i>.; 2025.","bibtex":"@book{Showmik_2025, title={Enhancing Blockchain Efficiency via Median Rule}, author={Showmik, Md Jannatul Baki}, year={2025} }","apa":"Showmik, M. J. B. (2025). <i>Enhancing Blockchain Efficiency via Median Rule</i>.","ieee":"M. J. B. Showmik, <i>Enhancing Blockchain Efficiency via Median Rule</i>. 2025.","chicago":"Showmik, Md Jannatul Baki. <i>Enhancing Blockchain Efficiency via Median Rule</i>, 2025.","short":"M.J.B. Showmik, Enhancing Blockchain Efficiency via Median Rule, 2025."},"supervisor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"user_id":"15578","_id":"59624","language":[{"iso":"eng"}],"date_updated":"2025-04-22T08:26:45Z","title":"Enhancing Blockchain Efficiency via Median Rule","status":"public","year":"2025","author":[{"full_name":"Showmik, Md Jannatul Baki","last_name":"Showmik","first_name":"Md Jannatul Baki"}]},{"_id":"62285","publisher":"Springer Nature Switzerland","page":"325-342","editor":[{"last_name":"Bonomi","first_name":"Silvia","full_name":"Bonomi, Silvia"},{"full_name":"Mandal, Partha Sarathi","first_name":"Partha Sarathi","last_name":"Mandal"},{"full_name":"Robinson, Peter","first_name":"Peter","last_name":"Robinson"},{"full_name":"Sharma, Gokarna","first_name":"Gokarna","last_name":"Sharma"},{"full_name":"Tixeuil, Sebastien","first_name":"Sebastien","last_name":"Tixeuil"}],"user_id":"15578","conference":{"end_date":"2025-10-11","location":"Kathmandu","start_date":"2025-10-09","name":"27th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)"},"status":"public","place":"Cham","citation":{"mla":"Kostitsyna, Irina, et al. “Invited Paper: Distributed Rhombus Formation of Sliding Squares.” <i>Stabilization, Safety, and Security of Distributed Systems</i>, edited by Silvia Bonomi et al., Springer Nature Switzerland, 2025, pp. 325–42, doi:<a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>.","ama":"Kostitsyna I, Liedtke DJ, Scheideler C. Invited Paper: Distributed Rhombus Formation of Sliding Squares. In: Bonomi S, Mandal PS, Robinson P, Sharma G, Tixeuil S, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>. Springer Nature Switzerland; 2025:325-342. doi:<a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>","bibtex":"@inproceedings{Kostitsyna_Liedtke_Scheideler_2025, place={Cham}, title={Invited Paper: Distributed Rhombus Formation of Sliding Squares}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems}, publisher={Springer Nature Switzerland}, author={Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}, editor={Bonomi, Silvia and Mandal, Partha Sarathi and Robinson, Peter and Sharma, Gokarna and Tixeuil, Sebastien}, year={2025}, pages={325–342} }","apa":"Kostitsyna, I., Liedtke, D. J., &#38; Scheideler, C. (2025). Invited Paper: Distributed Rhombus Formation of Sliding Squares. In S. Bonomi, P. S. Mandal, P. Robinson, G. Sharma, &#38; S. Tixeuil (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems</i> (pp. 325–342). Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">https://doi.org/10.1007/978-3-032-11127-2_26</a>","ieee":"I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Invited Paper: Distributed Rhombus Formation of Sliding Squares,” in <i>Stabilization, Safety, and Security of Distributed Systems</i>, Kathmandu, 2025, pp. 325–342, doi: <a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">10.1007/978-3-032-11127-2_26</a>.","chicago":"Kostitsyna, Irina, David Jan Liedtke, and Christian Scheideler. “Invited Paper: Distributed Rhombus Formation of Sliding Squares.” In <i>Stabilization, Safety, and Security of Distributed Systems</i>, edited by Silvia Bonomi, Partha Sarathi Mandal, Peter Robinson, Gokarna Sharma, and Sebastien Tixeuil, 325–42. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-11127-2_26\">https://doi.org/10.1007/978-3-032-11127-2_26</a>.","short":"I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: S. Bonomi, P.S. Mandal, P. Robinson, G. Sharma, S. Tixeuil (Eds.), Stabilization, Safety, and Security of Distributed Systems, Springer Nature Switzerland, Cham, 2025, pp. 325–342."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-032-11127-2_26","author":[{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"full_name":"Liedtke, David Jan","last_name":"Liedtke","first_name":"David Jan","id":"55557"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"publication_identifier":{"isbn":["9783032111265","9783032111272"],"issn":["0302-9743","1611-3349"]},"title":"Invited Paper: Distributed Rhombus Formation of Sliding Squares","year":"2025","date_updated":"2026-02-11T08:31:14Z","publication_status":"published","date_created":"2025-11-23T21:07:12Z","department":[{"_id":"79"}],"type":"conference","publication":"Stabilization, Safety, and Security of Distributed Systems","abstract":[{"text":"The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed algorithm that enables a group of modules to reconfigure into a rhombus shape, starting from an arbitrary side-connected configuration. It is connectivity-preserving and operates under minimal assumptions: one leader module, common chirality, constant memory per module, and visibility and communication restricted to immediate neighbors. Unlike prior work, which relaxes the original sliding square move-set, our approach uses the unmodified move-set, addressing the additional challenge of handling locked configurations. Our algorithm is sequential in nature and operates with a worst-case time complexity of O(n^2) rounds, which is optimal for sequential algorithms. To improve runtime, we introduce two parallel variants of the algorithm. Both rely on a spanning tree data structure, allowing modules to make decisions based on local connectivity. Our experimental results show a significant speedup for the first variant, and a linear average runtime for the second variant, which is worst-case optimal for parallel algorithms.","lang":"eng"}]},{"citation":{"short":"C. Scheideler, A. Padalkin, M. Kumar, Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025) (2025).","ama":"Scheideler C, Padalkin A, Kumar M. Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025). <i>Reconfiguration and locomotion with joint movements in the amoebot model Auton Robots 49(3): 22 (2025)</i>. Published online 2025.","chicago":"Scheideler, Christian, Andreas Padalkin, and Manish Kumar. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025).” <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025)</i>, 2025.","bibtex":"@article{Scheideler_Padalkin_Kumar_2025, title={Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}, journal={Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}, author={Scheideler, Christian and Padalkin, Andreas and Kumar, Manish}, year={2025} }","mla":"Scheideler, Christian, et al. “Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025).” <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025)</i>, 2025.","apa":"Scheideler, C., Padalkin, A., &#38; Kumar, M. (2025). Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025). <i>Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. Auton. Robots 49(3): 22 (2025)</i>.","ieee":"C. Scheideler, A. Padalkin, and M. Kumar, “Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025),” <i>Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)</i>, 2025."},"publication":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","date_created":"2026-02-10T09:41:12Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"journal_article","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Padalkin","first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238"},{"last_name":"Kumar","first_name":"Manish","full_name":"Kumar, Manish"}],"year":"2025","status":"public","title":"Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)","date_updated":"2026-02-11T09:11:49Z","_id":"64098","language":[{"iso":"eng"}],"user_id":"15578"},{"date_created":"2026-02-10T09:01:15Z","place":"SoCG 2025: 81:1-81:5","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"chicago":"Scheideler, Christian, Matthias Artmann, Tobias  Maurer, Andreas Padalkin, and Daniel Warner. “AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). .” SoCG 2025: 81:1-81:5, 2025.","short":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, D. Warner, in: SoCG 2025: 81:1-81:5, 2025.","ieee":"C. Scheideler, M. Artmann, T. Maurer, A. Padalkin, and D. Warner, “AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ,” 2025.","apa":"Scheideler, C., Artmann, M., Maurer, T., Padalkin, A., &#38; Warner, D. (2025). <i>AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). </i>.","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} }","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.","mla":"Scheideler, Christian, et al. <i>AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). </i>. 2025."},"language":[{"iso":"eng"}],"_id":"64094","user_id":"15578","status":"public","title":"AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). ","year":"2025","author":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Artmann, Matthias","first_name":"Matthias","last_name":"Artmann","id":"63743"},{"last_name":"Maurer","first_name":"Tobias ","full_name":"Maurer, Tobias "},{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"id":"3902","last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel"}],"date_updated":"2026-02-11T09:11:42Z"},{"place":"SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2026-02-10T09:49:03Z","type":"book_editor","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"mla":"Scheideler, Christian, and Kitty Meeks, editors. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i> 2025.","ama":"Scheideler C, Meeks K, eds. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i>; 2025.","bibtex":"@book{Scheideler_Meeks_2025, place={SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title={4th Symposium on Algorithmic Foundations of Dynamic Networks.}, year={2025} }","apa":"Scheideler, C., &#38; Meeks, K. (Eds.). (2025). <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i>","ieee":"C. Scheideler and K. Meeks, Eds., <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i> SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","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.","chicago":"Scheideler, Christian, and Kitty Meeks, eds. <i>4th Symposium on Algorithmic Foundations of Dynamic Networks.</i> SAND 2025, Liverpool, UK, June 9-11, 2025. LIPIcs 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025."},"language":[{"iso":"eng"}],"_id":"64099","user_id":"15578","editor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Kitty","last_name":"Meeks","full_name":"Meeks, Kitty"}],"year":"2025","title":"4th Symposium on Algorithmic Foundations of Dynamic Networks.","status":"public","publication_identifier":{"unknown":["ISBN 978-3-95977-368-3"]},"date_updated":"2026-02-11T09:11:09Z"},{"language":[{"iso":"eng"}],"_id":"64097","user_id":"15578","author":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Artmann, Matthias","last_name":"Artmann","first_name":"Matthias","id":"63743"},{"full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas","id":"88238"}],"status":"public","year":"2025","title":"On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. ","date_updated":"2026-02-11T09:11:19Z","date_created":"2026-02-10T09:17:54Z","place":"DISC 2025: 7:1-7:22","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"conference","citation":{"short":"C. Scheideler, M. Artmann, A. Padalkin, in: DISC 2025: 7:1-7:22, 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.","apa":"Scheideler, C., Artmann, M., &#38; Padalkin, A. (2025). <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>.","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} }","ama":"Scheideler C, Artmann M, Padalkin A. On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. . In: ; 2025.","mla":"Scheideler, Christian, et al. <i>On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. </i>. 2025."}},{"citation":{"bibtex":"@inproceedings{Scheideler_Augustine _Werthmann_2025, place={Euro-Par (3) 2025: 48-62}, title={Supervised Distributed Computing. }, author={Scheideler, Christian and Augustine , John  and Werthmann, Julian}, year={2025} }","ama":"Scheideler C, Augustine  J, Werthmann J. Supervised Distributed Computing. . In: ; 2025.","short":"C. Scheideler, J. Augustine , J. Werthmann, in: Euro-Par (3) 2025: 48-62, 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.","apa":"Scheideler, C., Augustine , J., &#38; Werthmann, J. (2025). <i>Supervised Distributed Computing. </i>.","mla":"Scheideler, Christian, et al. <i>Supervised Distributed Computing. </i>. 2025."},"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"conference","place":"Euro-Par (3) 2025: 48-62","date_created":"2026-02-10T09:04:56Z","date_updated":"2026-02-11T09:11:35Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Augustine , John ","last_name":"Augustine ","first_name":"John "},{"id":"50024","first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian"}],"year":"2025","status":"public","title":"Supervised Distributed Computing. ","user_id":"15578","language":[{"iso":"eng"}],"_id":"64095"},{"publication":"Theoretical Computer Science","citation":{"apa":"Hinnenthal, K., Liedtke, D. J., &#38; Scheideler, C. (2025). Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures. <i>Theoretical Computer Science</i>, <i>1057</i>, Article 115552. <a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">https://doi.org/10.1016/j.tcs.2025.115552</a>","ieee":"K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures,” <i>Theoretical Computer Science</i>, vol. 1057, Art. no. 115552, 2025, doi: <a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>.","chicago":"Hinnenthal, Kristian, David Jan Liedtke, and Christian Scheideler. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” <i>Theoretical Computer Science</i> 1057 (2025). <a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">https://doi.org/10.1016/j.tcs.2025.115552</a>.","short":"K. Hinnenthal, D.J. Liedtke, C. Scheideler, Theoretical Computer Science 1057 (2025).","mla":"Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.” <i>Theoretical Computer Science</i>, vol. 1057, 115552, Elsevier BV, 2025, doi:<a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>.","ama":"Hinnenthal K, Liedtke DJ, Scheideler C. Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures. <i>Theoretical Computer Science</i>. 2025;1057. doi:<a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>","bibtex":"@article{Hinnenthal_Liedtke_Scheideler_2025, title={Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures}, volume={1057}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2025.115552\">10.1016/j.tcs.2025.115552</a>}, number={115552}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian}, year={2025} }"},"date_created":"2025-11-03T10:19:53Z","type":"journal_article","department":[{"_id":"79"}],"status":"public","year":"2025","title":"Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures","author":[{"id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","first_name":"Kristian"},{"id":"55557","full_name":"Liedtke, David Jan","first_name":"David Jan","last_name":"Liedtke"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","date_updated":"2025-11-03T10:21:52Z","intvolume":"      1057","article_number":"115552","publisher":"Elsevier BV","_id":"62051","language":[{"iso":"eng"}],"user_id":"55557","doi":"10.1016/j.tcs.2025.115552","volume":1057},{"language":[{"iso":"eng"}],"_id":"62247","user_id":"15578","year":"2025","status":"public","title":"Monoton erreichbarer Delaunaygraph","author":[{"first_name":"Felix","last_name":"Werner","full_name":"Werner, Felix"}],"date_updated":"2025-11-19T09:15:02Z","date_created":"2025-11-19T09:13:37Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"mla":"Werner, Felix. <i>Monoton Erreichbarer Delaunaygraph</i>. 2025.","ama":"Werner F. <i>Monoton Erreichbarer Delaunaygraph</i>.; 2025.","bibtex":"@book{Werner_2025, title={Monoton erreichbarer Delaunaygraph}, author={Werner, Felix}, year={2025} }","apa":"Werner, F. (2025). <i>Monoton erreichbarer Delaunaygraph</i>.","ieee":"F. Werner, <i>Monoton erreichbarer Delaunaygraph</i>. 2025.","short":"F. Werner, Monoton Erreichbarer Delaunaygraph, 2025.","chicago":"Werner, Felix. <i>Monoton Erreichbarer Delaunaygraph</i>, 2025."},"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}]},{"author":[{"full_name":"Dorociak, Svitlana","last_name":"Dorociak","first_name":"Svitlana"}],"status":"public","year":"2024","title":"Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung","date_updated":"2024-03-05T12:53:25Z","_id":"52318","language":[{"iso":"eng"}],"user_id":"15578","citation":{"mla":"Dorociak, Svitlana. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>. 2024.","bibtex":"@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }","ama":"Dorociak S. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>.; 2024.","ieee":"S. Dorociak, <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>. 2024.","apa":"Dorociak, S. (2024). <i>Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung</i>.","chicago":"Dorociak, Svitlana. <i>Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung</i>, 2024.","short":"S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2024-03-05T12:52:59Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"bachelorsthesis"},{"date_updated":"2024-04-09T11:35:41Z","status":"public","year":"2024","title":"A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes","author":[{"first_name":"Carsten","last_name":"De Groote","full_name":"De Groote, Carsten"}],"user_id":"15578","language":[{"iso":"eng"}],"_id":"53374","supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"citation":{"mla":"De Groote, Carsten. <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>. 2024.","bibtex":"@book{De Groote_2024, title={A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes}, author={De Groote, Carsten}, year={2024} }","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.","apa":"De Groote, C. (2024). <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>.","chicago":"De Groote, Carsten. <i>A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes</i>, 2024.","short":"C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes, 2024."},"type":"mastersthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2024-04-09T11:35:20Z"},{"citation":{"apa":"Doddegowda, R. (2024). <i>Optimal Drone Strategies For Packet Delivery</i>.","ieee":"R. Doddegowda, <i>Optimal Drone Strategies For Packet Delivery</i>. 2024.","short":"R. Doddegowda, Optimal Drone Strategies For Packet Delivery, 2024.","chicago":"Doddegowda, Rajesh. <i>Optimal Drone Strategies For Packet Delivery</i>, 2024.","mla":"Doddegowda, Rajesh. <i>Optimal Drone Strategies For Packet Delivery</i>. 2024.","ama":"Doddegowda R. <i>Optimal Drone Strategies For Packet Delivery</i>.; 2024.","bibtex":"@book{Doddegowda_2024, title={Optimal Drone Strategies For Packet Delivery}, author={Doddegowda, Rajesh}, year={2024} }"},"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2024-04-09T11:31:47Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"type":"mastersthesis","author":[{"full_name":"Doddegowda, Rajesh","last_name":"Doddegowda","first_name":"Rajesh"}],"title":"Optimal Drone Strategies For Packet Delivery","year":"2024","status":"public","date_updated":"2024-04-09T11:32:20Z","language":[{"iso":"eng"}],"_id":"53373","user_id":"15578"},{"citation":{"ama":"Thakur H. <i>Evaluating the Implications</i>.; 2024.","bibtex":"@book{Thakur_2024, title={Evaluating the Implications}, author={Thakur, Heena}, year={2024} }","mla":"Thakur, Heena. <i>Evaluating the Implications</i>. 2024.","chicago":"Thakur, Heena. <i>Evaluating the Implications</i>, 2024.","short":"H. Thakur, Evaluating the Implications, 2024.","apa":"Thakur, H. (2024). <i>Evaluating the Implications</i>.","ieee":"H. Thakur, <i>Evaluating the Implications</i>. 2024."},"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"type":"mastersthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2024-04-09T11:28:39Z","date_updated":"2024-04-09T11:29:24Z","year":"2024","title":"Evaluating the Implications","status":"public","author":[{"full_name":"Thakur, Heena","last_name":"Thakur","first_name":"Heena"}],"user_id":"15578","_id":"53372","language":[{"iso":"eng"}]},{"date_created":"2024-07-03T13:09:48Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"citation":{"chicago":"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.","apa":"Delgado Steuter, D. (2024). <i>Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads </i>.","ieee":"D. Delgado Steuter, <i>Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads </i>. 2024.","ama":"Delgado Steuter D. <i>Realizing Concurrency on Top of the Microkernel SeL4 via Improved Threads </i>.; 2024.","bibtex":"@book{Delgado Steuter_2024, title={Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads }, author={Delgado Steuter, Dominik}, year={2024} }","mla":"Delgado Steuter, Dominik. <i>Realizing Concurrency on Top of the Microkernel SeL4 via Improved Threads </i>. 2024."},"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"language":[{"iso":"eng"}],"_id":"55002","user_id":"15578","status":"public","year":"2024","title":"Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads ","author":[{"full_name":"Delgado Steuter, Dominik","first_name":"Dominik","last_name":"Delgado Steuter"}],"date_updated":"2024-07-03T13:11:26Z"},{"user_id":"15578","language":[{"iso":"eng"}],"_id":"55003","date_updated":"2024-07-03T14:02:14Z","status":"public","title":"On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits","year":"2024","author":[{"full_name":"Artmann, Matthias","first_name":"Matthias","last_name":"Artmann"}],"type":"mastersthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2024-07-03T14:01:54Z","supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"citation":{"chicago":"Artmann, Matthias. <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.","apa":"Artmann, M. (2024). <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>.","ieee":"M. Artmann, <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>. 2024.","ama":"Artmann M. <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>.; 2024.","bibtex":"@book{Artmann_2024, title={On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits}, author={Artmann, Matthias}, year={2024} }","mla":"Artmann, Matthias. <i>On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits</i>. 2024."}},{"date_created":"2024-07-05T12:37:07Z","type":"mastersthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"apa":"Eranki, V. M. (2024). <i>Fever: Optimal Responsive View Synchronisation</i>.","ieee":"V. M. Eranki, <i>Fever: Optimal Responsive View Synchronisation</i>. 2024.","short":"V.M. Eranki, Fever: Optimal Responsive View Synchronisation, 2024.","chicago":"Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>, 2024.","mla":"Eranki, Varun Maitreya. <i>Fever: Optimal Responsive View Synchronisation</i>. 2024.","ama":"Eranki VM. <i>Fever: Optimal Responsive View Synchronisation</i>.; 2024.","bibtex":"@book{Eranki_2024, title={Fever: Optimal Responsive View Synchronisation}, author={Eranki, Varun Maitreya}, year={2024} }"},"_id":"55092","language":[{"iso":"eng"}],"user_id":"15578","title":"Fever: Optimal Responsive View Synchronisation","year":"2024","status":"public","author":[{"full_name":"Eranki, Varun Maitreya","last_name":"Eranki","first_name":"Varun Maitreya"}],"date_updated":"2024-07-05T12:37:40Z"}]