<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Invited Paper: Distributed Rhombus Formation of Sliding Squares</dc:title>
   	<dc:creator>Kostitsyna, Irina</dc:creator>
   	<dc:creator>Liedtke, David Jan</dc:creator>
   	<dc:creator>Scheideler, Christian</dc:creator>
   	<dc:creator>Bonomi, Silvia</dc:creator>
   	<dc:creator>Mandal, Partha Sarathi</dc:creator>
   	<dc:creator>Robinson, Peter</dc:creator>
   	<dc:creator>Sharma, Gokarna</dc:creator>
   	<dc:creator>Tixeuil, Sebastien</dc:creator>
   	<dc:description>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.</dc:description>
   	<dc:publisher>Springer Nature Switzerland</dc:publisher>
   	<dc:date>2025</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://ris.uni-paderborn.de/record/62285</dc:identifier>
   	<dc:source>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. &lt;i&gt;Stabilization, Safety, and Security of Distributed Systems&lt;/i&gt;. Springer Nature Switzerland; 2025:325-342. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-032-11127-2_26&quot;&gt;10.1007/978-3-032-11127-2_26&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-032-11127-2_26</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/0302-9743</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/1611-3349</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9783032111265</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9783032111272</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
