Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time

DOI10.1007/11944836_7MaRDI QIDQ5385972zbMATH OpenOpenAlexFDO

Authors Florent Becker, Ivan Rapaport, Eric Rémila

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_7

Mathematics Subject Classification ID

Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
• Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
• Parallelism and time in hierarchical self-assembly
• Parallelism and time in hierarchical self-assembly
• Complexity of Self‐Assembled Shapes

Cited in

(26)

• Complexity classes for self-assembling flexible tiles
• Pictures worth a thousand tiles, a geometrical programming language for self-assembly
• Tile complexity of approximate squares
• Nearly constant tile complexity for any shape in two-handed tile assembly
• Parallel computation using active self-assembly
• The complexity of multiple handed self-assembly
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• An introduction to tile-based self-assembly and a survey of recent results
• Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
• Flipping tiles: concentration independent coin flips in tile self-assembly
• Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
• Randomized Self Assembly of Rectangular Nano Structures
• Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
• Program size and temperature in self-assembly
• Concentration independent random number generation in tile self-assembly
• Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
• Parallel Computation Using Active Self-assembly
• Running time and program size for self-assembled squares
• Randomized self-assembly for exact shapes
• On Times to Compute Shapes in 2D Tile Self-assembly
• Toward Minimum Size Self-Assembled Counters
• Self-assembly of decidable sets
• Parallelism and time in hierarchical self-assembly
• Parallelism and time in hierarchical self-assembly
• Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
• Self-assembly of infinite structures: a survey

This page was built for publication: Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385972)