{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:42Z","timestamp":1759638642966},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037443"},{"type":"electronic","value":"9783642037450"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03745-0_19","type":"book-chapter","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:57:31Z","timestamp":1251766651000},"page":"143-157","source":"Crossref","is-referenced-by-count":4,"title":["Random Number Selection in Self-assembly"],"prefix":"10.1007","author":[{"given":"David","family":"Doty","sequence":"first","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Woods","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1145\/380752.380881","volume-title":"STOC 2001: Proceedings of the thirty-third annual ACM Symposium on Theory of Computing","author":"L. Adleman","year":"2001","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: STOC 2001: Proceedings of the thirty-third annual ACM Symposium on Theory of Computing, pp. 740\u2013748. ACM, New York (2001)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11944836_7","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"F. Becker","year":"2006","unstructured":"Becker, F., Rapaport, I., R\u00e9mila, E.: Self-assembling classes of shapes with a minimum number of tiles, and in optimal time. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 45\u201356. Springer, Heidelberg (2006)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Goel, A.: Error free self-assembly with error prone tiles. In: Proceedings of the 10th International Meeting on DNA Based Computers (2004)","DOI":"10.1007\/11493785_6"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Demaine, M.L., Fekete, S.P., Ishaque, M., Rafalin, E., Schweller, R.T., Souvaine, D.L.: Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues. Natural Computing\u00a07(3), 347\u2013370 (2008)","journal-title":"Natural Computing"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Doty, D.: Randomized self-assembly for exact shapes, Tech. Report 0901.1849, Computing Research Repository (2009)","DOI":"10.1109\/FOCS.2009.13"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Fujibayashi, K., Zhang, D.Y., Winfree, E., Murata, S.: Error suppression mechanisms for dna tile self-assembly and their simulation. Natural Computing (to appear)","DOI":"10.1007\/s11047-008-9093-9"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-70575-8_31","volume-title":"Automata, Languages and Programming","author":"M.-Y. Kao","year":"2008","unstructured":"Kao, M.-Y., Schweller, R.T.: Randomized self-assembly for approximate shapes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 370\u2013384. Springer, Heidelberg (2008)"},{"key":"19_CR8","series-title":"Seminumerical algorithms","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming. Seminumerical algorithms, vol.\u00a02. Addison-Wesley, Reading (1997)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-69407-6_38","volume-title":"Logic and Theory of Algorithms","author":"J.I. Lathrop","year":"2008","unstructured":"Lathrop, J.I., Lutz, J.H., Patitz, M.J., Summers, S.M.: Computability and complexity in self-assembly. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 349\u2013358. Springer, Heidelberg (2008)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"J.I. Lathrop","year":"2009","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theoretical Computer Science\u00a0410, 384\u2013405 (2009)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-77962-9_2","volume-title":"DNA Computing","author":"U. Majumder","year":"2008","unstructured":"Majumder, U., LaBean, T.H., Reif, J.H.: Activatable tiles: Compact, robust programmable assembly and other applications. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol.\u00a04848, pp. 15\u201325. Springer, Heidelberg (2008)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-540-85194-3_17","volume-title":"Unconventional Computation","author":"M.J. Patitz","year":"2008","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of decidable sets. In: Calude, C.S., Costa, J.F., Freund, R., Oswald, M., Rozenberg, G. (eds.) UC 2008. LNCS, vol.\u00a05204, pp. 206\u2013219. Springer, Heidelberg (2008)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of discrete self-similar fractals (extended abstract). In: Proceedings of The Fourteenth International Meeting on DNA Computing, Prague, Czech Republic, June 2-6 (2008) (to appear)","DOI":"10.1007\/978-3-642-03076-5_13"},{"key":"19_CR14","unstructured":"Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/335305.335358","volume-title":"STOC 2000: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing","author":"P.W.K. Rothemund","year":"2000","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC 2000: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing, pp. 459\u2013468. ACM, New York (2000)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biology\u00a02(12) (2004)","DOI":"10.1371\/journal.pbio.0020424"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"N.C. Seeman","year":"1982","unstructured":"Seeman, N.C.: Nucleic-acid junctions and lattices. Journal of Theoretical Biology\u00a099, 237\u2013247 (1982)","journal-title":"Journal of Theoretical Biology"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11753681_24","volume-title":"DNA Computing","author":"D. Soloveichik","year":"2006","unstructured":"Soloveichik, D., Winfree, E.: Complexity of compact proofreading for self-assembled patterns. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol.\u00a03892, pp. 305\u2013324. Springer, Heidelberg (2006)"},{"issue":"6","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D. Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal on Computing\u00a036(6), 1544\u20131569 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/11925903_15","volume-title":"DNA Computing","author":"T.H. LaBean","year":"2006","unstructured":"LaBean, T.H., Majumder, U., Sahu, S., Reif, J.H.: Design and simulation of self-repairing DNA lattices. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol.\u00a04287, pp. 195\u2013214. Springer, Heidelberg (2006)"},{"key":"19_CR21","first-page":"768","volume-title":"von Neumann\u2019s Collected Works","author":"J. Neumann von","year":"1963","unstructured":"von Neumann, J.: Various techniques for use in connection with random digits. In: von Neumann\u2019s Collected Works, vol.\u00a05, pp. 768\u2013770. Pergamon, Oxford (1963)"},{"key":"19_CR22","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology (June 1998)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-24628-2_13","volume-title":"DNA Computing","author":"E. Winfree","year":"2004","unstructured":"Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error correction for algorithmic self-assembly. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol.\u00a02943, pp. 126\u2013144. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03745-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T18:29:34Z","timestamp":1590085774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03745-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037443","9783642037450"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03745-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}