Toward minimum size self-assembled counters
From MaRDI portal
Publication:941685
Recommendations
Cites work
- scientific article; zbMATH DE number 1241374 (Why is no real title available?)
- Combinatorial optimization problems in self-assembly
- Complexities for generalized models of self-assembly
- DNA Computing
- DNA Computing
- Invadable self-assembly: combining robustness with efficiency
- Reducing tile complexity for self-assembly through temperature programming
- Running time and program size for self-assembled squares
- The program-size complexity of self-assembled squares (extended abstract)
- Toward Minimum Size Self-Assembled Counters
Cited in
(6)- Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
- Toward Minimum Size Self-Assembled Counters
- Invadable self-assembly: combining robustness with efficiency
- Connecting the Dots: Molecular Machinery for Distributed Robotics
- Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
- Design automation of polyomino set that self-assembles into a desired shape
This page was built for publication: Toward minimum size self-assembled counters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941685)