{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:23Z","timestamp":1740136163600,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["CCF-1117672","CCF-1555626"],"award-info":[{"award-number":["CCF-1117672","CCF-1555626"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11047-018-9701-2","type":"journal-article","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T16:24:42Z","timestamp":1533140682000},"page":"107-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Verification in staged tile self-assembly"],"prefix":"10.1007","volume":"18","author":[{"given":"Robert","family":"Schweller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,1]]},"reference":[{"key":"9701_CR1","doi-asserted-by":"crossref","unstructured":"Adleman LM, Cheng Q, Goel A, Huang MDA, Kempe D, de Espan\u00e9s PM, Rothemund PWK (2002) Combinatorial optimization problems in self-assembly. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, pp 23\u201332","DOI":"10.1145\/509907.509913"},{"issue":"1","key":"9701_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2013.v009a001","volume":"9","author":"N Bryans","year":"2013","unstructured":"Bryans N, Chiniforooshan E, Doty D, Kari L, Seki S (2013) The power of nondeterminism in self-assembly. Theory Comput 9(1):1\u201329","journal-title":"Theory Comput"},{"key":"9701_CR3","unstructured":"Cannon S, Demaine ED, Demaine ML, Eisenstat S, Patitz MJ, Schweller RT, Summers SM, Winslow A (2013) Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: STACS 2013, LIPIcs, vol 20. Schloss Dagstuhl, pp 172\u2013184"},{"key":"9701_CR4","unstructured":"Chalk C, Martinez E, Schweller R, Vega L, Winslow A, Wylie T (2016) Optimal staged self-assembly of general shapes. In: Proceedings of the 24th European symposium of algorithms, LIPIcs, vol 57. Schloss Dagstuhl, pp 26:1\u201326:17"},{"key":"9701_CR5","doi-asserted-by":"crossref","unstructured":"Chalk C, Schweller R, Winslow A, Wylie T (2017) Too hot 2HAMdle: high-temperature two-handed self-assembly. Under submission","DOI":"10.1007\/978-3-319-66799-7_7"},{"key":"9701_CR6","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704446037","volume":"34","author":"Q Cheng","year":"2005","unstructured":"Cheng Q, Aggarwal G, Goldwasser MH, Kao MY, Schweller RT, de Espan\u00e9s PM (2005) Complexities for generalized models of self-assembly. SIAM J Comput 34:1493\u20131515","journal-title":"SIAM J Comput"},{"issue":"3","key":"9701_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"ED Demaine","year":"2008","unstructured":"Demaine ED, Demaine ML, Fekete SP, Ishaque M, Rafalin E, Schweller RT, Souvaine DL (2008) Staged self-assembly: nanomanufacture of arbitrary shapes with $${O}(1)$$ glues. Nat Comput 7(3):347\u2013370","journal-title":"Nat Comput"},{"key":"9701_CR8","doi-asserted-by":"crossref","unstructured":"Demaine ED, Eisenstat S, Ishaque M, Winslow A (2011) One-dimensional staged self-assembly. In: Proceedings of the 17th international conference on DNA computing and molecular programming, DNA\u201911, pp 100\u2013114","DOI":"10.1007\/978-3-642-23638-9_10"},{"key":"9701_CR9","doi-asserted-by":"crossref","unstructured":"Demaine ED, Fekete SP, Scheffer C, Schmidt A (2015) New geometric algorithms for fully connected staged self-assembly. In: DNA computing and molecular programming, LNCS, vol 9211. Springer, pp 104\u2013116","DOI":"10.1007\/978-3-319-21999-8_7"},{"key":"9701_CR10","doi-asserted-by":"crossref","unstructured":"Doty D (2014) Producibility in hierarchical self-assembly. In: Proceedings of unconventional computation and natural computation (UCNC), LNCS, vol 8553. Springer, pp 142\u2013154","DOI":"10.1007\/978-3-319-08123-6_12"},{"key":"9701_CR11","unstructured":"Lagoudakis MG, Labean TH (1999) 2d dna self-assembly for satisfiability. In: 5th international meeting on DNA based computers"},{"issue":"3","key":"9701_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/582475.582484","volume":"33","author":"M Schaefer","year":"2002","unstructured":"Schaefer M, Umans C (2002) Completeness in the polynomial-time hierarchy: a compendium. SIGACT News 33(3):32\u201349","journal-title":"SIGACT News"},{"issue":"1","key":"9701_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1976","unstructured":"Stockmeyer LJ (1976) The polynomial-time hierarchy. Theor Comput Sci 3(1):1\u201322","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9701_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s11047-014-9423-z","volume":"14","author":"A Winslow","year":"2015","unstructured":"Winslow A (2015) Staged self-assembly and polyomino context-free grammars. Nat Comput 14(2):293\u2013302","journal-title":"Nat Comput"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-018-9701-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9701-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9701-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:22:54Z","timestamp":1589415774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-018-9701-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["9701"],"URL":"https:\/\/doi.org\/10.1007\/s11047-018-9701-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2018,8,1]]},"assertion":[{"value":"1 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}