Damien Woods

According to our database1, Damien Woods authored at least 46 papers between 2001 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
The program-size complexity of self-assembled paths.
CoRR, 2020

2018
Preface.
Natural Computing, 2018

2017
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Thermodynamic Binding Networks.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016
Intrinsic Universality in Self-Assembly.
Encyclopedia of Algorithms, 2016

Active Self-Assembly and Molecular Robotics with Nubots.
Encyclopedia of Algorithms, 2016

The Two-Handed Tile Assembly Model is not Intrinsically Universal.
Algorithmica, 2016

2015
Parallel computation using active self-assembly.
Natural Computing, 2015

Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines.
Fundam. Inform., 2015

Tag Systems and the Complexity of Simple Programs.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

2014
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy.
J. Complex., 2014

Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems.
Fundam. Inform., 2014

Intrinsic universality in tile self-assembly requires cooperation.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation.
Proceedings of the DNA Computing and Molecular Programming - 20th International Conference, 2014

2013
AND and/or OR: Uniform Polynomial-Size Circuits
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

Intrinsic universality and the computational power of self-assembly.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

Active self-assembly of algorithmic shapes and patterns in polylogarithmic time.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
CoRR, 2012

The Tile Assembly Model is Intrinsically Universal.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Preface.
Theor. Comput. Sci., 2011

The computational power of membrane systems under tight uniformity conditions.
Natural Computing, 2011

2010
Intrinsic Universality in Self-Assembly.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009
Optical Computing.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

The complexity of small universal Turing machines: A survey.
Theor. Comput. Sci., 2009

Small Semi-Weakly Universal Turing Machines.
Fundam. Inform., 2009

Four Small Universal Turing Machines.
Fundam. Inform., 2009

Optical computing.
Appl. Math. Comput., 2009

Membrane Dissolution and Division in P.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Random Number Selection in Self-assembly.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Small Weakly Universal Turing Machines.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008
Lower bounds on the computational power of an optical model of computation.
Natural Computing, 2008

Implementations of a Model of Physical Sorting.
IJUC, 2008

On acceptance conditions for membrane systems: characterisations of L and NL
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

A Characterisation of NL Using Membrane Systems without Charges and Dissolution.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

Parallel and Sequential Optical Computing.
Proceedings of the Optical Super Computing, First International Workshop, 2008

2007
Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

The Complexity of Small Universal Turing Machines.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Small fast universal Turing machines.
Theor. Comput. Sci., 2006

Optical Computing and Computational Complexity.
Proceedings of the Unconventional Computation, 5th International Conference, 2006

P-completeness of Cellular Automaton Rule 110.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On the time complexity of 2-tag systems and small universal Turing machines.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
An optical model of computation.
Theor. Comput. Sci., 2005

Upper Bounds on the Computational Power of an Optical Model of Computation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Complexity of Continuous Space Machine Operations.
Proceedings of the New Computational Paradigms, 2005

2001
On the Computational Power of a Continuous-Space Optical Model of Computation.
Proceedings of the Machines, 2001


  Loading...