Toward minimum size self-assembled counters
From MaRDI portal
Publication:941685
DOI10.1007/S11047-008-9070-3zbMATH Open1154.68417OpenAlexW1996617718MaRDI QIDQ941685FDOQ941685
Authors: Pablo Moisset de Espanés, Ashish Goel 
Publication date: 2 September 2008
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-008-9070-3
Recommendations
Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Title not available (Why is that?)
- Running time and program size for self-assembled squares
- Complexities for generalized models of self-assembly
- DNA Computing
- Reducing tile complexity for self-assembly through temperature programming
- DNA Computing
- Toward Minimum Size Self-Assembled Counters
- Invadable self-assembly: combining robustness with efficiency
Cited In (6)
- Toward Minimum Size Self-Assembled Counters
- Connecting the Dots: Molecular Machinery for Distributed Robotics
- Invadable self-assembly: combining robustness with efficiency
- 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
- Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
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)
