Timothy H. McNicholl

Orcid: 0000-0001-8334-4367

According to our database1, Timothy H. McNicholl authored at least 41 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hyperarithmetic Numerals.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
On the complexity of the theory of a computably presented metric structure.
Arch. Math. Log., November, 2023

Effective notions of weak convergence of measures on the real line.
Inf. Comput., January, 2023

2021
Continuous logic and embeddings of Lebesgue spaces.
Arch. Math. Log., 2021

2020
On the Complexity of Classifying Lebesgue Spaces.
J. Symb. Log., 2020

Computing the exponent of a Lebesgue space.
J. Log. Anal., 2020

Degrees of and lowness for isometric isomorphism.
J. Log. Anal., 2020

Analytic computable structure theory and L<sup>p</sup>-spaces part 2.
Arch. Math. Log., 2020

2019
Algorithmic Randomness and Fourier Analysis.
Theory Comput. Syst., 2019

The isometry degree of a computable copy of ℓ p.
Comput., 2019

2018
The Isometry Degree of a Computable Copy of 𝓁<sup>p</sup>.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
Computable copies of ℓp.
Comput., 2017

2016
Asymptotic density and the coarse computability bound.
Comput., 2016

2015
Asymptotic density and the Ershov hierarchy.
Math. Log. Q., 2015

A Note on the Computable Categoricity of \ell ^p ℓ p Spaces.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Computing boundary extensions of conformal maps.
LMS J. Comput. Math., 2014

2013
Computing links and accessing arcs.
Math. Log. Q., 2013

2012
An Effective Carathéodory Theorem.
Theory Comput. Syst., 2012

Effective Versions of Local Connectivity Properties.
Theory Comput. Syst., 2012

Computing Space-Filling Curves.
Theory Comput. Syst., 2012

Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains.
Theory Comput. Syst., 2012

Toward an Optimal Power-Aware Scheduling Technique.
Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

2011
Effective local connectivity properties
CoRR, 2011

2010
Computing Interpolating Sequences.
Theory Comput. Syst., 2010

2009
Reverse mathematics, computability, and partitions of trees.
J. Symb. Log., 2009

Computing Conformal Maps onto Canonical Slit Domains.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Uniformly computable aspects of inner functions: estimation and factorization.
Math. Log. Q., 2008

A uniformly computable Implicit Function Theorem.
Math. Log. Q., 2008

Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007
Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations.
J. Symb. Log., 2007

Uniformly Computable Aspects of Inner Functions.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

2006
Computability and the Implicit Function Theorem.
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

2003
Effective embeddings into strong degree structures.
Math. Log. Q., 2003

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

A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth.
SIGACT News, 2001

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

2000
Intrinsic Reducibilities.
Math. Log. Q., 2000

On The Commutativity of Jumps.
J. Symb. Log., 2000

The Comlexity of Odd<sup>A</sup><sub>n</sub>.
J. Symb. Log., 2000

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

1996
On the Query Complexity of Sets.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996


  Loading...