|
Search the dblp DataBase
Turlough Neary:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Damien Woods, Turlough Neary
On the time complexity of 2-tag systems and small universal Turing machines. [Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:439-448 [Conf]
- Turlough Neary, Damien Woods
P-completeness of Cellular Automaton Rule 110. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:132-143 [Conf]
- Turlough Neary, Damien Woods
Small fast universal Turing machines. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:171-195 [Journal]
- Damien Woods, Turlough Neary
The Complexity of Small Universal Turing Machines. [Citation Graph (0, 0)][DBLP] CiE, 2007, pp:791-799 [Conf]
- Damien Woods, Turlough Neary
Small Semi-weakly Universal Turing Machines. [Citation Graph (0, 0)][DBLP] MCU, 2007, pp:303-315 [Conf]
- Turlough Neary, Damien Woods
Four Small Universal Turing Machines. [Citation Graph (0, 0)][DBLP] MCU, 2007, pp:242-254 [Conf]
- Damien Woods, Turlough Neary
On the time complexity of 2-tag systems and small universal Turing machines [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Turlough Neary, Damien Woods
Small weakly universal Turing machines [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
Small Weakly Universal Turing Machines. [Citation Graph (, )][DBLP]
On the Computational Complexity of Spiking Neural P Systems. [Citation Graph (, )][DBLP]
A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems. [Citation Graph (, )][DBLP]
A boundary between universality and non-universality in spiking neural P systems [Citation Graph (, )][DBLP]
On the computational complexity of spiking neural P systems [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs
|