Author of the publication

The Power of Duples (in Self-Assembly): It's Not So Hip to Be Square.

, , , and . COCOON, volume 8591 of Lecture Notes in Computer Science, page 215-226. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Limitations of Self-Assembly at Temperature 1, , and . CoRR, (2009)Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue., , and . DNA, volume 6937 of Lecture Notes in Computer Science, page 175-189. Springer, (2011)Computability and Complexity in Self-assembly., , , and . Theory Comput. Syst., 48 (3): 617-647 (2011)Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes., , , , , , , and . UCNC, volume 7956 of Lecture Notes in Computer Science, page 174-185. Springer, (2013)Fractal Dimension of Assemblies in the Abstract Tile Assembly Model., , and . UCNC, volume 12984 of Lecture Notes in Computer Science, page 116-130. Springer, (2021)Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM., , , , , , , and . STACS, volume 20 of LIPIcs, page 172-184. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)The Tile Assembly Model is Intrinsically Universal., , , , , and . FOCS, page 302-310. IEEE Computer Society, (2012)Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly., , , , and . DNA, volume 9818 of Lecture Notes in Computer Science, page 98-113. Springer, (2016)New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1., , and . DNA, volume 11648 of Lecture Notes in Computer Science, page 100-119. Springer, (2019)Asynchronous signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient assembly of Shapes., , , , , and . Int. J. Found. Comput. Sci., 25 (4): 459-488 (2014)