The program-size complexity of self-assembled squares (extended abstract)
From MaRDI portal
(Redirected from Publication:3192015)
Recommendations
- Running time and program size for self-assembled squares
- Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
- The program-size complexity of self-assembled paths
- Complexity of Compact Proofreading for Self-assembled Patterns
- Optimal program-size complexity for self-assembly at temperature 1 in 3D
- On the effects of hierarchical self-assembly for reducing program-size complexity
- Computability and complexity in self-assembly
- Computability and Complexity in Self-assembly
- Complexity classes for self-assembling flexible tiles
Cited in
(only showing first 100 items - show all)- Complexity classes for self-assembling flexible tiles
- Strict self-assembly of discrete Sierpinski triangles
- Path finding in the tile assembly model
- Pictures worth a thousand tiles, a geometrical programming language for self-assembly
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- The power of duples (in self-assembly): it's not so hip to be square
- Computational modelling of the kinetic tile assembly model using a rule-based approach
- On the transformation capability of feasible mechanisms for programmable matter
- Optimal staged self-assembly of general shapes
- On stoichiometry for the assembly of flexible tile DNA complexes
- Step-wise tile assembly with a constant number of tile types
- Identifying shapes using self-assembly
- Tile complexity of approximate squares
- Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
- Non-explosivity of stochastically modeled reaction networks that are complex balanced
- Nearly constant tile complexity for any shape in two-handed tile assembly
- Producibility in hierarchical self-assembly
- Parallel computation using active self-assembly
- 3-color bounded patterned self-assembly
- Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D
- On the complexity of asynchronous freezing cellular automata
- The complexity of multiple handed self-assembly
- Fractal dimension of assemblies in the abstract tile assembly model
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- On the effects of hierarchical self-assembly for reducing program-size complexity
- Theory of tailor automata
- Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
- Turing patterns with Turing machines: emergence and low-level structure formation
- An introduction to tile-based self-assembly and a survey of recent results
- Unraveling simplicity in elementary cellular automata
- Simple evolution of complex crystal species
- Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
- Efficient 3-SAT algorithms in the tile assembly model
- Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model
- Exploring programmable self-assembly in non-DNA based molecular computing
- Resiliency to multiple nucleation in temperature-1 self-assembly
- Time complexity of computation and construction in the chemical reaction network-controlled tile assembly model
- Triangular and hexagonal tile self-assembly systems
- Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles
- Non-cooperative algorithms in self-assembly
- Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model
- Optimal program-size complexity for self-assembly at temperature 1 in 3D
- Flipping tiles: concentration independent coin flips in tile self-assembly
- Network Constructors: A Model for Programmable Matter
- Improving efficiency of 3-SAT-solving tile systems
- Optimizing tile concentrations to minimize errors and time for DNA tile self-assembly systems
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
- Triangular tile self-assembly systems
- Randomized Self Assembly of Rectangular Nano Structures
- Localized hybridization circuits
- Less haste, less waste: on recycling and its limits in strand displacement systems
- Synthesizing small and reliable tile sets for patterned DNA self-assembly
- Exact shapes and Turing universality at temperature 1 with a single negative glue
- A brief tour of theoretical tile self-assembly
- Possibilities of constructing two dimensional pictures in DNA computing: Part II
- Computability and Complexity in Self-assembly
- Transformations and Preservation of Self-assembly Dynamics through Homotheties
- A Limit to the Power of Multiple Nucleation in Self-assembly
- Self-assembly of Decidable Sets
- Self-correcting Self-assembly: Growth Models and the Hammersley Process
- Expectation and Variance of Self-assembled Graph Structures
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
- A Self-assembly Model of Time-Dependent Glue Strength
- Complexity of Compact Proofreading for Self-assembled Patterns
- Connecting the Dots: Molecular Machinery for Distributed Robotics
- Polyomino-Safe DNA Self-assembly via Block Replacement
- Robust Self-assembly of Graphs
- Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
- Self-assembly of Discrete Self-similar Fractals
- Self-assembling rulers for approximating generalized Sierpinski carpets
- Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
- Enumeration approach to computing chemical equilibria
- Search methods for tile sets in patterned DNA self-assembly
- Program size and temperature in self-assembly
- Self-assembly of any shape with constant tile types using high temperature
- Improved Leader Election for Self-organizing Programmable Matter
- A study on complexity measure of diamond tile self-assembly system
- Concentration independent random number generation in tile self-assembly
- Parallel Computation Using Active Self-assembly
- 3-color bounded patterned self-assembly (extended abstract)
- Iterative self-assembly with dynamic strength transformation and temperature control
- Running time and program size for self-assembled squares
- Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
- Connectivity preserving network transformers
- DNA algorithms for fractal construction—an application of theSInsDelPsystem
- On aggregation in multiset-based self-assembly of graphs
- Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
- Efficient algorithms for self assembling non-rectangular nano structures
- Computability and complexity in self-assembly
- DNA Computing
- Self-assembly of decidable sets
- Parallelism and time in hierarchical self-assembly
- Parallelism and time in hierarchical self-assembly
- Particle-based assembly using precise global control
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- Particle-based assembly using precise global control
- Distributed transformations of Hamiltonian shapes based on line moves
- Distributed transformations of Hamiltonian shapes based on line moves
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
This page was built for publication: The program-size complexity of self-assembled squares (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192015)
