Self-correcting Self-assembly: Growth Models and the Hammersley Process
From MaRDI portal
Recommendations
Cites work
- A Stochastic Checkpoint Optimization Problem
- Combinatorial optimization problems in self-assembly
- DNA Computing
- DNA Computing
- DNA Computing
- DNA Computing
- Hammersley's interacting particle process and longest increasing subsequences
- scientific article; zbMATH DE number 2152822 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- scientific article; zbMATH DE number 3222108 (Why is no real title available?)
- Invadable self-assembly: combining robustness with efficiency
- On Times to Compute Shapes in 2D Tile Self-assembly
- Running time and program size for self-assembled squares
- The program-size complexity of self-assembled squares (extended abstract)
- The undecidability of the domino problem
Cited in
(6)- Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
- Path finding in the tile assembly model
- Error suppression mechanisms for DNA tile self-assembly and their simulation
- Arithmetic computation in the tile assembly model: addition and multiplication
- Nondeterministic polynomial time factoring in the tile assembly model
- Solving NP-complete problems in the tile assembly model
This page was built for publication: Self-correcting Self-assembly: Growth Models and the Hammersley Process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618676)