Parallel computation using active self-assembly

DOI10.1007/s11047-014-9432-yzbMath1415.68074OpenAlexW2562659721MaRDI QIDQ2003467

Moya Chen, Damien Woods, Doris Xin

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20150623-152317840

zbMATH Keywords

computational complexityself-assemblymolecular robotics

Mathematics Subject Classification ID

Related Items (3)

A stochastic approach to shortcut bridging in programmable matter ⋮ Unnamed Item ⋮ On the Runtime of Universal Coating for Programmable Matter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight bounds for active self-assembly using an insertion primitive
• Rainbow sort: Sorting at the speed of light
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Complexity classes for self-assembling flexible tiles
• Computation with finite stochastic chemical reaction networks
• A theory of strict P-completeness
• Tile complexity of approximate squares
• Fast arithmetic in algorithmic self-assembly
• Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model
• Self-assembly with Geometric Tiles
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• One-Dimensional Staged Self-assembly
• Intrinsic Universality in Self-Assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Randomized Self-assembly for Approximate Shapes
• Amplifying lower bounds by means of self-reducibility
• Reducing tile complexity for self-assembly through temperature programming
• Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
• P-completeness of Cellular Automaton Rule 110
• An Introduction to Tile-Based Self-assembly
• One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
• Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
• Complexities for Generalized Models of Self-Assembly
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
• Intrinsic universality in tile self-assembly requires cooperation
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Randomized Self-Assembly for Exact Shapes
• ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION
• Active Self-Assembly of Simple Units Using an Insertion Primitive
• Algorithms and Computation

This page was built for publication: Parallel computation using active self-assembly