Sciweavers

42 search results - page 5 / 9
» The Tile Complexity of Linear Assemblies
Sort
View
CIE
2010
Springer
14 years 7 days ago
Approximate Self-assembly of the Sierpinski Triangle
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
Jack H. Lutz, Brad Shutters
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
STACS
2007
Springer
14 years 1 months ago
On the Complexity of Unary Tiling-Recognizable Picture Languages
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...
NC
2008
13 years 7 months ago
How crystals that sense and respond to their environments could evolve
An enduring mystery in biology is how a physical entity simple enough to have arisen spontaneously could have evolved into the complex life seen on Earth today. Cairns-Smith has pr...
Rebecca Schulman, Erik Winfree
DNA
2008
Springer
149views Bioinformatics» more  DNA 2008»
13 years 9 months ago
Connecting the Dots: Molecular Machinery for Distributed Robotics
Abstract. Nature is considered one promising area to search for inspiration in designing robotic systems. Some work in swarm robotics has tried to build systems that resemble distr...
Yuriy Brun, Dustin Reishus