| P-completeness of cellular automaton Rule 110 T Neary, D Woods International Colloquium on Automata, Languages, and Programming, 132-143, 2006 | 135 | 2006 |
| The complexity of small universal Turing machines: a survey T Neary, D Woods International Conference on Current Trends in Theory and Practice of …, 2012 | 115* | 2012 |
| Four small universal Turing machines T Neary, D Woods Fundamenta Informaticae 91 (1), 123-144, 2009 | 107* | 2009 |
| On the time complexity of 2-tag systems and small universal Turing machines D Woods, T Neary 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 61 | 2006 |
| Small fast universal Turing machines T Neary, D Woods Theoretical Computer Science 362 (1-3), 171-195, 2006 | 48 | 2006 |
| Undecidability in binary tag systems and the Post correspondence problem for five pairs of words T Neary Proceedings of the 32nd International Symposium on Theoretical Aspects of …, 2015 | 38 | 2015 |
| Small weakly universal Turing machines T Neary, D Woods International Symposium on Fundamentals of Computation Theory, 262-273, 2009 | 36 | 2009 |
| On the computational complexity of spiking neural P systems T Neary Natural Computing 9, 831-851, 2010 | 29 | 2010 |
| Small semi-weakly universal Turing machines D Woods, T Neary Fundamenta Informaticae 91 (1), 179-195, 2009 | 28 | 2009 |
| A boundary between universality and non-universality in extended spiking neural P systems T Neary International Conference on Language and Automata Theory and Applications …, 2010 | 26 | 2010 |
| Small universal Turing machines T Neary National University of Ireland, Maynooth, 2008 | 24 | 2008 |
| Three small universal spiking neural P systems T Neary Theoretical Computer Science 567, 2-20, 2015 | 21 | 2015 |
| A universal spiking neural P system with 11 neurons T Neary Proceedings of the Eleventh International Conference on Membrane Computing …, 2010 | 16 | 2010 |
| A small universal spiking neural P system T Neary International Workshop on Computing with Biomolecules, 65-74, 2008 | 9 | 2008 |
| A cellular automaton for blocking queen games M Cook, U Larsson, T Neary Natural Computing 16, 397-410, 2017 | 8 | 2017 |
| A boundary between universality and non-universality in spiking neural P systems T Neary arXiv preprint arXiv:0912.0741, 2009 | 6 | 2009 |
| Small semi-weakly universal Turing machines T Neary, D Woods Fundamenta Informaticae 91 (1), 179-195, 2009 | 5 | 2009 |
| Remarks on the computational complexity of small universal Turing machines D Woods, T Neary MFCSIT: Fourth Irish Conference on the Mathematical Foundations of Computer …, 2006 | 4 | 2006 |
| Undecidability in binary tag systems and the Post correspondence problem for four pairs of words T Neary arXiv preprint arXiv:1312.6700, 2013 | 3 | 2013 |
| Wang’s B machines are efficiently universal, as is Hasenjaeger’s small universal electromechanical toy T Neary, D Woods, N Murphy, R Glaschick Journal of Complexity 30 (5), 634-646, 2014 | 2 | 2014 |
Damien WoodsProfessor at the Hamilton Institute, Maynooth University在 mu.ie 的电子邮件经过验证
