Difference between revisions of "Category:Papers"
Jump to navigation
Jump to search
Kthrelfall (talk | contribs) |
|||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | This is a repository for papers relevant to algorithmic self-assembly. | + | This is a repository for papers relevant to algorithmic self-assembly. The papers can either be hosted here or links to versions elsewhere. |
| − | + | [http://self-assembly.net/wiki/index.php?title=Form:Add_Paper Add a paper] | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Latest revision as of 15:32, 10 June 2021
This is a repository for papers relevant to algorithmic self-assembly. The papers can either be hosted here or links to versions elsewhere.
Pages in category "Papers"
The following 60 pages are in this category, out of 60 total.
A
- A Cargo-Sorting DNA Robot
- A Domain-Specific Language for Programming in the Tile Assembly Model
- Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time
- Algorithmic Self-Assembly of DNA Sierpinski Triangles
- An Introduction to Tile-Based Self-Assembly and a Survey of Recent Results
- Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
C
D
I
- Identifying Shapes Using Self-Assembly
- Increasing Redundancy Exponentially Reduces Error Rates during Algorithmic Self-Assembly
- Integrating DNA strand-displacement circuitry with DNA tile self-assembly
- Intrinsic Universality in Self-Assembly
- Intrinsic universality in tile self-assembly requires cooperation
O
P
R
- Random Number Selection in Self-Assembly
- Randomized Self-Assembly for Approximate Shapes
- Reducing Tile Complexity for Self-Assembly Through Temperature Programming
- Reflections on Tiles (in Self-Assembly)
- Replication of arbitrary hole-free shapes via self-assembly with signal-passing tiles (extended abstract)
- Resiliency to Multiple Nucleation in Temperature~1 Self-Assembly
- Robust self-replication of combinatorial information via crystal growth and scission
- Running time and program size for self-assembled squares
S
- Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
- Self-Assembly of Decidable Sets
- Self-Assembly of Discrete Self-Similar Fractals
- Self-Assembly of Infinite Structures: A Survey
- Self-Assembly with Geometric Tiles
- Shape Replication Through Self-Assembly and RNase Enzymes
- Signal Transmission Across Tile Assemblies: 3D Static Tiles Simulate Active Self-Assembly by 2D Signal-Passing Tiles
- Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS
- Small tile sets that compute while solving mazes
- Solving np-complete Problems in the Tile Assembly Model
- Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
- Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature
T
- Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D
- The Non-cooperative Tile Assembly Model Is Not Intrinsically Universal or Capable of Bounded Turing Machine Simulation
- The Power of Duples (in Self-Assembly): It's Not So Hip To Be Square
- The Simulation Powers and Limitations of Higher Temperature Hierarchical Self-Assembly Systems
- The tile assembly model is intrinsically universal
- The two-handed tile assembly model is not intrinsically universal
- Theory of Algorithmic Self-Assembly
- Two Hands Are Better Than One (up to constant factors)
