Robust self-assembly of graphs (Q968405): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11047-009-9149-5
+Normal rank
@@ Property / OpenAlex ID @@
+W4230829138
@@ Property / OpenAlex ID: W4230829138 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of graph self-assembly in accretive systems
+Normal rank
@@ Property / cites work @@
+DNA Computing
@@ Property / cites work: DNA Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+The program-size complexity of self-assembled squares (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+DNA Computing
@@ Property / cites work: DNA Computing / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:968405