1. http://mrsec.wisc.edu/edetc/selfassembly/
2. Adleman, L.: Towards a mathematical theory of self-assembly. Technical Report 00-722, University of Southern California (2000)
3. Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 740–748. ACM Press, New York (2001)
4. Adleman, L., Cheng, Q., Goel, A., Huang, M.D., Kempe, D., de Espans, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 23–32. ACM Press, New York (2002)
5. Adleman, L., Cheng, Q., Goel, A., Huang, M.D., Wasserman, H.: Linear self-assemblies: Equilibria, entropy, and convergence rate. In: Sixth International Conference on Difference Equations and Applications (2001)