1. Adleman LM, Cheng Q, Goel A, Huang MD (2001) Running time and program size for self-assembled squares. In: STOC 2001: proceedings of the 33rd annual ACM symposium on theory of computing, Hersonissos. ACM, pp 740–748
2. Bath J, Turberfield A (2007) DNA nanomachines. Nat Nanotechnol 2:275–284
3. Chen M, Xin D, Woods D (2013) Parallel computation using active self-assembly. In: DNA19: the 19th international conference on DNA computing and molecular programming. LNCS, vol 8141. Springer, pp 16–30. arxiv preprint arXiv:1405.0527
4. Chen HL, Doty D, Holden D, Thachuk C, Woods D, Yang CT (2014) Fast algorithmic self-assembly of simple shapes using random agitation. In: DNA20: the 20th international conference on DNA computing and molecular programming. LNCS, vol 8727. Springer, pp 20–36. arxiv preprint: arXiv:1409.4828
5. Keenan A, Schweller R, Sherman M, Zhong X (2014) Fast arithmetic in algorithmic self-assembly. In: UCNC: the 13th international conference on unconventional computation and natural computation. LNCS, vol 8553. Springer, pp 242–253. arxiv preprint arXiv:1303.2416 [cs.DS]