A Brief Tour of Theoretical Tile Self-Assembly
From MaRDI portal
Publication:3186470
DOI10.1007/978-3-319-39300-1_3zbMath1350.68116OpenAlexW2496189089MaRDI QIDQ3186470
Publication date: 10 August 2016
Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01435031/document
Related Items
Optimal staged self-assembly of general shapes, Parallelism and Time in Hierarchical Self-Assembly, Freezing, Bounded-Change and Convergent Cellular Automata, On the impact of treewidth in the computational complexity of freezing dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Communication complexity and intrinsic universality in cellular automata
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Polyomino-safe DNA self-assembly via block replacement
- DNA computing based on splicing: The existence of universal computers
- Negative interactions in irreversible self-assembly
- Producibility in Hierarchical Self-assembly
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
- Pattern overlap implies runaway growth in hierarchical tile systems
- Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
- Intrinsic Universality in Self-Assembly
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Programmable Control of Nucleation for Algorithmic Self-Assembly
- Limitations of Self-assembly at Temperature One
- An Introduction to Tile-Based Self-assembly
- On the power of the splicing operation1
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
- Running time and program size for self-assembled squares
- Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
- Complexities for Generalized Models of Self-Assembly
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
- Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
- Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions
- DNA Computing
- DNA Computing
- ACTIVE TILE SELF-ASSEMBLY, PART 1: UNIVERSALITY AT TEMPERATURE 1
- DNA Computing
- Parallelism and Time in Hierarchical Self-Assembly
