Randomized Self-assembly for Approximate Shapes

DOI10.1007/978-3-540-70575-8_31zbMath1153.68561MaRDI 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 algorithms; randomized algorithms; self-assembly

Mathematics Subject Classification ID

68W25: Approximation algorithms

68W20: Randomized algorithms

Related Items

Parallel Computation Using Active Self-assembly, Unnamed Item, Parallelism and Time in Hierarchical Self-Assembly, One-dimensional staged self-assembly, An introduction to tile-based self-assembly and a survey of recent results, Program size and temperature in self-assembly, Concentration independent random number generation in tile self-assembly, Efficient algorithms for self assembling non-rectangular nano structures, Self-assembly of decidable sets, Limitations of self-assembly at temperature 1, Self-assembly of infinite structures: a survey, Pictures worth a thousand tiles, a geometrical programming language for self-assembly, Tile complexity of approximate squares, Fast arithmetic in algorithmic self-assembly, Parallel computation using active self-assembly, Reducing tile complexity for the self-assembly of scaled shapes through temperature programming, 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, Unnamed Item