Subject
General Computer Science,Theoretical Computer Science
Reference31 articles.
1. L. Adleman, Towards a mathematical theory of self-assembly. Technical Report 00-722, Department of Computer Science, University of Southern California, 2000.
2. L. Adleman, Personal communication, 2001.
3. L. Adleman, J. Kari, L. Kari, D. Reishus, On the decidability of self-assembly of infinite ribbons, in: IEEE Symposium on Foundations of Computer Science, FOCS 2002, 2002, pp. 530–537.
4. The undecidability of the infinite ribbon problem: implications for computing by self-assembly;Adleman;SIAM Journal on Computing,2009
5. Reconstructing convex polyominoes from horizontal and vertical projections;Barcucci;Theoretical Computer Science,1996