1. Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, STOC’01, pp. 740–748 (2001)
2. Bryans, N., Chiniforooshan, E., Doty, D., Kari, L., Seki, S.: The power of nondeterminism in self-assembly. In: Proceedings of the 22nd ACM–SIAM Symposium on Discrete Algorithms, SODA’11, pp. 590–602. SIAM (2011)
3. Cannon, S., Demaine, E.D., Demaine, M.L., Eisenstat, S., Patitz, M.J., Schweller, R., Summers, S.M., Winslow, A.: Two hands are better than one (up to constant factors). In: Proceedings of 30th International Symposium on Theory Aspects of Computing Science, STACS’13, pp. 172–184 (2013)
4. Chalk, C., Luchsinger, A., Schweller, R., Wylie, T.: Self-assembly of any shape with constant tile types using high temperature. In: Proceedings of the 26th Annual European Symposium on Algorithms, ESA’18 (2018)
5. Chen, H.L., Doty, D.: Parallelism and time in hierarchical self-assembly. In: Proceedings of the 23rd ACM–SIAM Symposium on Discrete Algorithms, SODA’12, pp. 1163–1182. SIAM (2012)