15 citations · 28 across the 9 of their papers we have counts for
9 papers
Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
David Furcy, Scott M. Summers, Logan Withers
We investigate a fundamental question regarding a benchmark class of shapes in one of the simplest, yet most widely utilized abstract models of algorithmic tile self-assembly. Spec…
Model-Aided Wireless Artificial Intelligence: Embedding Expert Knowledge in Deep Neural Networks Towards Wireless Systems Optimization
Alessio Zappone, Marco Di Renzo, Mérouane Debbah +2
Deep learning based on artificial neural networks is a powerful machine learning method that, in the last few years, has been successfully used to realize tasks, e.g., image classi…
Hierarchical Growth is Necessary and (Sometimes) Sufficient to Self-Assemble Discrete Self-Similar Fractals
Jacob Hendricks, Joseph Opseth, Matthew Patitz +1
In this paper, we prove that in the abstract Tile Assembly Model (aTAM), an accretion-based model which only allows for a single tile to attach to a growing assembly at each step,…
Intrinsic universality in tile self-assembly requires cooperation
Pierre-Étienne Meunier, Matthew J. Patitz, Scott M. Summers +3
We prove a negative result on the power of a model of algorithmic self-assembly for which it has been notoriously difficult to find general techniques and results. Specifically, we…
Reducing Tile Complexity for the Self-Assembly of Scaled Shapes Through Temperature Programming
Scott M. Summers
This paper concerns the self-assembly of scaled-up versions of arbitrary finite shapes. We work in the multiple temperature model that was introduced by Aggarwal, Cheng, Goldwasser…
Self-Assembly of Infinite Structures
Matthew J. Patitz, Scott M. Summers
We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile ass…