Complexes of on-line self assembly
暂无分享,去创建一个
[1] Leonard M. Adleman,et al. Theory and experiments in algorithmic self-assembly , 2001 .
[2] John H. Reif,et al. Molecular Assembly and Computation: From Theory to Experimental Demonstrations , 2002, ICALP.
[3] Jack H. Lutz,et al. Strict Self-assembly of Discrete Sierpinski Triangles , 2007, CiE.
[4] Erik Winfree,et al. Complexity of Self-Assembled Shapes , 2004, SIAM J. Comput..
[5] Hao Wang. Proving theorems by pattern recognition — II , 1961 .
[6] M. Sahani,et al. Algorithmic Self-Assembly of DNA , 2006 .
[7] A Paul Alivisatos,et al. Two-dimensional nanoparticle arrays show the organizational power of robust DNA motifs. , 2006, Nano letters.
[8] Ming-Yang Kao,et al. Complexities for generalized models of self-assembly , 2004, SODA '04.
[9] Erik Winfree,et al. The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.
[10] M. Fujise,et al. Pattern reconfigurable leaky-wave antenna design by FDTD method and Floquet's Theorem , 2005, IEEE Transactions on Antennas and Propagation.
[11] Hao Wang,et al. Proving theorems by pattern recognition I , 1960, Commun. ACM.
[12] P. Rothemund. Folding DNA to create nanoscale shapes and patterns , 2006, Nature.
[13] Robert L. Berger. The undecidability of the domino problem , 1966 .