1. Adleman, L.: Towards a mathematical theory of self-assembly. Technical Report 00-722, Department of Computer Science, University of Southern California (2000)
2. 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)
3. Adleman, L., Cheng, Q., Goel, A., Huang, M.-D., Kempe, D., Moisset de Espans, P., Rothemund, P.: Combinatorial optimization problems in self-assembly. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 23–32. ACM Press, New York (2002)
4. Chen, H., Cheng, Q., Goel, A., Huang, M.-D., Moisset de Espans, P.: Invadable self-assembly: Combining robustness with efficiency. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 883–892 (2004)
5. Lagoudakis, M., LaBean, T.: 2D DNA self-assembly for satisfiability. In: Proceedings of the 5th DIMACS Workshop on DNA Based Computers in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 54, MIT, Cambridge (1999)