| 2025 | DNA | Algorithmic Hardness of the Partition Function for Nucleic Acid Strands. | Gwendal Ducloz, Ahmed Shalaby, Damien Woods |
| 2025 | DNA | Tile Blockers as a Simple Motif to Control Self-Assembly: Kinetics and Thermodynamics. | Constantine G. Evans, Angel Cervera Roldan, Trent A. Rogers, Damien Woods |
| 2025 | ICALP | An Efficient Algorithm to Compute the Minimum Free Energy of Interacting Nucleic Acid Strands. | Ahmed Shalaby, Damien Woods |
| 2024 | DNA | Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. | Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby, Damien Woods |
| 2023 | DNA | Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer. | Ahmed Shalaby, Chris Thachuk, Damien Woods |
| 2021 | DNA | Small Tile Sets That Compute While Solving Mazes. | Matthew Cook, Tristan Strin, Damien Woods |
| 2020 | DNA | Turning Machines. | Irina Kostitsyna, Cai Wood, Damien Woods |
| 2020 | STOC | The program-size complexity of self-assembled paths. | Pierre-tienne Meunier, Damien Regnault, Damien Woods |
| 2017 | DNA | Thermodynamic Binding Networks. | David Doty, Trent A. Rogers, David Soloveichik, Chris Thachuk, Damien Woods |
| 2017 | STOC | The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. | Pierre-tienne Meunier, Damien Woods |
| 2014 | DNA | Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. | Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang |
| 2014 | ICALP | One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. | Erik D. Demaine, Martin L. Demaine, Sndor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods |
| 2014 | SODA | Intrinsic universality in tile self-assembly requires cooperation. | Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods |
| 2013 | DNA | Parallel Computation Using Active Self-assembly. | Moya Chen, Doris Xin, Damien Woods |
| 2013 | ICALP | The Two-Handed Tile Assembly Model Is Not Intrinsically Universal. | Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods |
| 2012 | FOCS | The Tile Assembly Model is Intrinsically Universal. | David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods |
| 2012 | SOFSEM | The Complexity of Small Universal Turing Machines: A Survey. | Turlough Neary, Damien Woods |
| 2010 | STACS | Intrinsic Universality in Self-Assembly. | David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods |
| 2009 | FCT | Small Weakly Universal Turing Machines. | Turlough Neary, Damien Woods |
| 2009 | UC | Random Number Selection in Self-assembly. | David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods |
| 2009 | UC | Membrane Dissolution and Division in P. | Damien Woods, Niall Murphy, Mario J. Prez-Jimnez, Agustin Riscos-Nez |
| 2008 | UC | A Characterisation of NL Using Membrane Systems without Charges and Dissolution. | Niall Murphy, Damien Woods |
| 2007 | CiE | The Complexity of Small Universal Turing Machines. | Damien Woods, Turlough Neary |
| 2007 | MCU | Four Small Universal Turing Machines. | Turlough Neary, Damien Woods |
| 2007 | MCU | Small Semi-weakly Universal Turing Machines. | Damien Woods, Turlough Neary |
| 2006 | FOCS | On the time complexity of 2-tag systems and small universal Turing machines. | Damien Woods, Turlough Neary |
| 2006 | ICALP | P-completeness of Cellular Automaton Rule 110. | Turlough Neary, Damien Woods |
| 2006 | UC | Optical Computing and Computational Complexity. | Damien Woods |
| 2005 | CiE | Complexity of Continuous Space Machine Operations. | Damien Woods, J. Paul Gibson |
| 2005 | ISAAC | Upper Bounds on the Computational Power of an Optical Model of Computation. | Damien Woods |
| 2005 | UC | Lower Bounds on the Computational Power of an Optical Model of Computation. | Damien Woods, J. Paul Gibson |
| 2001 | MCU | On the Computational Power of a Continuous-Space Optical Model of Computation. | Thomas J. Naughton, Damien Woods |