Turlough Neary

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
i6		Turlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick: Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy. CoRR abs/1304.0053 (2013)
	2012
c9		Turlough Neary, Damien Woods: The Complexity of Small Universal Turing Machines: A Survey. SOFSEM 2012: 385-405
	2011
j6		Damien Woods, Turlough Neary, Anthony Karel Seda: Preface. Theor. Comput. Sci. 412(1-2): 1 (2011)
i5		Turlough Neary, Damien Woods: The complexity of small universal Turing machines: a survey. CoRR abs/1110.2230 (2011)
	2010
j5		Turlough Neary: On the computational complexity of spiking neural P systems. Natural Computing 9(4): 831-851 (2010)
c8		Turlough Neary: A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems. LATA 2010: 475-487
	2009
j4		Turlough Neary, Damien Woods: Four Small Universal Turing Machines. Fundam. Inform. 91(1): 123-144 (2009)
j3		Damien Woods, Turlough Neary: Small Semi-Weakly Universal Turing Machines. Fundam. Inform. 91(1): 179-195 (2009)
j2		Damien Woods, Turlough Neary: The complexity of small universal Turing machines: A survey. Theor. Comput. Sci. 410(4-5): 443-450 (2009)
c7		Turlough Neary, Damien Woods: Small Weakly Universal Turing Machines. FCT 2009: 262-273
e1		Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy (Eds.): Proceedings International Workshop on The Complexity of Simple Programs, Cork, Ireland, 6-7th December 2008. EPTCS 1, 2009
i4		Turlough Neary: A boundary between universality and non-universality in spiking neural P systems. CoRR abs/0912.0741 (2009)
i3		Turlough Neary: On the computational complexity of spiking neural P systems. CoRR abs/0912.0928 (2009)
	2008
c6		Turlough Neary: On the Computational Complexity of Spiking Neural P Systems. UC 2008: 189-205
	2007
c5		Damien Woods, Turlough Neary: The Complexity of Small Universal Turing Machines. CiE 2007: 791-799
c4		Turlough Neary, Damien Woods: Four Small Universal Turing Machines. MCU 2007: 242-254
c3		Damien Woods, Turlough Neary: Small Semi-weakly Universal Turing Machines. MCU 2007: 303-315
i2		Turlough Neary, Damien Woods: Small weakly universal Turing machines. CoRR abs/0707.4489 (2007)
	2006
j1		Turlough Neary, Damien Woods: Small fast universal Turing machines. Theor. Comput. Sci. 362(1-3): 171-195 (2006)
c2		Damien Woods, Turlough Neary: On the time complexity of 2-tag systems and small universal Turing machines. FOCS 2006: 439-448
c1		Turlough Neary, Damien Woods: P-completeness of Cellular Automaton Rule 110. ICALP (1) 2006: 132-143
i1		Damien Woods, Turlough Neary: On the time complexity of 2-tag systems and small universal Turing machines. CoRR abs/cs/0612089 (2006)

Coauthor Index

1	Rainer Glaschick	[i6]
2	Niall Murphy	[i6] [e1]
3	Anthony Karel Seda	[j6] [e1]
4	Damien Woods	[i6] [c9] [j6] [i5] [j4] [j3] [j2] [c7] [e1] [c5] [c4] [c3] [i2] [j1] [c2] [c1] [i1]

Last update Thu May 23 06:41:14 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page