1. Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Symposium on Theory of Computing, pp. 740–748 (2001)
2. Aggarwal, G., Cheng, Q., Goldwasser, M.H., Kao, M.Y., de Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM J. Comput. 34(6), 1493–1515 (2005)
3. Andersen, E., Dong, M., Nielsen, M., Jahn, K., Subramani, R., Mamdouh, W., Golas, M., Sander, B., Stark, H., Oliveira, C., Pedersen, J.S., Birkedal, V., Besenbacher, F., Gothelf, K., Kjems, J.: Self-assembly of a nanoscale DNA box with a controllable lid. Nature 459(7243), 73–76 (2009)
4. Barish, R., Rothemund, P., Winfree, E.: Two computational primitives for algorithmic self-assembly: copying and counting. Nano Lett. 5, 2586–2592 (2005)
5. Becker, F., Rapaport, I., Remila, E.: Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time. In: Foundations of Software Technology and Theoretical Computer Science, pp. 45–56 (2006)