Turlough Neary Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy: Proceedings International Workshop on The Complexity of Simple Programs, Cork, Ireland, 6-7th December 2008 CSP 2009
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary, Damien Woods: Small Weakly Universal Turing Machines. FCT 2009: 262-273
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary: A boundary between universality and non-universality in spiking neural P systems CoRR abs/0912.0741: (2009)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary: On the computational complexity of spiking neural P systems CoRR abs/0912.0928: (2009)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary, Damien Woods: Four Small Universal Turing Machines. Fundam. Inform. 91(1): 123-144 (2009)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDamien Woods, Turlough Neary: Small Semi-Weakly Universal Turing Machines. Fundam. Inform. 91(1): 179-195 (2009)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDamien Woods, Turlough Neary: The complexity of small universal Turing machines: A survey. Theor. Comput. Sci. 410(4-5): 443-450 (2009)
2008
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary: On the Computational Complexity of Spiking Neural P Systems. UC 2008: 189-205
2007
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDamien Woods, Turlough Neary: The Complexity of Small Universal Turing Machines. CiE 2007: 791-799
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary, Damien Woods: Four Small Universal Turing Machines. MCU 2007: 242-254
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDamien Woods, Turlough Neary: Small Semi-weakly Universal Turing Machines. MCU 2007: 303-315
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary, Damien Woods: Small weakly universal Turing machines CoRR abs/0707.4489: (2007)
2006
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDamien Woods, Turlough Neary: On the time complexity of 2-tag systems and small universal Turing machines. FOCS 2006: 439-448
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary, Damien Woods: P-completeness of Cellular Automaton Rule 110. ICALP (1) 2006: 132-143
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDamien Woods, Turlough Neary: On the time complexity of 2-tag systems and small universal Turing machines CoRR abs/cs/0612089: (2006)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTurlough Neary, Damien Woods: Small fast universal Turing machines. Theor. Comput. Sci. 362(1-3): 171-195 (2006)

Coauthor Index

1Niall Murphy [16]
2Anthony Karel Seda [16]
3Damien Woods [1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [15] [16]

Copyright © Mon Mar 15 21:39:48 2010 by Michael Ley (ley@uni-trier.de)