Timothy H. McNicholl

43 papers B 1C 7Misc 1Journal 34

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Evaluative presentations. J. Log. Comput. Timothy H. McNicholl
2024	C	`conf`	Hyperarithmetic Numerals. CiE Caleb Camrud, Timothy H. McNicholl
2023	J	`jnl`	Effective notions of weak convergence of measures on the real line. Inf. Comput. Timothy H. McNicholl, Diego A. Rojas
2023	J	`jnl`	On the complexity of the theory of a computably presented metric structure. Arch. Math. Log. Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl
2021	J	`jnl`	Continuous logic and embeddings of Lebesgue spaces. Arch. Math. Log. Timothy H. McNicholl
2020	J	`jnl`	Analytic computable structure theory and L Arch. Math. Log. Tyler Brown, Timothy H. McNicholl
2020	J	`jnl`	Computing the exponent of a Lebesgue space. J. Log. Anal. Timothy H. McNicholl
2020	J	`jnl`	Degrees of and lowness for isometric isomorphism. J. Log. Anal. Johanna N. Y. Franklin, Timothy H. McNicholl
2020	J	`jnl`	On the Complexity of Classifying Lebesgue Spaces. J. Symb. Log. Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov
2019	J	`jnl`	Algorithmic Randomness and Fourier Analysis. Theory Comput. Syst. Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute
2019	J	`jnl`	The isometry degree of a computable copy of ℓ p. Comput. Timothy H. McNicholl, Donald M. Stull
2018	C	`conf`	The Isometry Degree of a Computable Copy of 𝓁 CiE Timothy H. McNicholl, Don M. Stull
2017	J	`jnl`	Computable copies of ℓp. Comput. Timothy H. McNicholl
2016	J	`jnl`	Asymptotic density and the coarse computability bound. Comput. Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
2015	C	`conf`	A Note on the Computable Categoricity of \ell ^p ℓ p Spaces. CiE Timothy H. McNicholl
2015	J	`jnl`	Asymptotic density and the Ershov hierarchy. Math. Log. Q. Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
2014	J	`jnl`	Computing boundary extensions of conformal maps. LMS J. Comput. Math. Timothy H. McNicholl
2013	J	`jnl`	Computing links and accessing arcs. Math. Log. Q. Timothy H. McNicholl
2012	J	`jnl`	An Effective Carathéodory Theorem. Theory Comput. Syst. Timothy H. McNicholl
2012	J	`jnl`	Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains. Theory Comput. Syst. Valentin V. Andreev, Timothy H. McNicholl
2012	J	`jnl`	Computing Space-Filling Curves. Theory Comput. Syst. P. J. Couch, Bobby Dale Daniel, Timothy H. McNicholl
2012	J	`jnl`	Effective Versions of Local Connectivity Properties. Theory Comput. Syst. Dale Daniel, Timothy H. McNicholl
2012	Misc	`conf`	Toward an Optimal Power-Aware Scheduling Technique. SYNASC Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu, Timothy H. McNicholl
2011	J	`jnl`	Computing links and accessing arcs CoRR Timothy H. McNicholl
2011	J	`jnl`	Effective local connectivity properties CoRR Dale Daniel, Timothy H. McNicholl
2010	J	`jnl`	Computing Interpolating Sequences. Theory Comput. Syst. Valentin V. Andreev, Timothy H. McNicholl
2009	C	`conf`	Computing Conformal Maps onto Canonical Slit Domains. CCA Valentin V. Andreev, Timothy H. McNicholl
2009	J	`jnl`	Reverse mathematics, computability, and partitions of trees. J. Symb. Log. Jennifer Chubb, Jeffry L. Hirst, Timothy H. McNicholl
2008	J	`jnl`	A uniformly computable Implicit Function Theorem. Math. Log. Q. Timothy H. McNicholl
2008	C	`conf`	Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains. CCA Valentin V. Andreev, Dale Daniel, Timothy H. McNicholl
2008	J	`jnl`	Uniformly computable aspects of inner functions: estimation and factorization. Math. Log. Q. Timothy H. McNicholl
2007	C	`conf`	Uniformly Computable Aspects of Inner Functions. CCA Timothy H. McNicholl
2007	J	`jnl`	Π J. Symb. Log. John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey
2006	C	`conf`	Computability and the Implicit Function Theorem. CCA Timothy H. McNicholl
2003	J	`jnl`	Effective embeddings into strong degree structures. Math. Log. Q. Timothy H. McNicholl
2001	J	`jnl`	A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth. SIGACT News Timothy H. McNicholl
2001	J	`jnl`	On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets. J. Symb. Log. Timothy H. McNicholl
2001	J	`jnl`	Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag. SIGACT News Timothy H. McNicholl
2000	J	`jnl`	Intrinsic Reducibilities. Math. Log. Q. Timothy H. McNicholl
2000	J	`jnl`	On The Commutativity of Jumps. J. Symb. Log. Timothy H. McNicholl
2000	J	`jnl`	The Comlexity of Odd J. Symb. Log. Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan
1999	J	`jnl`	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 Timothy H. McNicholl
1996	B	`conf`	On the Query Complexity of Sets. MFCS Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan