Complexities for generalized models of self-assembly

13 years 5 months ago

Download www.cs.panam.edu

In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile complexity of assembling an N

Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang K

Real-time Traffic

Algorithms | Lower Bound | SODA 2004 | Tile | Tile Complexity |

claim paper

» Modeling SelfAssembly Across Scales The Unifying Perspective of Smart Minimal Particles

» Modeling Virus SelfAssembly Pathways Avoiding Dynamics Using Geometric Constraint Decompos...

» Global Energy Matching Method for AtomistictoContinuum Modeling of SelfAssembling Biopolym...

» SelfAssembled Circuit Patterns

» Memory Consistency Conditions for SelfAssembly Programming

» Checkpointing of Rectilinear Growth in DNA SelfAssembly

» On Times to Compute Shapes in 2D Tile Selfassembly

» Brief announcement selfassembly as graph grammar as distributed system

» Structured Hidden Markov Model A General Framework for Modeling Complex Sequences

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SODA
Authors	Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller

Comments (0)

Sciweavers

Complexities for generalized models of self-assembly

Algorithms | Lower Bound | SODA 2004 | Tile | Tile Complexity |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers