Author:
Patitz Matthew J.,Summers Scott M.
Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. Leonard Adleman, Towards a mathematical theory of self-assembly, Tech. report, University of Southern California, 2000.
2. Running time and program size for self-assembled squares;Adleman,2001
3. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W.K. Rothemund, Combinatorial optimization problems in self-assembly, in: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, 2002, pp. 23–32.
4. Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller, Complexities for generalized models of self-assembly, in: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2004.
5. Florent Becker, Ivan Rapaport, Eric Rémila, Self-assembling classes of shapes with a minimum number of tiles, and in optimal time, in: Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 2006, pp. 45–56.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献