Author:
Vieira Fabio R. J.,Barbosa Valmir C.
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference43 articles.
1. Adleman L, Cheng Q, Goel A, Huang M-D (2001) Running time and program size for self-assembled squares. In: Proceedings of the 33rd annual ACM symposium on theory of computing, pp 740–748
2. Adleman L, Cheng Q, Goel A, Huang M-D, Kempe D, de Espanés PM, Rothemund PWK (2002) Combinatorial optimization problems in self-assembly. In: Proceedings of 34th annual ACM symposium on theory of computing, pp 23–32
3. Aggarwal G, Cheng Q, Goldwasser MH, Kao M-Y, de Espanés PM, Schweller RT (2005) Complexities for generalized models of self-assembly. SIAM J Comput 34:1493–1515
4. Angelov S, Khanna S, Visontai M (2006). On the complexity of graph self-assembly in accretive systems. In: Mao C, Yokomori T (eds) DNA computing, vol 4287 of Lecture notes in computer science. Springer, Berlin, pp 95–110
5. Back T, Hoffmeister F, Schwefel H-P (1991) A survey of evolution strategies. In: Proceedings of the 4th international conference on genetic algorithms, pp 2–9