Parallel Computation Using Active Self-assembly
From MaRDI portal
Publication:5168495
DOI10.1007/978-3-319-01928-4_2zbMath1409.68098arXiv1405.0527OpenAlexW1487420811MaRDI QIDQ5168495
Moya Chen, Doris Xin, Damien Woods
Publication date: 7 July 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.0527
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Cellular automata (computational aspects) (68Q80)
Related Items
Improved Leader Election for Self-organizing Programmable Matter ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ Tight bounds for active self-assembly using an insertion primitive
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 very hard log-space counting class
- A theory of strict P-completeness
- Tile complexity of approximate squares
- 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
- Realistic Reconfiguration of Crystalline (and Telecube) Robots
- One-Dimensional Staged Self-assembly
- The program-size complexity of self-assembled squares (extended abstract)
- Randomized Self-assembly for Approximate Shapes
- Fast Computation by Population Protocols with a Leader
- 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
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- Randomized Self-Assembly for Exact Shapes
- Algorithms and Computation
This page was built for publication: Parallel Computation Using Active Self-assembly
