Pages that link to "Item:Q3192015"

The following pages link to The program-size complexity of self-assembled squares (extended abstract) (Q3192015):

Displaying 43 items.

• Expectation and Variance of Self-assembled Graph Structures (Q3618685) (← links)
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems (Q3618692) (← links)
• A Self-assembly Model of Time-Dependent Glue Strength (Q3618693) (← links)
• Complexity of Compact Proofreading for Self-assembled Patterns (Q3618694) (← links)
• Connecting the Dots: Molecular Machinery for Distributed Robotics (Q3643096) (← links)
• Polyomino-Safe DNA Self-assembly via Block Replacement (Q3643097) (← links)
• Robust Self-assembly of Graphs (Q3643098) (← links)
• Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes (Q3643099) (← links)
• Self-assembly of Discrete Self-similar Fractals (Q3643100) (← links)
• Self-assembly of any shape with constant tile types using high temperature (Q5009571) (← links)
• Improved Leader Election for Self-organizing Programmable Matter (Q5056058) (← links)
• A Study on Complexity Measure of Diamond Tile Self-assembly System (Q5114870) (← links)
• Parallel Computation Using Active Self-assembly (Q5168495) (← links)
• 3-Color Bounded Patterned Self-assembly (Q5168502) (← links)
• Iterative Self-assembly with Dynamic Strength Transformation and Temperature Control (Q5168506) (← links)
• DNA algorithms for fractal construction—an application of the<i>SInsDelP</i>system (Q5297936) (← links)
• Parallelism and Time in Hierarchical Self-Assembly (Q5737807) (← links)
• (Q5743467) (← links)
• Simple and efficient local codes for distributed stable network construction (Q5892129) (← links)
• Particle-based assembly using precise global control (Q5896892) (← links)
• On efficient connectivity-preserving transformations in a grid (Q5918321) (← links)
• Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach (Q5918536) (← links)
• Particle-based assembly using precise global control (Q5918538) (← links)
• Distributed transformations of Hamiltonian shapes based on line moves (Q5918588) (← links)
• Distributed transformations of Hamiltonian shapes based on line moves (Q5918708) (← links)
• Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach (Q5918710) (← links)
• Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D (Q6056633) (← links)
• Resiliency to multiple nucleation in temperature-1 self-assembly (Q6061980) (← links)
• A minimal requirement for self-assembly of lines in polylogarithmic time (Q6062023) (← links)
• Geometric tiles and powers and limitations of geometric hindrance in self-assembly (Q6095490) (← links)
• Counting infinitely by oritatami co-transcriptional folding (Q6095499) (← links)
• Building squares with optimal state complexity in restricted active self-assembly (Q6133652) (← links)
• On geometric shape construction via growth operations (Q6140359) (← links)
• Forming tile shapes with simple robots (Q6151177) (← links)
• Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami (Q6169891) (← links)
• Unique assembly verification in two-handed self-assembly (Q6174821) (← links)
• The need for seed (in the abstract Tile Assembly Model) (Q6185943) (← links)
• Simplifying the role of signals in tile self-assembly (Q6191396) (← links)
• Optimal staged self-assembly of linear assemblies (Q6191405) (← links)
• Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami (Q6496883) (← links)
• Programmable single-stranded architectures for computing (Q6535757) (← links)
• Pushing lines helps: efficient universal centralised transformations for programmable matter (Q6536153) (← links)
• The impacts of dimensionality, diffusion, and directedness on intrinsic cross-model simulation in tile-based self-assembly (Q6582373) (← links)