Randomized Self-assembly for Approximate Shapes

DOI10.1007/978-3-540-70575-8_31zbMath1153.68561OpenAlexW1593488342MaRDI QIDQ3521933

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

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

Related Items

Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models ⋮ The complexity of multiple handed self-assembly ⋮ Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly ⋮ Limitations of self-assembly at temperature 1 ⋮ Self-assembly of infinite structures: a survey ⋮ Reducing tile complexity for the self-assembly of scaled shapes through temperature programming ⋮ The need for seed (in the abstract Tile Assembly Model) ⋮ Tile complexity of approximate squares ⋮ Program size and temperature in self-assembly ⋮ Concentration independent random number generation in tile self-assembly ⋮ Parallel Computation Using Active Self-assembly ⋮ Fast arithmetic in algorithmic self-assembly ⋮ Parallel computation using active self-assembly ⋮ Efficient algorithms for self assembling non-rectangular nano structures ⋮ Parallelism and Time in Hierarchical Self-Assembly ⋮ Self-assembly of decidable sets ⋮ Randomized Self Assembly of Rectangular Nano Structures ⋮ Pictures worth a thousand tiles, a geometrical programming language for self-assembly ⋮ Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue ⋮ Unnamed Item ⋮ Unnamed Item ⋮ One-dimensional staged self-assembly ⋮ An introduction to tile-based self-assembly and a survey of recent results