[Lowerbounds, Upperbounds]

Algorithms are everywhere.

The Joint ALADDIN/Theory/Operations Research Seminar

Date: September 16th 2005
Time: 3:30
Place: Wean 7220
Title: Algorithmic Self-Assembly: Models and Problems
Speaker: Ashish Goel, Stanford University

Abstract:
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.

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.

No Comments :(