| 2008 |
|---|
| 11 | EE | Timothy McNicholl:
Uniformly Computable Aspects of Inner Functions.
Electr. Notes Theor. Comput. Sci. 202: 27-36 (2008) |
| 10 | EE | Valentin V. Andreev,
Dale Daniel,
Timothy McNicholl:
Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains.
Electr. Notes Theor. Comput. Sci. 221: 127-139 (2008) |
| 9 | EE | Timothy McNicholl:
A uniformly computable Implicit Function Theorem.
Math. Log. Q. 54(3): 272-279 (2008) |
| 8 | EE | Timothy McNicholl:
Uniformly computable aspects of inner functions: estimation and factorization.
Math. Log. Q. 54(5): 508-518 (2008) |
| 2007 |
|---|
| 7 | EE | Timothy McNicholl:
Computability and the Implicit Function Theorem.
Electr. Notes Theor. Comput. Sci. 167: 3-15 (2007) |
| 2003 |
|---|
| 6 | EE | Timothy McNicholl:
Effective embeddings into strong degree structures.
Math. Log. Q. 49(3): 219-229 (2003) |
| 2001 |
|---|
| 5 | | Timothy McNicholl:
On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets.
J. Symb. Log. 66(4): 1543-1560 (2001) |
| 2000 |
|---|
| 4 | | Richard Beigel,
William I. Gasarch,
Martin Kummer,
Georgia Martin,
Timothy McNicholl,
Frank Stephan:
The Comlexity of OddAn.
J. Symb. Log. 65(1): 1-18 (2000) |
| 3 | | Timothy McNicholl:
On The Commutativity of Jumps.
J. Symb. Log. 65(4): 1725-1748 (2000) |
| 2 | EE | Timothy McNicholl:
Intrinsic Reducibilities.
Math. Log. Q. 46(3): 393-407 (2000) |
| 1996 |
|---|
| 1 | | Richard Beigel,
William I. Gasarch,
Martin Kummer,
Timothy McNicholl,
Frank Stephan:
On the Query Complexity of Sets.
MFCS 1996: 206-217 |
