Dead-end pages

Jump to navigation Jump to search

The following pages do not link to other pages in self-assembly wiki.

Showing below up to 100 results in range #1 to #100.

View (\(1 | \)2) (20 | 50 | 100 | 250 | 500)

  1. 2HAM Video Demonstration
  2. 2PATS-search-ocaml
  3. 2PATS-tileset-search
  4. ATAM and kTAM Video Demonstration
  5. A Cargo-Sorting DNA Robot
  6. A Domain-Specific Language for Programming in the Tile Assembly Model
  7. A Tile-based Approach for Self-assembling Service Compositions
  8. Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time
  9. Algorithmic Self-Assembly of DNA Sierpinski Triangles
  10. Amoebots
  11. An Introduction to Tile-Based Self-Assembly and a Survey of Recent Results
  12. Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
  13. Auto Counter Tiler
  14. Automated self-assembly programming paradigm
  15. Auxetic Two-Dimensional Nanostructures
  16. Baggins-expressions
  17. Binary pattern tile set synthesis is NP-hard
  18. Biomolecular Swarming Agents
  19. Building finite shapes in the aTAM
  20. Building infinite shapes
  21. Building n by n squares
  22. Chemical Reaction Network (CRN)
  23. Circuit Simulation with Single-Stranded Tiles
  24. Co-transcriptional Folding
  25. Complexities for Generalized Models of Self-Assembly
  26. Computability and Complexity in Self-Assembly
  27. Computing in continuous space with self-assembling polygonal tiles
  28. Concentration programming
  29. Conferences
  30. Cooperation
  31. Covert Computation
  32. Covert Computation in Self-Assembled Circuits
  33. Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly
  34. DNA Origami
  35. DNA Punch Cards for Storing Data
  36. DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
  37. DNA walker circuits: computational potential, design, and verification
  38. Decider Tiler
  39. Decreasing Errors by Increasing Redundancy
  40. Diagonal and Non-Diagonal Glue Functions
  41. Diverse and Robust Molecular Algorithms Using Reprogrammable DNA Self-Assembly
  42. Doubles and Negatives are Positive (in Self-Assembly)
  43. Enhanced Tile Design
  44. Equivalence of Cellular Automata and the Tile Assembly Model
  45. Error Suppresion Via Block Replacement
  46. Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
  47. Facet Error Handling
  48. Fake conference
  49. Fibered Fractal Tiler
  50. Fuzzy Temperature Fault Tolerance
  51. Geometric Hindrance
  52. Geometric Tile Assembly Model (GTAM)
  53. Growth Frontier
  54. Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles
  55. IU Results in Diffusion-Restricted and Directed aTAMs
  56. Identifying Shapes Using Self-Assembly
  57. Impossibility and Efficiency Comparisions Between aTAM and 2HAM
  58. Increasing Redundancy Exponentially Reduces Error Rates during Algorithmic Self-Assembly
  59. Integrating DNA strand-displacement circuitry with DNA tile self-assembly
  60. Intrinsic Universality in Self-Assembly
  61. Intrinsic universality in tile self-assembly requires cooperation
  62. Limitations of Self-Assembly at Temperature 1
  63. Magnetic Plasmon Networks Programmed by Molecular Self-Assembly
  64. Maze-Walking Tile Assembly Model
  65. Multiple Temperature Model
  66. NP Hard Problems
  67. Non-cooperatively assembling large structures:a 2D pumping lemma cannot be as powerful as its 1D counterpart.
  68. Nondeterminism
  69. Nubots
  70. On the Equivalence of Cellular Automata and the Tile Assembly Model
  71. One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
  72. One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
  73. Oritatami
  74. OxDNA
  75. PATS problem and tile set generation
  76. PH Controlled Assembly
  77. PH Controlled Assembly of DNA Tiles
  78. Parallelism and Time in Hierarchical Self-Assembly
  79. People
  80. Performing computations
  81. Ph-Controlled Assembly
  82. Polygonal Tile Assembly Model (Polygonal TAM)
  83. Polyomino Tile Assembly Model (polyTAM)
  84. Power of Self-Assembly at Temperature 1
  85. Program Size and Temperature in Self-Assembly
  86. Random Number Selection
  87. Random Number Selection in Self-Assembly
  88. Randomized Self-Assembly for Approximate Shapes
  89. Reducing Tile Complexity for Self-Assembly Through Temperature Programming
  90. Reflections on Tiles (in Self-Assembly)
  91. Reflexive Tile Assembly Model (RTAM)
  92. Replication of arbitrary hole-free shapes via self-assembly with signal-passing tiles (extended abstract)
  93. Resiliency to Multiple Nucleation in Temperature~1 Self-Assembly
  94. Resources
  95. Restricted Glue TAS
  96. Robust self-replication of combinatorial information via crystal growth and scission
  97. Running time and program size for self-assembled squares
  98. Self-Assembly of 3-D Structures Using 2-D Folding Tiles
  99. Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
  100. Self-Assembly of Decidable Sets

View (\(1 | \)2) (20 | 50 | 100 | 250 | 500)

Retrieved from "http://self-assembly.net/wiki/index.php/Special:DeadendPages"