Damien Woods
Damien Woods
Professor at the Hamilton Institute, Maynooth University
Verified email at - Homepage
Cited by
Cited by
A cargo-sorting DNA robot
AJ Thubagere, W Li, RF Johnson, Z Chen, S Doroudi, YL Lee, G Izatt, ...
Science 357 (6356), eaan6558, 2017
Diverse and robust molecular algorithms using reprogrammable DNA self-assembly
D Woods, D Doty, C Myhrvold, J Hui, F Zhou, P Yin, E Winfree
Nature 567 (7748), 366-372, 2019
Photonic neural networks
D Woods, TJ Naughton
Nature Physics 8 (4), 257-259, 2012
P-completeness of cellular automaton Rule 110
T Neary, D Woods
International Colloquium on Automata, Languages, and Programming, 132-143, 2006
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
D Woods, HL Chen, S Goodfriend, N Dabby, E Winfree, P Yin
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
The tile assembly model is intrinsically universal
D Doty, JH Lutz, MJ Patitz, RT Schweller, SM Summers, D Woods
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 302-310, 2012
The complexity of small universal Turing machines: A survey
D Woods, T Neary
Theoretical Computer Science 410 (4-5), 443-450, 2009
Four small universal Turing machines
T Neary, D Woods
Fundamenta Informaticae 91 (1), 123-144, 2009
Intrinsic universality in tile self-assembly requires cooperation
PE Meunier, MJ Patitz, SM Summers, G Theyssier, A Winslow, D Woods
Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014
The two-handed tile assembly model is not intrinsically universal
ED Demaine, MJ Patitz, TA Rogers, RT Schweller, SM Summers, ...
Algorithmica 74 (2), 812-850, 2016
An optical model of computation
D Woods, TJ Naughton
Theoretical Computer Science 334 (1-3), 227-258, 2005
On the time complexity of 2-tag systems and small universal Turing machines
T Neary, D Woods
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer …, 2006
The computational power of membrane systems under tight uniformity conditions
N Murphy, D Woods
Natural Computing 10, 613-632, 2011
One tile to rule them all: Simulating any tile assembly system with a single universal tile
ED Demaine, ML Demaine, SP Fekete, MJ Patitz, RT Schweller, ...
International Colloquium on Automata, Languages, and Programming, 368-379, 2014
Optical computing
D Woods, TJ Naughton
Applied Mathematics and Computation 215 (4), 1417-1430, 2009
Small fast universal Turing machines
T Neary, D Woods
Theoretical Computer Science 362 (1-3), 171-195, 2006
Intrinsic universality and the computational power of self-assembly
D Woods
Philosophical transactions of the royal society 373 (2046), 20140214, 2015
Intrinsic universality in self-assembly
D Doty, JH Lutz, MJ Patitz, SM Summers, D Woods
STACS 2010: The 27th International Symposium on Theoretical Aspects of …, 2010
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
PÉ Meunier, D Woods
proceedings of the 49th annual ACM SIGACT symposium on theory of computing …, 2017
On the computational power of a continuous-space optical model of computation
TJ Naughton, D Woods
Machines, Computations, and Universality: Third International Conference …, 2001
The system can't perform the operation now. Try again later.
Articles 1–20