{"id":107,"date":"2017-10-08T18:34:19","date_gmt":"2017-10-08T18:34:19","guid":{"rendered":"https:\/\/asarg.hackresearch.com\/main\/?p=107"},"modified":"2018-03-21T21:57:36","modified_gmt":"2018-03-21T21:57:36","slug":"optimal-staged-self-assembly-of-general-shapes","status":"publish","type":"post","link":"https:\/\/asarg.hackresearch.com\/main\/2017\/10\/08\/optimal-staged-self-assembly-of-general-shapes\/","title":{"rendered":"Optimal Staged Self-Assembly of General Shapes"},"content":{"rendered":"<p>Title: Optimal Staged Self-Assembly of General Shapes<br \/>\nAuthors: Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie<br \/>\nAbstract:<br \/>\nWe analyze the number of tile types t, bins b, and stages necessary to assemble \\(n \\times n\\) squares and scaled shapes in the staged tile assembly model. For \\(n \\times n\\) squares, we prove \\(\\mathcal {O}\\left( \\frac{\\log {n} &#8211; tb &#8211; t\\log t}{b^2} + \\frac{\\log \\log b}{\\log t}\\right) \\) stages suffice and \\(\\varOmega \\left( \\frac{\\log {n} &#8211; tb &#8211; t\\log t}{b^2}\\right) \\) are necessary for almost all n. For shapes S with Kolmogorov complexity K(S), we prove \\(\\mathcal {O}\\left( \\frac{K(S) &#8211; tb &#8211; t\\log t}{b^2} + \\frac{\\log \\log b}{\\log t}\\right) \\) stages suffice and \\(\\varOmega \\left( \\frac{K(S) &#8211; tb &#8211; t\\log t}{b^2}\\right) \\) are necessary to assemble a scaled version of S, for almost all S. We obtain similarly tight bounds when the more powerful flexible glues are permitted.<br \/>\nPublished: Arxiv, European Symposium on Algorithms (ESA&#8217;16), Algorithmica<\/p>\n<p>URL: https:\/\/link.springer.com\/article\/10.1007\/s00453-017-0318-0<\/p>\n<p>Journal Citation: Algorithmica, 80(4), 1383-1409, 2018. <\/p>\n<p>Bibtex:<br \/>\n@article{CMSVWW:2018:Algorithmica,<br \/>\n    author=&#8221;Chalk, Cameron and Martinez, Eric and Schweller, Robert and Vega, Luis and Winslow, Andrew and Wylie, Tim&#8221;,<br \/>\n    title=&#8221;Optimal Staged Self-Assembly of General Shapes&#8221;,<br \/>\n    journal=&#8221;Algorithmica&#8221;,<br \/>\n    year=&#8221;2018&#8243;,<br \/>\n    month=&#8221;Apr&#8221;,<br \/>\n    day=&#8221;01&#8243;,<br \/>\n    volume=&#8221;80&#8243;,<br \/>\n    number=&#8221;4&#8243;,<br \/>\n    pages=&#8221;1383&#8211;1409&#8243;,<br \/>\n    issn=&#8221;1432-0541&#8243;,<br \/>\n    doi=&#8221;10.1007\/s00453-017-0318-0&#8243;,<br \/>\n    url=&#8221;https:\/\/doi.org\/10.1007\/s00453-017-0318-0&#8243;<br \/>\n}<\/p>\n<p>Conference Citation: Proceedings of the 24th European Symposium of Algorithms (ESA&#8217;16), 57, 26:1&#8211;26:17, 2016. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Title: Optimal Staged Self-Assembly of General Shapes Authors: Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie Abstract: We analyze the number of tile types t, bins b, and stages necessary to assemble \\(n \\times n\\) squares and scaled shapes in the staged tile assembly model. For \\(n \\times n\\) squares, we &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/asarg.hackresearch.com\/main\/2017\/10\/08\/optimal-staged-self-assembly-of-general-shapes\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Optimal Staged Self-Assembly of General Shapes&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[20,19,17,21,11,18,13,12,9],"_links":{"self":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts\/107"}],"collection":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/comments?post=107"}],"version-history":[{"count":5,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts\/107\/revisions"}],"predecessor-version":[{"id":195,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts\/107\/revisions\/195"}],"wp:attachment":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/media?parent=107"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/categories?post=107"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/tags?post=107"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}