The SCEAS System
| |||||||

## Search the dblp DataBase
Damien Woods:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Damien Woods, J. Paul Gibson
**Complexity of Continuous Space Machine Operations.**[Citation Graph (0, 0)][DBLP] CiE, 2005, pp:540-551 [Conf] - Damien Woods, Turlough Neary
**On the time complexity of 2-tag systems and small universal Turing machines.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:439-448 [Conf] - Turlough Neary, Damien Woods
**P-completeness of Cellular Automaton Rule 110.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:132-143 [Conf] - Damien Woods
**Upper Bounds on the Computational Power of an Optical Model of Computation.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:777-788 [Conf] - Thomas J. Naughton, Damien Woods
**On the Computational Power of a Continuous-Space Optical Model of Computation.**[Citation Graph (0, 0)][DBLP] MCU, 2001, pp:288-299 [Conf] - Damien Woods, J. Paul Gibson
**Lower Bounds on the Computational Power of an Optical Model of Computation.**[Citation Graph (0, 0)][DBLP] UC, 2005, pp:237-250 [Conf] - Damien Woods
**Optical Computing and Computational Complexity.**[Citation Graph (0, 0)][DBLP] UC, 2006, pp:27-40 [Conf] - Turlough Neary, Damien Woods
**Small fast universal Turing machines.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:171-195 [Journal] - Damien Woods, Thomas J. Naughton
**An optical model of computation.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:334, n:1-3, pp:227-258 [Journal] - Damien Woods, Turlough Neary
**The Complexity of Small Universal Turing Machines.**[Citation Graph (0, 0)][DBLP] CiE, 2007, pp:791-799 [Conf] - Damien Woods, Turlough Neary
**Small Semi-weakly Universal Turing Machines.**[Citation Graph (0, 0)][DBLP] MCU, 2007, pp:303-315 [Conf] - Turlough Neary, Damien Woods
**Four Small Universal Turing Machines.**[Citation Graph (0, 0)][DBLP] MCU, 2007, pp:242-254 [Conf] - Damien Woods, Turlough Neary
**On the time complexity of 2-tag systems and small universal Turing machines**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Turlough Neary, Damien Woods
**Small weakly universal Turing machines**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Small Weakly Universal Turing Machines.**[Citation Graph (, )][DBLP]**Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P.**[Citation Graph (, )][DBLP]**Intrinsic Universality in Self-Assembly.**[Citation Graph (, )][DBLP]**Random Number Selection in Self-assembly.**[Citation Graph (, )][DBLP]**A Characterisation of NL Using Membrane Systems without Charges and Dissolution.**[Citation Graph (, )][DBLP]**Membrane Dissolution and Division in P.**[Citation Graph (, )][DBLP]**Parallel and Sequential Optical Computing.**[Citation Graph (, )][DBLP]**On acceptance conditions for membrane systems: characterisations of L and NL**[Citation Graph (, )][DBLP]**Intrinsic Universality in Self-Assembly**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |