Randomized Self Assembly of Rectangular Nano Structures
From MaRDI portal
Publication:3070965
DOI10.1007/978-3-642-18305-8_10zbMath1314.68127MaRDI QIDQ3070965
Sanguthevar Rajasekaran, Vamsi Krishna Kundeti
Publication date: 28 January 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18305-8_10
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68W20: Randomized algorithms
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Cites Work
- The program-size complexity of self-assembled squares (extended abstract)
- Randomized Self-assembly for Approximate Shapes
- Reducing tile complexity for self-assembly through temperature programming
- Randomized Self-Assembly for Exact Shapes
- Running time and program size for self-assembled squares
- Complexities for Generalized Models of Self-Assembly
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time