Sciweavers

144 search results - page 1 / 29
» Running time and program size for self-assembled squares
Sort
View
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
11 years 7 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 5 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...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 5 months ago
The Power of Nondeterminism in Self-Assembly
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...
Nathaniel Bryans, Ehsan Chiniforooshan, David Doty...
IPPS
1999
IEEE
13 years 9 months ago
Run-Time Selection of Block Size in Pipelined Parallel Programs
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
David K. Lowenthal, Michael James
ASPLOS
1996
ACM
13 years 9 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel