Randomized Self-assembly for Approximate Shapes

DOI10.1007/978-3-540-70575-8_31MaRDI QIDQ3521933zbMATH OpenOpenAlexFDO

Authors Robert T. Schweller, Ming-Yang Kao

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_31

zbMATH Keywords

approximation algorithmsrandomized algorithmsself-assembly

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Randomized self-assembly for exact shapes
• Self-assembly of any shape with constant tile types using high temperature
• Randomized Self Assembly of Rectangular Nano Structures
• Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
• Tile complexity of approximate squares

Cited in

(27)

• Pictures worth a thousand tiles, a geometrical programming language for self-assembly
• Identifying shapes using self-assembly
• Tile complexity of approximate squares
• 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
• One-dimensional staged self-assembly
• 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
• Randomized Self Assembly of Rectangular Nano Structures
• Exact shapes and Turing universality at temperature 1 with a single negative glue
• Random Number Selection in Self-assembly
• scientific article; zbMATH DE number 6351478 (Why is no real title available?)
• scientific article; zbMATH DE number 6846397 (Why is no real title available?)
• Program size and temperature in self-assembly
• Concentration independent random number generation in tile self-assembly
• Parallel Computation Using Active Self-assembly
• Efficient algorithms for self assembling non-rectangular nano structures
• Randomized self-assembly for exact shapes
• Self-assembly of decidable sets
• Parallelism and time in hierarchical self-assembly
• Parallelism and time in hierarchical self-assembly
• Limitations of self-assembly at temperature 1
• Self-assembly of infinite structures: a survey
• The need for seed (in the abstract Tile Assembly Model)
• The impacts of dimensionality, diffusion, and directedness on intrinsic cross-model simulation in tile-based self-assembly

This page was built for publication: Randomized Self-assembly for Approximate Shapes

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