Damien Woods

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 25

Top Topics

Polynomial Size

Partition Function

Top Venues

Fundam. Informaticae

Publications

Irina Kostitsyna, Cai Wood, Damien Woods
Turning machines: a simple algorithmic model for molecular robotics. Nat. Comput. 23 (2) (2024)
Ahmed Shalaby, Damien Woods
An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands. CoRR (2024)
Aaron T. Becker, Sándor P. Fekete, Irina Kostitsyna, Matthew J. Patitz, Damien Woods, Ioannis Chatzigiannakis
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091). Dagstuhl Reports 13 (2) (2023)
David Doty, Niels Kornerup, Austin Luchsinger, Leo Orshansky, David Soloveichik, Damien Woods
Harvesting Brownian Motion: Zero Energy Computational Sampling. CoRR (2023)
Ahmed Shalaby, Chris Thachuk, Damien Woods
Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer. DNA (2023)
Matthew Cook, Tristan Stérin, Damien Woods
Small Tile Sets That Compute While Solving Mazes. DNA (2021)
Matthew Cook, Tristan Stérin, Damien Woods
Small tile sets that compute while solving mazes. CoRR (2021)
Tristan Stérin, Damien Woods
On the hardness of knowing busy beaver values BB(15) and BB(5, 4). CoRR (2021)
Tristan Stérin, Damien Woods
The Collatz Process Embeds a Base Conversion Algorithm. RP (2020)
Tristan Stérin, Damien Woods
Limitations on counting in Boolean circuits and self-assembly. CoRR (2020)
Pierre-Étienne Meunier, Damien Regnault, Damien Woods
The program-size complexity of self-assembled paths. CoRR (2020)
Pierre-Étienne Meunier, Damien Regnault, Damien Woods
The program-size complexity of self-assembled paths. STOC (2020)
Irina Kostitsyna, Cai Wood, Damien Woods
Turning machines. CoRR (2020)
Tristan Stérin, Damien Woods
The Collatz process embeds a base conversion algorithm. CoRR (2020)
Irina Kostitsyna, Cai Wood, Damien Woods
Turning Machines. DNA (2020)
Damien Woods, David Doty, Cameron Myhrvold, Joy Hui, Felix Zhou, Peng Yin, Erik Winfree
Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nat. 567 (7748) (2019)
Damien Woods, Yannick Rondelez
Preface. Nat. Comput. 17 (1) (2018)
Pierre-Étienne Meunier, Damien Woods
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. CoRR (2017)
David Doty, Trent A. Rogers, David Soloveichik, Chris Thachuk, Damien Woods
Thermodynamic Binding Networks. CoRR (2017)
David Doty, Trent A. Rogers, David Soloveichik, Chris Thachuk, Damien Woods
Thermodynamic Binding Networks. DNA (2017)
Pierre-Étienne Meunier, Damien Woods
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. STOC (2017)
Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
The Two-Handed Tile Assembly Model is not Intrinsically Universal. Algorithmica 74 (2) (2016)
Damien Woods, Turlough Neary
Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines. Fundam. Informaticae 138 (1-2) (2015)
Turlough Neary, Damien Woods
Tag Systems and the Complexity of Simple Programs. Automata (2015)
Moya Chen, Doris Xin, Damien Woods
Parallel computation using active self-assembly. Nat. Comput. 14 (2) (2015)
Niall Murphy, Damien Woods
Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems. Fundam. Informaticae 134 (1-2) (2014)
Niall Murphy, Damien Woods
Uniformity is weaker than semi-uniformity for some membrane systems. CoRR (2014)
Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods
Intrinsic universality in tile self-assembly requires cooperation. SODA (2014)
Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy. J. Complex. 30 (5) (2014)
Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. ICALP (1) (2014)
Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang
Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. DNA (2014)
Moya Chen, Doris Xin, Damien Woods
Parallel computation using active self-assembly. CoRR (2014)
Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang
Fast algorithmic self-assembly of simple shapes using random agitation. CoRR (2014)
Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy CoRR (2013)
Moya Chen, Doris Xin, Damien Woods
Parallel Computation Using Active Self-assembly. DNA (2013)
Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal. ICALP (1) (2013)
Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods
Intrinsic universality in tile self-assembly requires cooperation CoRR (2013)
Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, Peng Yin
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. ITCS (2013)
Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods
The two-handed tile assembly model is not intrinsically universal. CoRR (2013)
Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, Peng Yin
Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time CoRR (2013)
Niall Murphy, Damien Woods
AND and/or OR: Uniform Polynomial-Size Circuits MCU (2013)
Damien Woods
Intrinsic universality and the computational power of self-assembly. MCU (2013)
David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods
The Tile Assembly Model is Intrinsically Universal. FOCS (2012)
Turlough Neary, Damien Woods
The Complexity of Small Universal Turing Machines: A Survey. SOFSEM (2012)
Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece CoRR (2012)
David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods
The tile assembly model is intrinsically universal CoRR (2011)
Turlough Neary, Damien Woods
The complexity of small universal Turing machines: a survey CoRR (2011)
Niall Murphy, Damien Woods
The computational power of membrane systems under tight uniformity conditions. Nat. Comput. 10 (1) (2011)
Damien Woods, Turlough Neary, Anthony Karel Seda
Preface. Theor. Comput. Sci. 412 (1-2) (2011)
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods
Intrinsic Universality in Self-Assembly. STACS (2010)
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods
Intrinsic Universality in Self-Assembly CoRR (2010)
Damien Woods, Thomas J. Naughton
Optical computing. Appl. Math. Comput. 215 (4) (2009)
Damien Woods, Turlough Neary
Small Semi-Weakly Universal Turing Machines. Fundam. Informaticae 91 (1) (2009)
Turlough Neary, Damien Woods
Four Small Universal Turing Machines. Fundam. Informaticae 91 (1) (2009)
Damien Woods, Niall Murphy, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez
Membrane Dissolution and Division in P. UC (2009)
Turlough Neary, Damien Woods
Small Weakly Universal Turing Machines. FCT (2009)
Damien Woods, Turlough Neary
The complexity of small universal Turing machines: A survey. Theor. Comput. Sci. 410 (4-5) (2009)
David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Damien Woods
Random Number Selection in Self-assembly. UC (2009)
Niall Murphy, Damien Woods
A Characterisation of NL Using Membrane Systems without Charges and Dissolution. UC (2008)
Damien Woods, Thomas J. Naughton
Parallel and Sequential Optical Computing. OSC (2008)
Niall Murphy, Thomas J. Naughton, Damien Woods, Beverley Henley, Kieran McDermott, Elaine Duffy, Peter J. M. Van Der Burgt, Niamh Woods
Implementations of a Model of Physical Sorting. Int. J. Unconv. Comput. 4 (1) (2008)
Damien Woods, J. Paul Gibson
Lower bounds on the computational power of an optical model of computation. Nat. Comput. 7 (1) (2008)
Niall Murphy, Damien Woods
On acceptance conditions for membrane systems: characterisations of L and NL CSP (2008)
Damien Woods, Turlough Neary
Small Semi-weakly Universal Turing Machines. MCU (2007)
Damien Woods, Turlough Neary
The Complexity of Small Universal Turing Machines. CiE (2007)
Turlough Neary, Damien Woods
Small weakly universal Turing machines CoRR (2007)
Turlough Neary, Damien Woods
Four Small Universal Turing Machines. MCU (2007)
Niall Murphy, Damien Woods
Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P. Workshop on Membrane Computing (2007)
Damien Woods
Optical Computing and Computational Complexity. UC (2006)
Damien Woods, Turlough Neary
On the time complexity of 2-tag systems and small universal Turing machines. FOCS (2006)
Damien Woods, Turlough Neary
On the time complexity of 2-tag systems and small universal Turing machines CoRR (2006)
Turlough Neary, Damien Woods
Small fast universal Turing machines. Theor. Comput. Sci. 362 (1-3) (2006)
Turlough Neary, Damien Woods
P-completeness of Cellular Automaton Rule 110. ICALP (1) (2006)
Damien Woods
Upper Bounds on the Computational Power of an Optical Model of Computation. ISAAC (2005)
Damien Woods, Thomas J. Naughton
An optical model of computation. Theor. Comput. Sci. 334 (1-3) (2005)
Damien Woods, J. Paul Gibson
Complexity of Continuous Space Machine Operations. CiE (2005)
Damien Woods, J. Paul Gibson
Lower Bounds on the Computational Power of an Optical Model of Computation. UC (2005)
Thomas J. Naughton, Damien Woods
On the Computational Power of a Continuous-Space Optical Model of Computation. MCU (2001)