Zobrazeno 1 - 10
of 18
pro vyhledávání: '"David Furcy"'
Publikováno v:
Unconventional Computation and Natural Computation ISBN: 9783031340338
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90064a8119aedff0d03aae6ca13b251a
https://doi.org/10.1007/978-3-031-34034-5_6
https://doi.org/10.1007/978-3-031-34034-5_6
Autor:
Martin L. Demaine, Robert T. Schweller, David Furcy, Scott M. Summers, Erik D. Demaine, Matthew J. Patitz, Andrew Winslow, Sarah Eisenstat, Sarah Cannon
Publikováno v:
Theoretical Computer Science. 894:50-78
In this paper we present a series of results which show separations between the standard seeded model of self-assembly, Winfree's abstract Tile Assembly Model (aTAM), and the “seedless” 2-Handed Assembly Model (2HAM), which incorporates the dynam
Publikováno v:
Theoretical Computer Science. 872:55-78
In this paper, we study the self-assembly of rectangles in a non-cooperative, 3D version of Winfree's abstract Tile Assembly Model. We prove two results. First, we give the full details for the proof of a general construction for the efficient self-a
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030268060
DNA
DNA
In this paper, we study the minimum number of unique tile types required for the self-assembly of thin rectangles in Winfree’s abstract Tile Assembly Model (aTAM), restricted to temperature-1. Using Catalan numbers, planar self-assembly and a restr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42b23c0bf3a41bb687bb3ccbf15508f9
https://doi.org/10.1007/978-3-030-26807-7_6
https://doi.org/10.1007/978-3-030-26807-7_6
Autor:
Scott M. Summers, David Furcy
Publikováno v:
Algorithmica. 80:1909-1963
Tile self-assembly in which tiles may bind in a non-cooperative fashion is often referred to as “temperature 1 self-assembly” or simply “non-cooperative self-assembly”. In this type of self-assembly, a tile may non-cooperatively bind to an as
Publikováno v:
Algorithmica. 77:1240-1282
Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for all $$N \in \mathbb {N}$$N?N, there is a tile set that uniquely self-assembles into an $$N \times N$$N×N square shape at temperature 1 with program-s
Autor:
David Furcy, Scott M. Summers
Publikováno v:
Natural Computing. 16:317-338
A pier fractal is a discrete self-similar fractal whose generator contains at least one pier, that is, a member of the generator with exactly one adjacent point. Tree fractals and pinch-point fractals are special cases of pier fractals. In this paper
Autor:
David Furcy, David Penniston
Publikováno v:
The Ramanujan Journal. 27:101-108
Let bl(n) denote the number of l-regular partitions of n. Recently Andrews, Hirschhorn, and Sellers proved that b4(n) satisfies two infinite families of congruences modulo 3, and Webb established an analogous result for b13(n). In this paper we prove
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319219981
DNA
DNA
Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for all $$N \in \mathbb {N}$$N∈N, there is a tile set that uniquely self-assembles into an $$N \times N$$N×N square shape at temperature 1 with optimal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28a1b7c2f76b02e7e0a2f5517748b6c2
https://doi.org/10.1007/978-3-319-21999-8_5
https://doi.org/10.1007/978-3-319-21999-8_5
Autor:
David Furcy, Scott M. Summers
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783319266251
COCOA
COCOA
Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for an arbitrary finite, connected shape $$X \subset \mathbb {Z}^2$$Xi¾?Z2, there is a tile set that uniquely self-assembles into a 3D representation of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78da1627afd303cd4ba0147810db59da
https://doi.org/10.1007/978-3-319-26626-8_11
https://doi.org/10.1007/978-3-319-26626-8_11