Parallelism and Time in Hierarchical Self-Assembly
From MaRDI portal
Publication:5737807
DOI10.1137/151004161zbMath1408.68060OpenAlexW2601936399MaRDI QIDQ5737807
Publication date: 30 May 2017
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20120524-103212168
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model ⋮ A Brief Tour of Theoretical Tile Self-Assembly ⋮ Unique assembly verification in two-handed self-assembly ⋮ Tilt assembly: algorithms for micro-factories that build objects with uniform external forces ⋮ Staged self-assembly and polyomino context-free grammars ⋮ Particle-based assembly using precise global control ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Strict self-assembly of discrete Sierpinski triangles
- Identifying shapes using self-assembly
- Producibility in hierarchical self-assembly
- Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
- Self-assembly with Geometric Tiles
- Pattern overlap implies runaway growth in hierarchical tile systems
- Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
- A Brief Tour of Theoretical Tile Self-Assembly
- 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
- Programmable Control of Nucleation for Algorithmic Self-Assembly
- 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
- Computational Complexity
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
- 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
This page was built for publication: Parallelism and Time in Hierarchical Self-Assembly