Author:
Furcy David,Summers Scott M.,Vadnais Hailey
Funder
University of Wisconsin Oshkosh
Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Adleman LM, Cheng Q, Goel A, et al (2001) Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on theory of computing (STOC), pp 740–748
2. Aggarwal G, Cheng Q, Goldwasser MH et al (2005) Complexities for generalized models of self-assembly. SIAM J Comput (SICOMP) 34:1493–1515
3. Cook M, Fu Y, Schweller RT (2011) Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of the twenty-second annual ACM-SIAM symposium on discrete algorithms (SODA), pp 570–589
4. Furcy D, Summers SM, Wendlandt C (2019) New bounds on the tile complexity of thin rectangles at temperature-1. In: DNA Computing and molecular programming—25th international conference, DNA 25, Seattle, WA, USA, 5–9 Aug 2019, Proceedings, Lecture Notes in Computer Science, vol 11648. Springer, pp 100–119
5. Furcy D, Summers SM, Withers L (2021) Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3d. In: 27th International conference on DNA computing and molecular programming, DNA 27, 13–16 Sept 2021, Oxford, UK (Virtual Conference), LIPIcs, vol 205. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp 4:1–4:18