Skip to content
cs-conference-ranking.org

Turlough Neary

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

11

Venues

9

Active years

2006–2019

Best venue rank

A*

Where they publish

Papers

11 indexed papers, newest first.

YearVenueTitleAuthors
2019STACSAverage-Case Completeness in Tag Systems.Matthew Cook, Turlough Neary
2015STACSUndecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words.Turlough Neary
2012SOFSEMThe Complexity of Small Universal Turing Machines: A Survey.Turlough Neary, Damien Woods
2010LATAA Boundary between Universality and Non-universality in Extended Spiking Neural P Systems.Turlough Neary
2009FCTSmall Weakly Universal Turing Machines.Turlough Neary, Damien Woods
2008UCOn the Computational Complexity of Spiking Neural P Systems.Turlough Neary
2007CiEThe Complexity of Small Universal Turing Machines.Damien Woods, Turlough Neary
2007MCUFour Small Universal Turing Machines.Turlough Neary, Damien Woods
2007MCUSmall Semi-weakly Universal Turing Machines.Damien Woods, Turlough Neary
2006FOCSOn the time complexity of 2-tag systems and small universal Turing machines.Damien Woods, Turlough Neary
2006ICALPP-completeness of Cellular Automaton Rule 110.Turlough Neary, Damien Woods