Skip to main content
SpringerLink
Log in

Randomized Self-Assembly

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 46 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Supported by NSF grants CCF-1219274, CCF-1162589, and 1317694.

Recommended Reading

  1. Becker F, Rapaport I, Rémila E (2006) Self-assembling classes of shapes with a minimum number of tiles, and in optimal time. In: FSTTCS 2006: foundations of software technology and theoretical computer science, Kolkata, pp 45–56

    Google Scholar 

  2. Chandran H, Gopalkrishnan N, Reif JH (2012) Tile complexity of linear assemblies. SIAM J Comput 41(4):1051–1073. Preliminary version appeared in ICALP 2009

    Google Scholar 

  3. Doty D (2010) Randomized self-assembly for exact shapes. SIAM J Comput 39(8):3521–3552. Preliminary version appeared in FOCS 2009

    Google Scholar 

  4. Kao M-Y, Schweller RT (2008) Randomized self-assembly for approximate shapes. In: ICALP 2008: international colloqium on automata, languages, and programming, Reykjavik. Volume 5125 of Lecture notes in computer science. Springer, pp 370–384

    Google Scholar 

  5. Soloveichik D, Winfree E (2007) Complexity of self-assembled shapes. SIAM J Comput 36(6):1544–1569. Preliminary version appeared in DNA 2004

    Google Scholar 

  6. Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology, June 1998

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA, USA

    David Doty

Authors
  1. David Doty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Doty .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Doty, D. (2016). Randomized Self-Assembly. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_669

Download citation

Publish with us

Policies and ethics

Search

Navigation