Parallel computation using active self-assembly
From MaRDI portal
Recommendations
- Parallel Computation Using Active Self-assembly
- Computational self-assembly
- Fuel Efficient Computation in Passive Self-Assembly
- Dynamic self-assembly in living systems as computation
- Parallelism and time in hierarchical self-assembly
- Parallelism and time in hierarchical self-assembly
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Simulation of programmable matter systems using active tile-based self-assembly
Cites work
- A theory of strict P-completeness
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Active Self-Assembly of Simple Units Using an Insertion Primitive
- ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION
- Algorithms and Computation
- Amplifying lower bounds by means of self-reducibility
- An introduction to tile-based self-assembly
- AND and/or OR: uniform polynomial-size circuits
- Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
- Complexities for Generalized Models of Self-Assembly
- Complexity classes for self-assembling flexible tiles
- Computation with finite stochastic chemical reaction networks
- Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model
- scientific article; zbMATH DE number 48028 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1869460 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 7357524 (Why is no real title available?)
- Intrinsic universality and the computational power of self-assembly
- Intrinsic universality in self-assembly
- Intrinsic universality in tile self-assembly requires cooperation
- One tile to rule them all: simulating any tile assembly system with a single universal tile
- One-dimensional staged self-assembly
- P-completeness of Cellular Automaton Rule 110
- Rainbow sort: Sorting at the speed of light
- Randomized Self-assembly for Approximate Shapes
- Randomized self-assembly for exact shapes
- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
- Reducing tile complexity for self-assembly through temperature programming
- Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
- Self-assembly with geometric tiles
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- The program-size complexity of self-assembled squares (extended abstract)
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
- Tile complexity of approximate squares
- Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
Cited in
(8)- A minimal requirement for self-assembly of lines in polylogarithmic time
- An exponentially growing nubot system without state changes
- Computation = self-assembly + conformational change: Toward new computing paradigms.
- Fast algorithmic self-assembly of simple shapes using random agitation
- scientific article; zbMATH DE number 1304542 (Why is no real title available?)
- Parallel Computation Using Active Self-assembly
- Fuel Efficient Computation in Passive Self-Assembly
- Turning machines
This page was built for publication: Parallel computation using active self-assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003467)
