scientific article; zbMATH DE number 7053344

zbMath1421.68045MaRDI QIDQ5743467

Ho-Lin Chen, David Doty

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095208

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Related Items (14)

Optimal self-assembly of finite shapes at temperature 1 in 3D ⋮ Strict self-assembly of fractals using multiple hands ⋮ Tight bounds for active self-assembly using an insertion primitive ⋮ Optimal staged self-assembly of general shapes ⋮ Optimal program-size complexity for self-assembled squares at temperature 1 in 3D ⋮ Nearly constant tile complexity for any shape in two-handed tile assembly ⋮ Producibility in hierarchical self-assembly ⋮ Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems ⋮ Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals ⋮ Parallelism and Time in Hierarchical Self-Assembly ⋮ Optimal staged self-assembly of linear assemblies ⋮ Activatable tiles for compact robust programmable molecular assembly and other applications ⋮ An introduction to tile-based self-assembly and a survey of recent results ⋮ The two-handed tile assembly model is not intrinsically universal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Self-assembly with Geometric Tiles
• Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
• The program-size complexity of self-assembled squares (extended abstract)
• Randomized Self-assembly for Approximate Shapes
• Combinatorial optimization problems in self-assembly
• Reducing tile complexity for self-assembly through temperature programming
• The Tile Complexity of Linear Assemblies
• Polyomino-Safe DNA Self-assembly via Block Replacement
• Step-Assembly with a Constant Number of Tile Types
• 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
• Randomized Self-Assembly for Exact Shapes
• Complexity of Self‐Assembled Shapes
• DNA Computing

This page was built for publication: