Algorithmic Self-Assembly: Models and Problems
Speaker: Ashish Goel , Stanford
Date: September 20 2005
Time: 4:15PM to 5:30PM
Location: 32-G449 (Kiva)
Host: TOC Seminar
Contact: Seth Gilbert, 617-253-7583, toc-seminar-planners@lists.csail.mit.edu
Relevant URL: DNA Self-assembly has emerged as an important technique for
molecular computation and nano-technology. At these scales, self-
assembly is governed by simple (and local) probabilistic rules for
growth, making it amenable to algorithmic techniques. We will discuss
two important challenges in algorithmic self-assembly: robustness and
efficiency. This talk will present recent results, and also attempt
to provide a road-map of open problems.
See other events that are part of Theory Colloquium Fall 2005
See other events happening in September 2005
