Sciweavers

Share
FOCS
2009
IEEE

Randomized Self-Assembly for Exact Shapes

9 years 6 months ago
Randomized Self-Assembly for Exact Shapes
— Working in Winfree’s abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n square with high probability, for any sufficiently large n. This answers an open question of Kao and Schweller (Randomized Self-Assembly for Approximate Shapes, ICALP 2008), who showed how to build an approximately n × n square using tile concentration programming, and asked whether the approximation could be made exact with high probability.
David Doty
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where FOCS
Authors David Doty
Comments (0)
books