@InProceedings{furcy_et_al:LIPIcs.DNA.27.4,
author = {Furcy, David and Summers, Scott M. and Withers, Logan},
title = {{Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D}},
booktitle = {27th International Conference on DNA Computing and Molecular Programming (DNA 27)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-205-1},
ISSN = {1868-8969},
year = {2021},
volume = {205},
editor = {Lakin, Matthew R. and \v{S}ulc, Petr},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.27.4},
URN = {urn:nbn:de:0030-drops-146716},
doi = {10.4230/LIPIcs.DNA.27.4},
annote = {Keywords: Self-assembly, algorithmic self-assembly, tile self-assembly}
}