The Tile Complexity of Linear Assemblies

DOI10.1007/978-3-642-02927-1_21zbMath1248.68195OpenAlexW1496143544MaRDI QIDQ3638038

Nikhil Gopalkrishnan, Harish Chandran, John H. Reif

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_21

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Genetics and epigenetics (92D10)

Related Items (8)

Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models ⋮ Tile complexity of approximate squares ⋮ Fast arithmetic in algorithmic self-assembly ⋮ Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles ⋮ Parallelism and Time in Hierarchical Self-Assembly ⋮ Unnamed Item ⋮ One-dimensional staged self-assembly ⋮ An introduction to tile-based self-assembly and a survey of recent results

This page was built for publication: The Tile Complexity of Linear Assemblies