Tight bounds for active self-assembly using an insertion primitive (Q513280): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Tight Bounds for Active Self-assembly Using an Insertion Primitive
description / endescription / en
scientific article
scientific article; zbMATH DE number 6352789
Property / author
 
Property / author: Benjamin J. Hescott / rank
Normal rank
 
Property / title
 
Tight Bounds for Active Self-assembly Using an Insertion Primitive (English)
Property / title: Tight Bounds for Active Self-assembly Using an Insertion Primitive (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1421.68049 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-44777-2_56 / rank
 
Normal rank
Property / author
 
Property / author: Benjamin J. Hescott / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms - ESA 2014 / rank
 
Normal rank
Property / publication date
 
8 October 2014
Timestamp+2014-10-08T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 8 October 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6352789 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964204604 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2595558125 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.0359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Running time and program size for self-assembled squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Computation Using Active Self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active Self-Assembly of Simple Units Using an Insertion Primitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: ACTIVE TILE SELF-ASSEMBLY, PART 1: UNIVERSALITY AT TEMPERATURE 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Replication of Patterns in the Signal Tile Assembly Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for active self-assembly using an insertion primitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The program-size complexity of self-assembled squares (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Self‐Assembled Shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time / rank
 
Normal rank

Latest revision as of 13:06, 13 July 2024

scientific article; zbMATH DE number 6352789
  • Tight Bounds for Active Self-assembly Using an Insertion Primitive
Language Label Description Also known as
English
Tight bounds for active self-assembly using an insertion primitive
scientific article; zbMATH DE number 6352789
  • Tight Bounds for Active Self-assembly Using an Insertion Primitive

Statements

Tight bounds for active self-assembly using an insertion primitive (English)
0 references
Tight Bounds for Active Self-assembly Using an Insertion Primitive (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
3 March 2017
0 references
8 October 2014
0 references
0 references
0 references
0 references
0 references
0 references
DNA computing
0 references
biocomputing
0 references
formal languages
0 references
polymers
0 references
context-free grammars
0 references
0 references
0 references
0 references