@inproceedings{62285,
  abstract     = {{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       = {{Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}},
  booktitle    = {{Stabilization, Safety, and Security of Distributed Systems}},
  editor       = {{Bonomi, Silvia and Mandal, Partha Sarathi and Robinson, Peter and Sharma, Gokarna and Tixeuil, Sebastien}},
  isbn         = {{9783032111265}},
  issn         = {{0302-9743}},
  location     = {{Kathmandu}},
  pages        = {{325--342}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Invited Paper: Distributed Rhombus Formation of Sliding Squares}}},
  doi          = {{10.1007/978-3-032-11127-2_26}},
  year         = {{2025}},
}

@inbook{64881,
  author       = {{Almalki, Nada and Gupta, Siddharth and Michail, Othon and Padalkin, Andreas}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783032111265}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits}}},
  doi          = {{10.1007/978-3-032-11127-2_5}},
  year         = {{2025}},
}