Computing in continuous space with self-assembling polygonal tiles (extended abstract)
From MaRDI portal
Publication:4575647
DOI10.1137/1.9781611974331.ch67zbMath1410.68124arXiv1503.00327OpenAlexW4249442355MaRDI QIDQ4575647
Jacob Hendricks, Oscar Gilbert, Trent A. Rogers, Matthew J. Patitz
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.00327
Related Items
Self-assembly of 4-sided fractals in the two-handed tile assembly model, Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D, Building squares with optimal state complexity in restricted active self-assembly, The need for seed (in the abstract Tile Assembly Model), On the effects of hierarchical self-assembly for reducing program-size complexity, Geometric tiles and powers and limitations of geometric hindrance in self-assembly
