| No. |
Title |
Author |
Year |
| 1 |
Complexity of Reconfiguration in Surface Chemical Reaction Networks |
Alaniz, Robert M. et al. |
2023 |
| 2 |
Covert Computation in the Abstract Tile-Assembly Model |
Alaniz, Robert M. et al. |
2023 |
| 3 |
Building Squares with Optimal State Complexity in Restricted Active Self-Assembly |
Alaniz, Robert M. et al. |
2022 |
| 4 |
Complexity of Verification in Self-Assembly with Prebuilt Assemblies |
Caballero, David et al. |
2022 |
| 5 |
Unique Assembly Verification in Two-Handed Self-Assembly |
Caballero, David et al. |
2022 |
| 6 |
Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete |
Caballero, David et al. |
2021 |
| 7 |
Signal Passing Self-Assembly Simulates Tile Automata |
Cantu, Angel A. et al. |
2020 |
| 8 |
Verification and Computation in Restricted Tile Automata |
Caballero, David et al. |
2020 |
| 9 |
Covert Computation in Self-Assembled Circuits |
Cantu, Angel A. et al. |
2019 |
| 10 |
Self-Assembly of Any Shape with Constant Tile Types using High Temperature |
Chalk, Cameron et al. |
2018 |
| 11 |
Optimal Staged Self-Assembly of General Shapes |
Chalk, Cameron et al. |
2016 |
| 12 |
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM |
Cannon, Sarah et al. |
2013 |
| 13 |
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) |
Demaine, Erik D. et al. |
2011 |
