Skip to main navigation Skip to search Skip to main content

Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits

  • Nada Almalki
  • , Siddharth Gupta
  • , Othon Michail
  • , Andreas Padalkin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we study the problem of efficiently reducing geometric shapes into other such shapes in a distributed setting through size-changing operations. We develop distributed algorithms using the reconfigurable circuit model to enable fast node-to-node communication. We study the connectivity graph model. Let n denote the number of agents and k the number of turning points in the initial shape. We show that any tree-shaped configuration can be reduced to a single agent using only shrinking operations in O(klogn) rounds w.h.p., and to its incompressible form in O(logn) rounds w.h.p. given prior knowledge of the incompressible nodes, or in O(klogn) rounds otherwise. When both shrinking and growth operations are available, we give an algorithm that transforms any tree to a topologically equivalent one in O(klogn+log2n) rounds w.h.p. On the negative side, we show that one cannot hope for o(log2n)-round transformations for all shapes of Θ(logn) turning points.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 27th International Symposium, SSS 2025, Proceedings
EditorsSilvia Bonomi, Partha Sarathi Mandal, Peter Robinson, Gokarna Sharma, Sebastien Tixeuil
PublisherSpringer Science and Business Media Deutschland GmbH
Pages40-55
Number of pages16
ISBN (Print)9783032111265
DOIs
StatePublished - 1 Jan 2026
Externally publishedYes
Event27th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS2025 - Kathmandu, Nepal
Duration: 9 Oct 202511 Oct 2025

Publication series

NameLecture Notes in Computer Science
Volume16350 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS2025
Country/TerritoryNepal
CityKathmandu
Period9/10/2511/10/25

Keywords

  • collision avoidance
  • growth process
  • programmable matter
  • shrinking process

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits'. Together they form a unique fingerprint.

Cite this