2009 |
23 | EE | Turlough Neary,
Damien Woods:
Four Small Universal Turing Machines.
Fundam. Inform. 91(1): 123-144 (2009) |
22 | EE | Damien Woods,
Turlough Neary:
Small Semi-Weakly Universal Turing Machines.
Fundam. Inform. 91(1): 179-195 (2009) |
21 | EE | Damien Woods,
Turlough Neary:
The complexity of small universal Turing machines: A survey.
Theor. Comput. Sci. 410(4-5): 443-450 (2009) |
2008 |
20 | | Turlough Neary,
Damien Woods,
Anthony Karel Seda,
Niall Murphy:
Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings
Cork University Press 2008 |
19 | | Niall Murphy,
Damien Woods:
On acceptance conditions for membrane systems: characterisations of L and NL.
CSP 2008: 225-242 |
18 | EE | Damien Woods,
Thomas J. Naughton:
Parallel and Sequential Optical Computing.
OSC 2008: 70-86 |
17 | EE | Niall Murphy,
Damien Woods:
A Characterisation of NL Using Membrane Systems without Charges and Dissolution.
UC 2008: 164-176 |
16 | EE | Damien Woods,
J. Paul Gibson:
Lower bounds on the computational power of an optical model of computation.
Natural Computing 7(1): 95-108 (2008) |
2007 |
15 | EE | Damien Woods,
Turlough Neary:
The Complexity of Small Universal Turing Machines.
CiE 2007: 791-799 |
14 | EE | Turlough Neary,
Damien Woods:
Four Small Universal Turing Machines.
MCU 2007: 242-254 |
13 | EE | Damien Woods,
Turlough Neary:
Small Semi-weakly Universal Turing Machines.
MCU 2007: 303-315 |
12 | EE | Niall Murphy,
Damien Woods:
Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P.
Workshop on Membrane Computing 2007: 367-384 |
11 | EE | Turlough Neary,
Damien Woods:
Small weakly universal Turing machines
CoRR abs/0707.4489: (2007) |
2006 |
10 | EE | Damien Woods,
Turlough Neary:
On the time complexity of 2-tag systems and small universal Turing machines.
FOCS 2006: 439-448 |
9 | EE | Turlough Neary,
Damien Woods:
P-completeness of Cellular Automaton Rule 110.
ICALP (1) 2006: 132-143 |
8 | EE | Damien Woods:
Optical Computing and Computational Complexity.
UC 2006: 27-40 |
7 | EE | Damien Woods,
Turlough Neary:
On the time complexity of 2-tag systems and small universal Turing machines
CoRR abs/cs/0612089: (2006) |
6 | EE | Turlough Neary,
Damien Woods:
Small fast universal Turing machines.
Theor. Comput. Sci. 362(1-3): 171-195 (2006) |
2005 |
5 | EE | Damien Woods,
J. Paul Gibson:
Complexity of Continuous Space Machine Operations.
CiE 2005: 540-551 |
4 | EE | Damien Woods:
Upper Bounds on the Computational Power of an Optical Model of Computation.
ISAAC 2005: 777-788 |
3 | EE | Damien Woods,
J. Paul Gibson:
Lower Bounds on the Computational Power of an Optical Model of Computation.
UC 2005: 237-250 |
2 | EE | Damien Woods,
Thomas J. Naughton:
An optical model of computation.
Theor. Comput. Sci. 334(1-3): 227-258 (2005) |
2001 |
1 | EE | Thomas J. Naughton,
Damien Woods:
On the Computational Power of a Continuous-Space Optical Model of Computation.
MCU 2001: 288-299 |