Strict self-assembly of discrete Sierpinski triangles
type: Item
instance of: scholarly article
title: Strict self-assembly of discrete Sierpinski triangles
zbMATH Open document ID: 1160.68012
author: James I. Lathrop
author: Jack H. Lutz
author: Scott M. Summers
published in: Theoretical Computer Science
publication date: 2009-03-02T00:00:00Z
full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 52C20
Mathematics Subject Classification ID: 52C45
Mathematics Subject Classification ID: 28A80
zbMATH DE Number: 5522103
zbMATH Keywords: fractals
zbMATH Keywords: molecular computing
zbMATH Keywords: self-assembly
zbMATH Keywords: Sierpinski triangles
MaRDI profile type: Publication
OpenAlex ID: W2097477735
cites work: Combinatorial optimization problems in self-assembly
cites work: The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
cites work: Mathematical Foundations of Computer Science 2005
cites work: Q4431283
cites work: Q4320535
cites work: Q3856819
cites work: Q4737139
cites work: The program-size complexity of self-assembled squares (extended abstract)
cites work: Complexity of Self‐Assembled Shapes
cites work: Q5509685
cites work: Q3675527
DOI: 10.1016/J.TCS.2008.09.062
description: scientific article; zbMATH DE number 5522103