scientific article; zbMATH DE number 7378684
From MaRDI portal
Publication:5009571
DOI10.4230/LIPICS.ESA.2018.14MaRDI QIDQ5009571
Robert T. Schweller, Tim Wylie, Austin Luchsinger, Cameron T. Chalk
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
The complexity of multiple handed self-assembly ⋮ Covert computation in self-assembled circuits ⋮ Nearly constant tile complexity for any shape in two-handed tile assembly
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The two-handed tile assembly model is not intrinsically universal
- Program size and temperature in self-assembly
- Complexity of graph self-assembly in accretive systems and self-destructible systems
- Complexities for high-temperature two-handed tile self-assembly
- Negative interactions in irreversible self-assembly
- Self-assembly of shapes at constant scale using repulsive forces
- Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly
- Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model
- Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
- Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
- The program-size complexity of self-assembled squares (extended abstract)
- Reducing tile complexity for self-assembly through temperature programming
- Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
- Complexities for Generalized Models of Self-Assembly
- On the Behavior of Tile Assembly System at High Temperatures
- Complexity of Self‐Assembled Shapes
- Fuel Efficient Computation in Passive Self-Assembly
This page was built for publication:
