Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Reducing tile complexity for self-assembly through temperature programming - MaRDI portal

Reducing tile complexity for self-assembly through temperature programming

From MaRDI portal
Publication:3581583

DOI10.1145/1109557.1109620zbMath1192.90177arXivcs/0602010OpenAlexW2949114084MaRDI QIDQ3581583

Robert T. Schweller, Ming-Yang Kao

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0602010




Related Items (42)

Triangular and Hexagonal Tile Self-assembly SystemsSelf assembly of rectangular shapes on concentration programming and probabilistic tile assembly modelsEfficient 3-SAT algorithms in the tile assembly modelThe complexity of multiple handed self-assemblySelf-assembly of 4-sided fractals in the two-handed tile assembly modelArithmetic computation in the tile assembly model: addition and multiplicationSelf-assembly of infinite structures: a surveyIdentifying shapes using self-assemblyBuilding squares with optimal state complexity in restricted active self-assemblyReducing tile complexity for the self-assembly of scaled shapes through temperature programmingThe need for seed (in the abstract Tile Assembly Model)Complexity of graph self-assembly in accretive systems and self-destructible systemsUnnamed ItemTile complexity of approximate squaresPolyominoes simulating arbitrary-neighborhood zippers and tilingsNondeterministic polynomial time factoring in the tile assembly modelSolving NP-complete problems in the tile assembly modelOn the complexity of graph self-assembly in accretive systemsToward minimum size self-assembled countersStaged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) gluesProgram size and temperature in self-assemblyA minimal requirement for self-assembly of lines in polylogarithmic timeParallel Computation Using Active Self-assemblyExponential Replication of Patterns in the Signal Tile Assembly ModelIterative Self-assembly with Dynamic Strength Transformation and Temperature ControlParallel computation using active self-assemblyExponential replication of patterns in the signal tile assembly modelEfficient algorithms for self assembling non-rectangular nano structuresParallelism and Time in Hierarchical Self-AssemblySelf-assembly of discrete self-similar fractalsSelf-assembly of decidable setsOptimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly SystemsTriangular Tile Self-assembly SystemsRandomized Self Assembly of Rectangular Nano StructuresComplexity of Graph Self-assembly in Accretive Systems and Self-destructible SystemsA Self-assembly Model of Time-Dependent Glue StrengthPath finding in the tile assembly modelExact Shapes and Turing Universality at Temperature 1 with a Single Negative GlueUnnamed ItemConnecting the Dots: Molecular Machinery for Distributed RoboticsSelf-assembly of Discrete Self-similar FractalsUnnamed Item




This page was built for publication: Reducing tile complexity for self-assembly through temperature programming