Short pages

Jump to navigation Jump to search

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

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

  1. (hist) ‎Fake conference ‎[40 bytes]
  2. (hist) ‎2HAM Video Demonstration ‎[43 bytes]
  3. (hist) ‎Ph-Controlled Assembly ‎[45 bytes]
  4. (hist) ‎Wang Tiling ‎[102 bytes]
  5. (hist) ‎ATAM and kTAM Video Demonstration ‎[104 bytes]
  6. (hist) ‎DNA Origami ‎[109 bytes]
  7. (hist) ‎Simulation Window ‎[121 bytes]
  8. (hist) ‎Publications in self assembly ‎[138 bytes]
  9. (hist) ‎Baggins-expressions ‎[186 bytes]
  10. (hist) ‎Window Movie Lemmas ‎[187 bytes]
  11. (hist) ‎Growth Frontier ‎[209 bytes]
  12. (hist) ‎Tile Lib ‎[237 bytes]
  13. (hist) ‎2PATS-search-ocaml ‎[267 bytes]
  14. (hist) ‎Nucleation Errors ‎[298 bytes]
  15. (hist) ‎2PATS-tileset-search ‎[300 bytes]
  16. (hist) ‎Auto Counter Tiler ‎[316 bytes]
  17. (hist) ‎Theory of Algorithmic Self-Assembly ‎[321 bytes]
  18. (hist) ‎ISU TAS Tutorials ‎[343 bytes]
  19. (hist) ‎Auxetic Two-Dimensional Nanostructures ‎[360 bytes]
  20. (hist) ‎Turing Machine Tiler ‎[426 bytes]
  21. (hist) ‎Xgrow ‎[557 bytes]
  22. (hist) ‎Weak Self-Assembly ‎[564 bytes]
  23. (hist) ‎Program Size and Temperature in Self-Assembly ‎[640 bytes]
  24. (hist) ‎Self-Assembly of Infinite Structures: A Survey ‎[653 bytes]
  25. (hist) ‎Temperature ‎[659 bytes]
  26. (hist) ‎Strict Self-Assembly ‎[669 bytes]
  27. (hist) ‎Directed (2HAM) ‎[684 bytes]
  28. (hist) ‎OxDNA ‎[689 bytes]
  29. (hist) ‎Identifying Shapes Using Self-Assembly ‎[767 bytes]
  30. (hist) ‎TAM DSL ‎[800 bytes]
  31. (hist) ‎DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly ‎[803 bytes]
  32. (hist) ‎Increasing Redundancy Exponentially Reduces Error Rates during Algorithmic Self-Assembly ‎[808 bytes]
  33. (hist) ‎Decider Tiler ‎[821 bytes]
  34. (hist) ‎Self-Assembly of Decidable Sets ‎[834 bytes]
  35. (hist) ‎Tile Assembly Examples ‎[866 bytes]
  36. (hist) ‎Co-transcriptional Folding ‎[878 bytes]
  37. (hist) ‎Integrating DNA strand-displacement circuitry with DNA tile self-assembly ‎[916 bytes]
  38. (hist) ‎Kinetic Slat Assembly Model (kSAM) ‎[925 bytes]
  39. (hist) ‎Software self-assembly ‎[935 bytes]
  40. (hist) ‎Parallelism and Time in Hierarchical Self-Assembly ‎[958 bytes]
  41. (hist) ‎Cooperation ‎[968 bytes]
  42. (hist) ‎Replication of arbitrary hole-free shapes via self-assembly with signal-passing tiles (extended abstract) ‎[1,001 bytes]
  43. (hist) ‎A Domain-Specific Language for Programming in the Tile Assembly Model ‎[1,002 bytes]
  44. (hist) ‎Facet Errors ‎[1,016 bytes]
  45. (hist) ‎Self-Assembly of Discrete Self-Similar Fractals ‎[1,030 bytes]
  46. (hist) ‎Limitations of Self-Assembly at Temperature 1 ‎[1,033 bytes]
  47. (hist) ‎Robust self-replication of combinatorial information via crystal growth and scission ‎[1,039 bytes]
  48. (hist) ‎The Three Windows ‎[1,050 bytes]
  49. (hist) ‎PH Controlled Assembly ‎[1,053 bytes]
  50. (hist) ‎Probablistic assembly ‎[1,058 bytes]
  51. (hist) ‎Shape Replication Through Self-Assembly and RNase Enzymes ‎[1,066 bytes]
  52. (hist) ‎Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly ‎[1,082 bytes]
  53. (hist) ‎Two Hands Are Better Than One (up to constant factors) ‎[1,105 bytes]
  54. (hist) ‎Random Number Selection in Self-Assembly ‎[1,117 bytes]
  55. (hist) ‎Zig-zag tile assembly system ‎[1,137 bytes]
  56. (hist) ‎WebDNA ‎[1,148 bytes]
  57. (hist) ‎Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues ‎[1,172 bytes]
  58. (hist) ‎Tile Set Designer ‎[1,178 bytes]
  59. (hist) ‎Tile Assembly System (TAS) ‎[1,203 bytes]
  60. (hist) ‎PH Controlled Assembly of DNA Tiles ‎[1,206 bytes]
  61. (hist) ‎WebTAS ‎[1,211 bytes]
  62. (hist) ‎Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time ‎[1,228 bytes]
  63. (hist) ‎Speed of Assembly in the 2HAM ‎[1,229 bytes]
  64. (hist) ‎Computability and Complexity in Self-Assembly ‎[1,238 bytes]
  65. (hist) ‎Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles ‎[1,245 bytes]
  66. (hist) ‎Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS ‎[1,263 bytes]
  67. (hist) ‎Diagonal and Non-Diagonal Glue Functions ‎[1,277 bytes]
  68. (hist) ‎Algorithmic self-assembly ‎[1,303 bytes]
  69. (hist) ‎DNA walker circuits: computational potential, design, and verification ‎[1,349 bytes]
  70. (hist) ‎Computing in continuous space with self-assembling polygonal tiles ‎[1,365 bytes]
  71. (hist) ‎Reflections on Tiles (in Self-Assembly) ‎[1,376 bytes]
  72. (hist) ‎Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) ‎[1,377 bytes]
  73. (hist) ‎A Cargo-Sorting DNA Robot ‎[1,386 bytes]
  74. (hist) ‎An Introduction to Tile-Based Self-Assembly and a Survey of Recent Results ‎[1,396 bytes]
  75. (hist) ‎Randomized Self-Assembly for Approximate Shapes ‎[1,447 bytes]
  76. (hist) ‎The tile assembly model is intrinsically universal ‎[1,450 bytes]
  77. (hist) ‎Resiliency to Multiple Nucleation in Temperature~1 Self-Assembly ‎[1,466 bytes]
  78. (hist) ‎OritatamiSim ‎[1,468 bytes]
  79. (hist) ‎On the Equivalence of Cellular Automata and the Tile Assembly Model ‎[1,469 bytes]
  80. (hist) ‎Impossibility and Efficiency Comparisions Between aTAM and 2HAM ‎[1,512 bytes]
  81. (hist) ‎Running time and program size for self-assembled squares ‎[1,512 bytes]
  82. (hist) ‎RodSim ‎[1,538 bytes]
  83. (hist) ‎OritatamiShapeMaker ‎[1,566 bytes]
  84. (hist) ‎Covert Computation in Self-Assembled Circuits ‎[1,572 bytes]
  85. (hist) ‎Small tile sets that compute while solving mazes ‎[1,572 bytes]
  86. (hist) ‎DNA Punch Cards for Storing Data ‎[1,574 bytes]
  87. (hist) ‎Algorithmic Self-Assembly of DNA Sierpinski Triangles ‎[1,577 bytes]
  88. (hist) ‎One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile ‎[1,585 bytes]
  89. (hist) ‎SlatTAS ‎[1,592 bytes]
  90. (hist) ‎One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece ‎[1,613 bytes]
  91. (hist) ‎The Power of Duples (in Self-Assembly): It's Not So Hip To Be Square ‎[1,642 bytes]
  92. (hist) ‎Self-Assembly with Geometric Tiles ‎[1,666 bytes]
  93. (hist) ‎Intrinsic universality in tile self-assembly requires cooperation ‎[1,686 bytes]
  94. (hist) ‎Reducing Tile Complexity for Self-Assembly Through Temperature Programming ‎[1,714 bytes]
  95. (hist) ‎Binary pattern tile set synthesis is NP-hard ‎[1,723 bytes]
  96. (hist) ‎PyTAS ‎[1,732 bytes]
  97. (hist) ‎Multiple Temperature Model ‎[1,742 bytes]
  98. (hist) ‎Growth Errors ‎[1,774 bytes]
  99. (hist) ‎Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D ‎[1,783 bytes]
  100. (hist) ‎Staged Tile Assembly Model ‎[1,791 bytes]
  101. (hist) ‎Nondeterminism ‎[1,812 bytes]
  102. (hist) ‎Intrinsic Universality in Self-Assembly ‎[1,821 bytes]
  103. (hist) ‎Self-Assembly of 3-D Structures Using 2-D Folding Tiles ‎[1,837 bytes]
  104. (hist) ‎Universal Shape Replication Via Self-Assembly With Signal-Passing Tiles ‎[1,883 bytes]
  105. (hist) ‎Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue ‎[1,894 bytes]
  106. (hist) ‎The two-handed tile assembly model is not intrinsically universal ‎[1,904 bytes]
  107. (hist) ‎OritatamiSim Simple Simulation Examples ‎[1,943 bytes]
  108. (hist) ‎Fibered Fractal Tiler ‎[1,944 bytes]
  109. (hist) ‎Assembly ‎[1,959 bytes]
  110. (hist) ‎Geometric Hindrance ‎[1,985 bytes]
  111. (hist) ‎Complexities for Generalized Models of Self-Assembly ‎[2,001 bytes]
  112. (hist) ‎Diverse and Robust Molecular Algorithms Using Reprogrammable DNA Self-Assembly ‎[2,001 bytes]
  113. (hist) ‎Doubles and Negatives are Positive (in Self-Assembly) ‎[2,002 bytes]
  114. (hist) ‎Facet Error Handling ‎[2,035 bytes]
  115. (hist) ‎ISU TAS ‎[2,044 bytes]
  116. (hist) ‎Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly ‎[2,055 bytes]
  117. (hist) ‎Signal Transmission Across Tile Assemblies: 3D Static Tiles Simulate Active Self-Assembly by 2D Signal-Passing Tiles ‎[2,060 bytes]
  118. (hist) ‎Simulation of the aTAM ‎[2,069 bytes]
  119. (hist) ‎The Simulation Powers and Limitations of Higher Temperature Hierarchical Self-Assembly Systems ‎[2,127 bytes]
  120. (hist) ‎Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient Computation and Efficient Assembly of Shapes ‎[2,188 bytes]
  121. (hist) ‎Speed of assembly ‎[2,281 bytes]
  122. (hist) ‎The Non-cooperative Tile Assembly Model Is Not Intrinsically Universal or Capable of Bounded Turing Machine Simulation ‎[2,341 bytes]
  123. (hist) ‎Verification of aTAM systems ‎[2,343 bytes]
  124. (hist) ‎Simplifying the Role of Signals in Tile Self-assembly ‎[2,433 bytes]
  125. (hist) ‎Slat Generator API ‎[2,485 bytes]
  126. (hist) ‎Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized distributed networks ‎[2,550 bytes]
  127. (hist) ‎Automated self-assembly programming paradigm ‎[2,618 bytes]
  128. (hist) ‎A Tile-based Approach for Self-assembling Service Compositions ‎[2,669 bytes]
  129. (hist) ‎Magnetic Plasmon Networks Programmed by Molecular Self-Assembly ‎[2,685 bytes]
  130. (hist) ‎Temperature Programming ‎[2,764 bytes]
  131. (hist) ‎Solving np-complete Problems in the Tile Assembly Model ‎[2,775 bytes]
  132. (hist) ‎Resources ‎[2,826 bytes]
  133. (hist) ‎Enhanced Tile Design ‎[2,932 bytes]
  134. (hist) ‎Verification of 2HAM Systems ‎[3,004 bytes]
  135. (hist) ‎Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature ‎[3,030 bytes]
  136. (hist) ‎Directed Tile Assembly Systems ‎[3,076 bytes]
  137. (hist) ‎NP Hard Problems ‎[3,080 bytes]
  138. (hist) ‎Dupled abstract Tile Assembly Model (DaTAM) ‎[3,137 bytes]
  139. (hist) ‎Thermodynamic Binding Networks (TBN) ‎[3,189 bytes]
  140. (hist) ‎Chemical Reaction Network (CRN) ‎[3,266 bytes]
  141. (hist) ‎Maze-Walking Tile Assembly Model ‎[3,286 bytes]
  142. (hist) ‎Self-Healing ‎[3,325 bytes]
  143. (hist) ‎Random Number Selection ‎[3,334 bytes]
  144. (hist) ‎Intrinsic Universality in the 2HAM ‎[3,381 bytes]
  145. (hist) ‎Non-cooperatively assembling large structures:a 2D pumping lemma cannot be as powerful as its 1D counterpart. ‎[3,496 bytes]
  146. (hist) ‎Snaked Proofreading ‎[3,589 bytes]
  147. (hist) ‎Concentration programming ‎[3,729 bytes]
  148. (hist) ‎PATS problem and tile set generation ‎[4,002 bytes]
  149. (hist) ‎Zig-Zag Systems ‎[4,027 bytes]
  150. (hist) ‎Covert Computation ‎[4,027 bytes]
  151. (hist) ‎Building finite shapes in the aTAM ‎[4,185 bytes]
  152. (hist) ‎2HAM Demonstration ‎[4,196 bytes]
  153. (hist) ‎Sierpinski triangle in the aTAM ‎[4,228 bytes]
  154. (hist) ‎IU Results in Diffusion-Restricted and Directed aTAMs ‎[4,450 bytes]
  155. (hist) ‎Power of Self-Assembly at Temperature 1 ‎[4,568 bytes]
  156. (hist) ‎Geometric Tile Assembly Model (GTAM) ‎[4,809 bytes]
  157. (hist) ‎Strict Self-Assembly of Fractals using Multiple Hands ‎[4,810 bytes]
  158. (hist) ‎Amoebots ‎[5,131 bytes]
  159. (hist) ‎4-sided Fractals in the 2HAM ‎[5,204 bytes]
  160. (hist) ‎Building n by n squares ‎[5,303 bytes]
  161. (hist) ‎Error Suppresion Via Block Replacement ‎[5,312 bytes]
  162. (hist) ‎Shape Replication ‎[5,360 bytes]
  163. (hist) ‎Nubots ‎[5,404 bytes]
  164. (hist) ‎Your first tile assembly ‎[5,465 bytes]
  165. (hist) ‎Self-Assembly of Fractals in the STAM ‎[5,503 bytes]
  166. (hist) ‎Biomolecular Swarming Agents ‎[5,736 bytes]
  167. (hist) ‎Decreasing Errors by Increasing Redundancy ‎[5,821 bytes]
  168. (hist) ‎The influence of temperature ‎[5,983 bytes]
  169. (hist) ‎Controlling Nucleation ‎[6,197 bytes]
  170. (hist) ‎Polyomino Tile Assembly Model (polyTAM) ‎[6,307 bytes]
  171. (hist) ‎Tile Automata ‎[6,373 bytes]
  172. (hist) ‎Circuit Simulation with Single-Stranded Tiles ‎[6,451 bytes]
  173. (hist) ‎Equivalence of Cellular Automata and the Tile Assembly Model ‎[6,653 bytes]
  174. (hist) ‎Fuzzy Temperature Fault Tolerance ‎[6,842 bytes]
  175. (hist) ‎Building infinite shapes ‎[7,062 bytes]
  176. (hist) ‎Pattern Self-Assembly ‎[7,106 bytes]
  177. (hist) ‎Main Page ‎[7,222 bytes]
  178. (hist) ‎Sierpinski triangle in the kTAM ‎[7,339 bytes]
  179. (hist) ‎Oritatami ‎[7,483 bytes]
  180. (hist) ‎Open Problems ‎[8,217 bytes]
  181. (hist) ‎Restricted Glue TAS ‎[8,341 bytes]
  182. (hist) ‎Simulation in the aTAM ‎[8,560 bytes]
  183. (hist) ‎People ‎[8,568 bytes]
  184. (hist) ‎Reflexive Tile Assembly Model (RTAM) ‎[9,198 bytes]
  185. (hist) ‎Polygonal Tile Assembly Model (Polygonal TAM) ‎[10,466 bytes]
  186. (hist) ‎Intrinsic Universality of the aTAM ‎[10,799 bytes]
  187. (hist) ‎Performing computations ‎[10,907 bytes]
  188. (hist) ‎Abstract Slat Assembly Model (aSAM) ‎[11,162 bytes]
  189. (hist) ‎Kinetic Tile Assembly Model (kTAM) ‎[12,187 bytes]
  190. (hist) ‎Abstract Tile Assembly Model (aTAM) ‎[14,679 bytes]
  191. (hist) ‎Conferences ‎[17,149 bytes]
  192. (hist) ‎Two-Handed Assembly Model (2HAM) ‎[21,517 bytes]
  193. (hist) ‎Signal-passing Tile Assembly Model (STAM) ‎[24,606 bytes]

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

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