Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation

DOI10.1007/978-3-319-11295-4_2zbMath1423.68301arXiv1409.4828OpenAlexW1828271121MaRDI QIDQ2921470

Damien Woods, Chun-Tao Yang, Ho-Lin Chen, Dhiraj Holden, David Doty, Chris Thachuk

Publication date: 8 October 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.4828

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (5)

Improved Leader Election for Self-organizing Programmable Matter ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ Unnamed Item ⋮ Tight bounds for active self-assembly using an insertion primitive ⋮ A minimal requirement for self-assembly of lines in polylogarithmic time

This page was built for publication: Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation