dblp.uni-trier.dewww.uni-trier.de

Damien Woods

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

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

Coauthor Index

1J. Paul Gibson [3] [5] [16]
2Niall Murphy [12] [17] [19] [20]
3Thomas J. Naughton [1] [2] [18]
4Turlough Neary [6] [7] [9] [10] [11] [13] [14] [15] [20] [21] [22] [23]
5Anthony Karel Seda [20]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)