Arithmetic computation in the tile assembly model: Addition and multiplication

@article{Brun2007ArithmeticCI,
  title={Arithmetic computation in the tile assembly model: Addition and multiplication},
  author={Yuriy Brun},
  journal={Theor. Comput. Sci.},
  year={2007},
  volume={378},
  pages={17-31}
}
Formalized study of self-assembly has led to the definition of the tile assembly model [Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, Caltech, Pasadena, CA, June 1998; Paul Rothemund, Erik Winfree, The program-size complexity of selfassembled squares, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2001, pp. 459–468]. Research has identified two issues at the heart of self-assembling systems: the number of steps it takes for an assembly to complete… CONTINUE READING
Highly Cited
This paper has 94 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

94 Citations

01020'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Computerized exhaustive search for optimal self-assembly counters, in: The 2nd Annual Foundations of Nanoscience Conference, FNANO’05

  • Pablo Moisset de Espanes
  • 2005
2 Excerpts

Goldwasser , MingYang Kao , Pablo Moisset de Espanes , Robert T . Schweller , Complexities for generalized models of self - assembly

  • Gagan Aggarwal, Qi Cheng, H. Michael
  • SIAM Journal on Computing
  • 2005

Similar Papers

Loading similar papers…