Identifying shapes using self-assembly
From MaRDI portal
Publication:1934312
DOI10.1007/s00453-011-9549-7zbMath1279.68086OpenAlexW1983873107MaRDI QIDQ1934312
Matthew J. Patitz, Scott M. Summers
Publication date: 28 January 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9549-7
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (5)
Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles ⋮ Optimal staged self-assembly of general shapes ⋮ Producibility in hierarchical self-assembly ⋮ Parallelism and Time in Hierarchical Self-Assembly ⋮ An introduction to tile-based self-assembly and a survey of recent results
Cites Work
- Computability and complexity in self-assembly
- Complexity of graph self-assembly in accretive systems and self-destructible systems
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Negative interactions in irreversible self-assembly
- The program-size complexity of self-assembled squares (extended abstract)
- Reducing tile complexity for self-assembly through temperature programming
- A Self-assembly Model of Time-Dependent Glue Strength
- Polyomino-Safe DNA Self-assembly via Block Replacement
- Running time and program size for self-assembled squares
- On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
- Complexity of Self‐Assembled Shapes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Identifying shapes using self-assembly