On the Query Complexity of Sets. - Richard Beigel; William I. Gasarch; Martin Kummer; Timothy H. McNicholl; Frank Stephan 001 (MFCS, 1996)

Book Review: Stable Marriage and its Relation to Other Combinatorial Problems: An Introduction to Algorithm Analysis by Donald E. Knuth (American Mathematical Society 1996). - Timothy H. McNicholl (SIGACT News, 1999)

The Comlexity of OddAn. - Richard Beigel; William I. Gasarch; Martin Kummer; Georgia Martin; Timothy H. McNicholl; Frank Stephan 001 (J. Symb. Log., 2000)

On The Commutativity of Jumps. - Timothy H. McNicholl (J. Symb. Log., 2000)

Intrinsic Reducibilities. - Timothy H. McNicholl (Math. Log. Q., 2000)

On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets. - Timothy H. McNicholl (J. Symb. Log., 2001)

A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth. - Timothy H. McNicholl (SIGACT News, 2001)

Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag. - Timothy H. McNicholl (SIGACT News, 2001)

Effective embeddings into strong degree structures. - Timothy H. McNicholl (Math. Log. Q., 2003)

Computability and the Implicit Function Theorem. - Timothy H. McNicholl (CCA, 2006)

Uniformly Computable Aspects of Inner Functions. - Timothy H. McNicholl (CCA, 2007)

Π10 classes and strong degree spectra of relations. - John Chisholm; Jennifer Chubb; Valentina S. Harizanov; Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Timothy H. McNicholl; Sarah Pingrey (J. Symb. Log., 2007)

Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains. - Valentin V. Andreev; Dale Daniel; Timothy H. McNicholl (CCA, 2008)

A uniformly computable Implicit Function Theorem. - Timothy H. McNicholl (Math. Log. Q., 2008)

Uniformly computable aspects of inner functions: estimation and factorization. - Timothy H. McNicholl (Math. Log. Q., 2008)

Computing Conformal Maps onto Canonical Slit Domains. - Valentin V. Andreev; Timothy H. McNicholl (CCA, 2009)

Reverse mathematics, computability, and partitions of trees. - Jennifer Chubb; Jeffry L. Hirst; Timothy H. McNicholl (J. Symb. Log., 2009)

Computing Interpolating Sequences. - Valentin V. Andreev; Timothy H. McNicholl (Theory Comput. Syst., 2010)

Effective local connectivity properties - Dale Daniel; Timothy H. McNicholl (CoRR, 2011)

Toward an Optimal Power-Aware Scheduling Technique. - Stefan Andrei; Albert M. K. Cheng; Vlad Radulescu; Timothy H. McNicholl (SYNASC, 2012)

Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains. - Valentin V. Andreev; Timothy H. McNicholl (Theory Comput. Syst., 2012)

Computing Space-Filling Curves. - P. J. Couch; Bobby Dale Daniel; Timothy H. McNicholl (Theory Comput. Syst., 2012)

Effective Versions of Local Connectivity Properties. - Dale Daniel; Timothy H. McNicholl (Theory Comput. Syst., 2012)

An Effective Carathéodory Theorem. - Timothy H. McNicholl (Theory Comput. Syst., 2012)

Computing links and accessing arcs. - Timothy H. McNicholl (Math. Log. Q., 2013)

Computing boundary extensions of conformal maps. - Timothy H. McNicholl (LMS J. Comput. Math., 2014)

A Note on the Computable Categoricity of ell ^p ℓ p Spaces. - Timothy H. McNicholl (CiE, 2015)

Asymptotic density and the Ershov hierarchy. - Rod Downey; Carl G. Jockusch Jr.; Timothy H. McNicholl; Paul E. Schupp (Math. Log. Q., 2015)

Asymptotic density and the coarse computability bound. - Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Timothy H. McNicholl; Paul E. Schupp (Comput., 2016)

Computable copies of ℓp. - Timothy H. McNicholl (Comput., 2017)

The Isometry Degree of a Computable Copy of 𝓁p. - Timothy H. McNicholl; Don M. Stull (CiE, 2018)

The isometry degree of a computable copy of ℓ p. - Timothy H. McNicholl; Donald M. Stull (Comput., 2019)

Algorithmic Randomness and Fourier Analysis. - Johanna N. Y. Franklin; Timothy H. McNicholl; Jason Rute (Theory Comput. Syst., 2019)

Analytic computable structure theory and Lp-spaces part 2. - Tyler Brown; Timothy H. McNicholl (Arch. Math. Log., 2020)

Degrees of and lowness for isometric isomorphism. - Johanna N. Y. Franklin; Timothy H. McNicholl (J. Log. Anal., 2020)

Computing the exponent of a Lebesgue space. - Timothy H. McNicholl (J. Log. Anal., 2020)

On the Complexity of Classifying Lebesgue Spaces. - Tyler Brown; Timothy H. McNicholl; Alexander G. Melnikov (J. Symb. Log., 2020)

Continuous logic and embeddings of Lebesgue spaces. - Timothy H. McNicholl (Arch. Math. Log., 2021)

Effective notions of weak convergence of measures on the real line. - Timothy H. McNicholl; Diego A. Rojas (Inf. Comput., 2023)

On the complexity of the theory of a computably presented metric structure. - Caleb Camrud; Isaac Goldbring; Timothy H. McNicholl (Arch. Math. Log., 2023)

Hyperarithmetic Numerals. - Caleb Camrud; Timothy H. McNicholl (CiE, 2024)

On the complexity of spectra of bounded analytic functions. - Timothy Hugh McNicholl; Brian Rudolph Zilli (J. Log. Anal., 2025)

Evaluative presentations. - Timothy H. McNicholl (J. Log. Comput., 2025)