On the time complexity of 2-tag systems and small universal Turing machines. - Damien Woods; Turlough Neary (FOCS, 2006)

P-completeness of Cellular Automaton Rule 110. - Turlough Neary; Damien Woods (ICALP (1), 2006)

Small fast universal Turing machines. - Turlough Neary; Damien Woods (Theor. Comput. Sci., 2006)

The Complexity of Small Universal Turing Machines. - Damien Woods; Turlough Neary (CiE, 2007)

Four Small Universal Turing Machines. - Turlough Neary; Damien Woods (MCU, 2007)

Small Semi-weakly Universal Turing Machines. - Damien Woods; Turlough Neary (MCU, 2007)

On the Computational Complexity of Spiking Neural P Systems. - Turlough Neary (UC, 2008)

Small Weakly Universal Turing Machines. - Turlough Neary; Damien Woods (FCT, 2009)

A boundary between universality and non-universality in spiking neural P systems - Turlough Neary (CoRR, 2009)

A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems. - Turlough Neary (LATA, 2010)

Preface. - Damien Woods; Turlough Neary; Anthony Karel Seda (Theor. Comput. Sci., 2011)

The Complexity of Small Universal Turing Machines: A Survey. - Turlough Neary; Damien Woods (SOFSEM, 2012)

Undecidability in binary tag systems and the Post correspondence problem for four pairs of words. - Turlough Neary (CoRR, 2013)

Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy. - Turlough Neary; Damien Woods; Niall Murphy; Rainer Glaschick (J. Complex., 2014)

A Cellular Automaton for Blocking Queen Games. - Matthew Cook 001; Urban Larsson; Turlough Neary (Automata, 2015)

Tag Systems and the Complexity of Simple Programs. - Turlough Neary; Damien Woods (Automata, 2015)

Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words. - Turlough Neary (STACS, 2015)

Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines. - Damien Woods; Turlough Neary (Fundam. Informaticae, 2015)

Three small universal spiking neural P systems. - Turlough Neary (Theor. Comput. Sci., 2015)

2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets. - Turlough Neary (DCFS, 2017)

Generalized Tag Systems. - Turlough Neary; Matthew Cook 001 (RP, 2018)

Average-Case Completeness in Tag Systems. - Matthew Cook 001; Turlough Neary (STACS, 2019)

Preface. - Matthew Cook 001; Turlough Neary (Nat. Comput., 2019)