| 2009 |
|---|
| 13 | EE | Turlough Neary,
Damien Woods:
Four Small Universal Turing Machines.
Fundam. Inform. 91(1): 123-144 (2009) |
| 12 | EE | Damien Woods,
Turlough Neary:
Small Semi-Weakly Universal Turing Machines.
Fundam. Inform. 91(1): 179-195 (2009) |
| 11 | EE | Damien Woods,
Turlough Neary:
The complexity of small universal Turing machines: A survey.
Theor. Comput. Sci. 410(4-5): 443-450 (2009) |
| 2008 |
|---|
| 10 | | 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 |
| 9 | EE | Turlough Neary:
On the Computational Complexity of Spiking Neural P Systems.
UC 2008: 189-205 |
| 2007 |
|---|
| 8 | EE | Damien Woods,
Turlough Neary:
The Complexity of Small Universal Turing Machines.
CiE 2007: 791-799 |
| 7 | EE | Turlough Neary,
Damien Woods:
Four Small Universal Turing Machines.
MCU 2007: 242-254 |
| 6 | EE | Damien Woods,
Turlough Neary:
Small Semi-weakly Universal Turing Machines.
MCU 2007: 303-315 |
| 5 | EE | Turlough Neary,
Damien Woods:
Small weakly universal Turing machines
CoRR abs/0707.4489: (2007) |
| 2006 |
|---|
| 4 | EE | Damien Woods,
Turlough Neary:
On the time complexity of 2-tag systems and small universal Turing machines.
FOCS 2006: 439-448 |
| 3 | EE | Turlough Neary,
Damien Woods:
P-completeness of Cellular Automaton Rule 110.
ICALP (1) 2006: 132-143 |
| 2 | EE | Damien Woods,
Turlough Neary:
On the time complexity of 2-tag systems and small universal Turing machines
CoRR abs/cs/0612089: (2006) |
| 1 | EE | Turlough Neary,
Damien Woods:
Small fast universal Turing machines.
Theor. Comput. Sci. 362(1-3): 171-195 (2006) |
