Capabilities and limits of compact error resilience methods for algorithmic self-assembly

DOI10.1007/S00453-008-9187-XzbMATH Open1194.68118OpenAlexW2147285668MaRDI QIDQ848844FDOQ848844

Authors: Sudheer Sahu, J. Reif 

Publication date: 23 February 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9187-x

Recommendations

• Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions
• DNA Computing
• DNA Computing
• DNA Computing
• Complexity of Compact Proofreading for Self-assembled Patterns

zbMATH Keywords

error analysisalgorithmic self-assemblyBoolean functionserror resilience

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Programmable control of nucleation for algorithmic self-assembly
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of Self‐Assembled Shapes
• DNA Computing
• Title not available (Why is that?)
• Invadable self-assembly: combining robustness with efficiency
• Title not available (Why is that?)
• Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions

Cited In (3)

• DNA Computing
• Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions
• Complexity of Compact Proofreading for Self-assembled Patterns

This page was built for publication: Capabilities and limits of compact error resilience methods for algorithmic self-assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848844)