Search the dblp DataBase
Timothy McNicholl :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Richard Beigel , William I. Gasarch , Martin Kummer , Timothy McNicholl , Frank Stephan On the Query Complexity of Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1996, pp:206-217 [Conf ] Timothy McNicholl Computability and the Implicit Function Theorem. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:3-15 [Journal ] Richard Beigel , William I. Gasarch , Martin Kummer , Georgia Martin , Timothy McNicholl , Frank Stephan The Comlexity of Odd^{A} _{n} . [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2000, v:65, n:1, pp:1-18 [Journal ] Timothy McNicholl On The Commutativity of Jumps. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2000, v:65, n:4, pp:1725-1748 [Journal ] Timothy McNicholl On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2001, v:66, n:4, pp:1543-1560 [Journal ] Timothy McNicholl Intrinsic Reducibilities. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 2000, v:46, n:3, pp:393-407 [Journal ] Timothy McNicholl Effective embeddings into strong degree structures. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 2003, v:49, n:3, pp:219-229 [Journal ] Uniformly Computable Aspects of Inner Functions. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs