Leonard Adleman, Qi Cheng, Ashish Goel, Ming-Deh Huang, David Kempe  Home/Search
Context Related
| usc.edu/~agoel/pap...e_self_assembly.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: usc.edu/~agoel/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self-assembly proposed by Rothemund and Winfree [18]. The first is the Minimum... (Update)
Similar documents based on text: More All
1.4: Running Time and Program Size for Self-assembled Squares - Adleman, Cheng, Goel, Huang (2001) (Correct)
0.8: Optimal Self-Assembly of Counters at - Temperature Two Qi (Correct)
0.7: Multi-Batch Micro-Selfassembly via Controlled.. - Xiong, Hanein, Wang.. (2001) (Correct)
BibTeX entry: (Update)
L. Adleman, Q. Cheng, A. Goel, M.-D. Huang, D. Kempe, P. Moisset de Espans, and P. Rothemund. Combinatorial optimization problems in self-assembly. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 23--32. ACM Press, 2002. http://citeseer.ist.psu.edu/adleman02combinatorial.html More
@misc{ adleman-combinatorial,
author = "Leonard Adleman and Qi Cheng and Ashish Goel and Ming-Deh Huang and David
Kempe",
title = "Combinatorial Optimization Problems in Self-Assembly",
url = "citeseer.ist.psu.edu/adleman02combinatorial.html" }
Citations (may not include all citations):53 A Polynomial Algorithm in Linear Programming (context) - Khachian - 1979
32 Universal Computation via Self-assembly of DNA: Some Theory .. - Winfree, Yang et al. - 1996
31 Design and self-assembly of two-dimensional DNA crystals (context) - Winfree, Liu et al. - 1998
17 Proving theorems by pattern recognition (context) - Wang - 1961
15 The program-size complexity of self-assembled squares (context) - Rothemund, Winfree - 2001
12 Logical computation using algorithmic self-assembly of DNA t.. (context) - Mao, LaBean et al. - 2000
12 Molecular self-assembly and nanochemistry: a chemical strate.. (context) - Whitesides, Mathias et al. - 1991
11 Personal communication (context) - Cook, Kempe et al.
11 Computational complexity of loss networks - Louth, Mitzenmacher et al. - 1994
10 California Institute of Technology (context) - Winfree, of et al. - 1998
9 Towards a mathematical theory of self-assembly (context) - Adleman - 2000
7 Running time and program size for self-assembled squares - Adleman, Cheng et al. - 2001
7 Using lateral capillary forces to compute by self-assembly (context) - Rothemund - 2000
6 DNA Self-Assembly for Satisfiability (context) - Lagoudakis, LaBean - 1999
6 Theory and Experiments in Algorithmic Self-Assembly Universi.. (context) - Rothemund - 2001
[Article contains additional citations not shown here]
Documents on the same site (http://cs.usc.edu/~agoel/research.html): More
Extending Greedy Multicast Routing to Delay Sensitive.. - Goel, Munagala (1999) (Correct)
Reductions Among High Dimensional Proximity Problems - Goel, Indyk, Varadarajan (2000) (Correct)
Distributed Admission Control, Scheduling, and Routing.. - Goel, Meyerson, Plotkin (2000) (Correct)
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