Pages without language links

Jump to navigation Jump to search

The following pages do not link to other language versions.

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

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

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

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