L. Adleman, A. Goel, M. Huang, and P. Moisset de Espanes. Running time and program size for selfassembled squares. In Proceedings of the Annual ACM Symposium on Theory of Computing(STOC). ACM Press, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Invadable Self-Assembly: Combining Robustness with Eciency - Ho-Lin Chen Qi (2004) (1 citation) Self-citation (Cheng Goel Huang) (Correct)
No context found.
L. Adleman, Q. Cheng, A. Goel, and M.-D. Huang. Running time and program size for self-assembled squares. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 740--748. ACM Press, 2001.
Optimal Self-Assembly of Counters at - Temperature Two Qi Self-citation (Cheng Goel) (Correct)
No context found.
L. Adleman, Q. Cheng, A. Goel, and M. Huang. Running time and program size for selfassembled squares. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 740--748. ACM Press, 2001.
Invadable Self-Assembly: Combining Robustness with Eciency - Ho-Lin Chen Qi (2004) (1 citation) Self-citation (Cheng Goel Huang) (Correct)
No context found.
L. Adleman, Q. Cheng, A. Goel, and M.-D. Huang. Running time and program size for self-assembled squares. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 740--748. ACM Press, 2001.
Error Free Self-Assembly using Error Prone Tiles - Ho-Lin Chen Ashish Self-citation (Goel) (Correct)
No context found.
L. Adleman, Q. Cheng, A. Goel, and M.-D. Huang. Running time and program size for self-assembled squares. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 740--748. ACM Press, 2001.
Combinatorial Optimization Problems in Self-Assembly - Adleman, Cheng, Goel.. (2002) (3 citations) Self-citation (Adleman Cheng Goel Huang) (Correct)
....complexity theoretic questions about the Tile Assembly Model. In particular, some of the recent work has focused on the assembly of n n squares. Rothemund and Winfree [18] studied the program size complexity (the number of di#erent tile types required) of assembling such squares. Adleman et al. [4] added the notion of time complexity to the Tile Assembly Model and applied it to such squares. To analyze the assembly time for a shape, they describe the assembly process as a continuous time Markov chain. The assembly time depends not only on the tile system, but also on the relative ....
....obtain upper and lower bounds on the approximation ratio for the Minimum Tile Set Problem. For the Tile Concentrations Problem, we conjecture that finding an optimum solution is #P hard. We then define partial order systems; such systems include tile systems that count [18] assemble into squares [18, 4] and trees, perform base conversion of numbers [4] simulate Turing machines [23, 18] and simulate 1 dimensional cellular automata. We present a polynomial time, O(log n) approximation algo The algorithm for squares assumes a constant temperature; see section 4 for details. rithm for the Tile ....
[Article contains additional citation context not shown here]
L. Adleman, Q. Cheng, A. Goel and M. Huang, Running time and program size for self-assembled squares, ACM Symposium on Theory of Computing (STOC) 2001. pages 740-748.
Automated Tile Design for Self-Assembly Conformations - Terrazas, Krasnogor.. (Correct)
No context found.
L. Adleman, A. Goel, M. Huang, and P. Moisset de Espanes. Running time and program size for selfassembled squares. In Proceedings of the Annual ACM Symposium on Theory of Computing(STOC). ACM Press, 2001.
Automated Tile Design for Self-Assembly Conformations - Terrazas, Krasnogor.. (Correct)
No context found.
L. Adleman, A. Goel, M. Huang, and P. Moisset de Espanes. Running time and program size for selfassembled squares. In Proceedings of the Annual ACM Symposium on Theory of Computing(STOC). ACM Press, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC