Publication:2003452

DOI10.1007/s11047-015-9512-7zbMath1415.68089arXiv1303.2416OpenAlexW1670603247MaRDI QIDQ2003452

Yanyan Li

Publication date: 8 July 2019

Published in: Natural Computing, Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.2416

zbMATH Keywords

computational geometryalgorithmic self-assemblyaddertile-assembly model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other nonclassical models of computation (68Q09)

Related Items

Covert computation in self-assembled circuits, Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly, Unnamed Item, Concentration independent random number generation in tile self-assembly, Fast arithmetic in algorithmic self-assembly, Parallel computation using active self-assembly, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arithmetic computation in the tile assembly model: addition and multiplication
• Fast arithmetic in algorithmic self-assembly
• Self-assembly with Geometric Tiles
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• The Longest Run of Heads
• Randomized Self-assembly for Approximate Shapes
• Combinatorial optimization problems in self-assembly
• The Tile Complexity of Linear Assemblies
• One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
• Intrinsic universality in tile self-assembly requires cooperation
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Randomized Self-Assembly for Exact Shapes
• Fuel Efficient Computation in Passive Self-Assembly