Tight bounds for active self-assembly using an insertion primitive
From MaRDI portal
Publication:513280
DOI10.1007/s00453-015-0085-8zbMath1359.68071arXiv1401.0359OpenAlexW2964204604MaRDI QIDQ513280
Caleb Malchik, Andrew Winslow, Benjamin J. Hescott
Publication date: 3 March 2017
Published in: Algorithmica, Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0359
Related Items (3)
Unnamed Item ⋮ Tight bounds for active self-assembly using an insertion primitive ⋮ Parallel computation using active self-assembly
Cites Work
- Unnamed Item
- Tight bounds for active self-assembly using an insertion primitive
- Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles
- Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model
- Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation
- ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- The program-size complexity of self-assembled squares (extended abstract)
- Parallel Computation Using Active Self-assembly
- Exponential Replication of Patterns in the Signal Tile Assembly Model
- Running time and program size for self-assembled squares
- Complexity of Self‐Assembled Shapes
- Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
- ACTIVE TILE SELF-ASSEMBLY, PART 1: UNIVERSALITY AT TEMPERATURE 1
- ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION
- Active Self-Assembly of Simple Units Using an Insertion Primitive
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Tight bounds for active self-assembly using an insertion primitive
