The Complexity of Multiple Handed Self-assembly

[1]  Ming-Yang Kao,et al.  Complexities for generalized models of self-assembly , 2004, SODA '04.

[2]  Sándor P. Fekete,et al.  Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability , 2015, ISAAC.

[3]  Andrew Winslow,et al.  Complexities for High-Temperature Two-Handed Tile Self-assembly , 2017, DNA.

[4]  Andrew Winslow,et al.  Verification in staged tile self-assembly , 2018, Natural Computing.

[5]  Sanguthevar Rajasekaran,et al.  Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models , 2012, Natural Computing.

[6]  Ivan Rapaport,et al.  Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time , 2006, FSTTCS.

[7]  David Doty,et al.  Theory of algorithmic self-assembly , 2012, CACM.

[8]  Damien Woods,et al.  Intrinsic universality and the computational power of self-assembly , 2013, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[9]  Erik D. Demaine,et al.  Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues , 2008, Natural Computing.

[10]  Ming-Yang Kao,et al.  Randomized Self-assembly for Approximate Shapes , 2008, ICALP.

[11]  Andrew Winslow,et al.  Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly , 2019, Algorithmica.

[12]  W. Shih,et al.  Robust nucleation control via crisscross polymerization of highly coordinated DNA slats , 2021, Nature Communications.

[13]  David Doty Producibility in Hierarchical Self-assembly , 2014, UCNC.

[14]  Scott M. Summers Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming , 2011, Algorithmica.

[15]  Matthew J. Patitz An introduction to tile-based self-assembly and a survey of recent results , 2014, Natural Computing.

[16]  Ming-Yang Kao,et al.  Reducing tile complexity for self-assembly through temperature programming , 2006, SODA '06.

[17]  David Doty Randomized Self-Assembly for Exact Shapes , 2010, SIAM J. Comput..

[18]  Erik Winfree,et al.  Diverse and robust molecular algorithms using reprogrammable DNA self-assembly , 2019, Nature.

[19]  E. Chiniforooshan,et al.  The Power of Nondeterminism in Self-Assembly , 2018 .

[20]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[21]  Ashish Goel,et al.  Combinatorial optimization problems in self-assembly , 2002, STOC '02.

[22]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[23]  Lukasz Kowalik,et al.  Short Cycles in Planar Graphs , 2003, WG.

[24]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[25]  Robert T. Schweller,et al.  Strict Self-Assembly of Fractals Using Multiple Hands , 2015, Algorithmica.