Long pages
Jump to navigation
Jump to search
Showing below up to 100 results in range #1 to #100.
View (\(1 | \)2) (20 | 50 | 100 | 250 | 500)
- (hist) Signal-passing Tile Assembly Model (STAM) [24,606 bytes]
- (hist) Two-Handed Assembly Model (2HAM) [21,517 bytes]
- (hist) Conferences [17,149 bytes]
- (hist) Abstract Tile Assembly Model (aTAM) [14,679 bytes]
- (hist) Abstract Slat Assembly Model (aSAM) [13,703 bytes]
- (hist) Kinetic Tile Assembly Model (kTAM) [12,187 bytes]
- (hist) Performing computations [10,907 bytes]
- (hist) Intrinsic Universality of the aTAM [10,799 bytes]
- (hist) Polygonal Tile Assembly Model (Polygonal TAM) [10,466 bytes]
- (hist) Reflexive Tile Assembly Model (RTAM) [9,198 bytes]
- (hist) People [8,568 bytes]
- (hist) Simulation in the aTAM [8,560 bytes]
- (hist) Restricted Glue TAS [8,341 bytes]
- (hist) Open Problems [8,217 bytes]
- (hist) Oritatami [7,483 bytes]
- (hist) Sierpinski triangle in the kTAM [7,339 bytes]
- (hist) Main Page [7,222 bytes]
- (hist) Pattern Self-Assembly [7,106 bytes]
- (hist) Building infinite shapes [7,062 bytes]
- (hist) Fuzzy Temperature Fault Tolerance [6,842 bytes]
- (hist) Equivalence of Cellular Automata and the Tile Assembly Model [6,653 bytes]
- (hist) Circuit Simulation with Single-Stranded Tiles [6,451 bytes]
- (hist) Tile Automata [6,373 bytes]
- (hist) Polyomino Tile Assembly Model (polyTAM) [6,307 bytes]
- (hist) Controlling Nucleation [6,197 bytes]
- (hist) The influence of temperature [5,983 bytes]
- (hist) Decreasing Errors by Increasing Redundancy [5,821 bytes]
- (hist) Biomolecular Swarming Agents [5,736 bytes]
- (hist) Self-Assembly of Fractals in the STAM [5,503 bytes]
- (hist) Your first tile assembly [5,465 bytes]
- (hist) Nubots [5,404 bytes]
- (hist) Shape Replication [5,360 bytes]
- (hist) Error Suppresion Via Block Replacement [5,312 bytes]
- (hist) Building n by n squares [5,303 bytes]
- (hist) 4-sided Fractals in the 2HAM [5,204 bytes]
- (hist) Amoebots [5,131 bytes]
- (hist) Strict Self-Assembly of Fractals using Multiple Hands [4,810 bytes]
- (hist) Geometric Tile Assembly Model (GTAM) [4,809 bytes]
- (hist) Power of Self-Assembly at Temperature 1 [4,568 bytes]
- (hist) IU Results in Diffusion-Restricted and Directed aTAMs [4,450 bytes]
- (hist) Sierpinski triangle in the aTAM [4,228 bytes]
- (hist) 2HAM Demonstration [4,196 bytes]
- (hist) Building finite shapes in the aTAM [4,185 bytes]
- (hist) Covert Computation [4,027 bytes]
- (hist) Zig-Zag Systems [4,027 bytes]
- (hist) PATS problem and tile set generation [4,002 bytes]
- (hist) Concentration programming [3,729 bytes]
- (hist) Snaked Proofreading [3,589 bytes]
- (hist) Non-cooperatively assembling large structures:a 2D pumping lemma cannot be as powerful as its 1D counterpart. [3,496 bytes]
- (hist) Intrinsic Universality in the 2HAM [3,381 bytes]
- (hist) Random Number Selection [3,334 bytes]
- (hist) Self-Healing [3,325 bytes]
- (hist) Maze-Walking Tile Assembly Model [3,286 bytes]
- (hist) Chemical Reaction Network (CRN) [3,266 bytes]
- (hist) Thermodynamic Binding Networks (TBN) [3,189 bytes]
- (hist) Dupled abstract Tile Assembly Model (DaTAM) [3,137 bytes]
- (hist) NP Hard Problems [3,080 bytes]
- (hist) Directed Tile Assembly Systems [3,076 bytes]
- (hist) Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature [3,030 bytes]
- (hist) Verification of 2HAM Systems [3,004 bytes]
- (hist) Enhanced Tile Design [2,932 bytes]
- (hist) Resources [2,826 bytes]
- (hist) Solving np-complete Problems in the Tile Assembly Model [2,775 bytes]
- (hist) Temperature Programming [2,764 bytes]
- (hist) Magnetic Plasmon Networks Programmed by Molecular Self-Assembly [2,685 bytes]
- (hist) A Tile-based Approach for Self-assembling Service Compositions [2,669 bytes]
- (hist) Automated self-assembly programming paradigm [2,618 bytes]
- (hist) Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized distributed networks [2,550 bytes]
- (hist) Slat Generator API [2,485 bytes]
- (hist) Simplifying the Role of Signals in Tile Self-assembly [2,433 bytes]
- (hist) Verification of aTAM systems [2,343 bytes]
- (hist) The Non-cooperative Tile Assembly Model Is Not Intrinsically Universal or Capable of Bounded Turing Machine Simulation [2,341 bytes]
- (hist) Speed of assembly [2,281 bytes]
- (hist) Asynchronous Signal Passing for Tile Self-Assembly: Fuel Efficient Computation and Efficient Assembly of Shapes [2,188 bytes]
- (hist) The Simulation Powers and Limitations of Higher Temperature Hierarchical Self-Assembly Systems [2,127 bytes]
- (hist) Simulation of the aTAM [2,069 bytes]
- (hist) Signal Transmission Across Tile Assemblies: 3D Static Tiles Simulate Active Self-Assembly by 2D Signal-Passing Tiles [2,060 bytes]
- (hist) Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly [2,055 bytes]
- (hist) ISU TAS [2,044 bytes]
- (hist) Facet Error Handling [2,035 bytes]
- (hist) Doubles and Negatives are Positive (in Self-Assembly) [2,002 bytes]
- (hist) Diverse and Robust Molecular Algorithms Using Reprogrammable DNA Self-Assembly [2,001 bytes]
- (hist) Complexities for Generalized Models of Self-Assembly [2,001 bytes]
- (hist) Geometric Hindrance [1,985 bytes]
- (hist) Assembly [1,959 bytes]
- (hist) Fibered Fractal Tiler [1,944 bytes]
- (hist) OritatamiSim Simple Simulation Examples [1,943 bytes]
- (hist) The two-handed tile assembly model is not intrinsically universal [1,904 bytes]
- (hist) Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue [1,894 bytes]
- (hist) Universal Shape Replication Via Self-Assembly With Signal-Passing Tiles [1,883 bytes]
- (hist) Self-Assembly of 3-D Structures Using 2-D Folding Tiles [1,837 bytes]
- (hist) Intrinsic Universality in Self-Assembly [1,821 bytes]
- (hist) Nondeterminism [1,812 bytes]
- (hist) Staged Tile Assembly Model [1,791 bytes]
- (hist) Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D [1,783 bytes]
- (hist) Growth Errors [1,774 bytes]
- (hist) Multiple Temperature Model [1,742 bytes]
- (hist) PyTAS [1,732 bytes]
- (hist) Binary pattern tile set synthesis is NP-hard [1,723 bytes]
- (hist) Reducing Tile Complexity for Self-Assembly Through Temperature Programming [1,714 bytes]