Turlough Neary - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2019

Average-Case Completeness in Tag SystemsMatthew Cook 0001, Turlough Neary. STACS 2019: [doi]

PrefaceMatthew Cook 0001, Turlough Neary. nc, 18(3):411-412, 2019. [doi]

2018

Generalized Tag SystemsTurlough Neary, Matthew Cook 0001. rp 2018: 103-116 [doi]

2017

A cellular automaton for blocking queen gamesMatthew Cook 0001, Urban Larsson, Turlough Neary. nc, 16(3):397-410, 2017. [doi]

2-State 2-Symbol Turing Machines with Periodic Support Produce Regular SetsTurlough Neary. dcfs 2017: 274-286 [doi]

2015

2014

Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toyTurlough Neary, Damien Woods, Niall Murphy, Rainer Glaschick. jc, 30(5):634-646, 2014. [doi]

2012

The Complexity of Small Universal Turing Machines: A SurveyTurlough Neary, Damien Woods. sofsem 2012: 385-405 [doi]

2011

PrefaceDamien Woods, Turlough Neary, Anthony Karel Seda. TCS, 412(1-2):1, 2011. [doi]

2010

A Boundary between Universality and Non-universality in Extended Spiking Neural P SystemsTurlough Neary. LATA 2010: 475-487 [doi]

On the computational complexity of spiking neural P systemsTurlough Neary. nc, 9(4):831-851, 2010. [doi]

2009

Small Weakly Universal Turing MachinesTurlough Neary, Damien Woods. fct 2009: 262-273 [doi]

Four Small Universal Turing MachinesTurlough Neary, Damien Woods. FUIN, 91(1):123-144, 2009. [doi]

Small Semi-Weakly Universal Turing MachinesDamien Woods, Turlough Neary. FUIN, 91(1):179-195, 2009. [doi]

The complexity of small universal Turing machines: A surveyDamien Woods, Turlough Neary. TCS, 410(4-5):443-450, 2009. [doi]

2008

On the Computational Complexity of Spiking Neural P SystemsTurlough Neary. uc 2008: 189-205 [doi]

2007

Four Small Universal Turing MachinesTurlough Neary, Damien Woods. mcu 2007: 242-254 [doi]

Small Semi-weakly Universal Turing MachinesDamien Woods, Turlough Neary. mcu 2007: 303-315 [doi]

The Complexity of Small Universal Turing MachinesDamien Woods, Turlough Neary. cie 2007: 791-799 [doi]

2006

P-completeness of Cellular Automaton Rule 110Turlough Neary, Damien Woods. icalp 2006: 132-143 [doi]

Small fast universal Turing machinesTurlough Neary, Damien Woods. TCS, 362(1-3):171-195, 2006. [doi]

On the time complexity of 2-tag systems and small universal Turing machinesDamien Woods, Turlough Neary. focs 2006: 439-448 [doi]

Sign in or sign up to see more results.

runs on WebDSL