default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy H. McNicholl
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j32]Timothy Hugh McNicholl, Brian Rudolph Zilli:
On the complexity of spectra of bounded analytic functions. J. Log. Anal. 17 (2025)- 2024
- [c9]Caleb Camrud, Timothy H. McNicholl:
Hyperarithmetic Numerals. CiE 2024: 277-284 - 2023
- [j31]Caleb Camrud
, Isaac Goldbring, Timothy H. McNicholl:
On the complexity of the theory of a computably presented metric structure. Arch. Math. Log. 62(7-8): 1111-1129 (2023) - [j30]Timothy H. McNicholl, Diego A. Rojas:
Effective notions of weak convergence of measures on the real line. Inf. Comput. 290: 104997 (2023) - 2021
- [j29]Timothy H. McNicholl:
Continuous logic and embeddings of Lebesgue spaces. Arch. Math. Log. 60(1-2): 105-119 (2021) - 2020
- [j28]Tyler Brown, Timothy H. McNicholl:
Analytic computable structure theory and Lp-spaces part 2. Arch. Math. Log. 59(3-4): 427-443 (2020) - [j27]Johanna N. Y. Franklin, Timothy H. McNicholl:
Degrees of and lowness for isometric isomorphism. J. Log. Anal. 12 (2020) - [j26]Timothy H. McNicholl:
Computing the exponent of a Lebesgue space. J. Log. Anal. 12 (2020) - [j25]Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov:
On the Complexity of Classifying Lebesgue Spaces. J. Symb. Log. 85(3): 1254-1288 (2020)
2010 – 2019
- 2019
- [j24]Timothy H. McNicholl, Donald M. Stull:
The isometry degree of a computable copy of ℓ p. Comput. 8(2): 179-189 (2019) - [j23]Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute:
Algorithmic Randomness and Fourier Analysis. Theory Comput. Syst. 63(3): 567-586 (2019) - 2018
- [c8]Timothy H. McNicholl, Don M. Stull:
The Isometry Degree of a Computable Copy of 𝓁p. CiE 2018: 277-286 - 2017
- [j22]Timothy H. McNicholl:
Computable copies of ℓp. Comput. 6(4): 391-408 (2017) - 2016
- [j21]Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:
Asymptotic density and the coarse computability bound. Comput. 5(1): 13-27 (2016) - 2015
- [j20]Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:
Asymptotic density and the Ershov hierarchy. Math. Log. Q. 61(3): 189-195 (2015) - [c7]Timothy H. McNicholl:
A Note on the Computable Categoricity of \ell ^p ℓ p Spaces. CiE 2015: 268-275 - 2014
- [j19]Timothy H. McNicholl:
Computing boundary extensions of conformal maps. LMS J. Comput. Math. 17(1): 360-378 (2014) - 2013
- [j18]Timothy H. McNicholl:
Computing links and accessing arcs. Math. Log. Q. 59(1-2): 101-107 (2013) - 2012
- [j17]Valentin V. Andreev, Timothy H. McNicholl:
Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains. Theory Comput. Syst. 50(2): 354-369 (2012) - [j16]P. J. Couch, Bobby Dale Daniel, Timothy H. McNicholl:
Computing Space-Filling Curves. Theory Comput. Syst. 50(2): 370-386 (2012) - [j15]Timothy H. McNicholl:
An Effective Carathéodory Theorem. Theory Comput. Syst. 50(4): 579-588 (2012) - [j14]Dale Daniel, Timothy H. McNicholl:
Effective Versions of Local Connectivity Properties. Theory Comput. Syst. 50(4): 621-640 (2012) - [c6]Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu, Timothy H. McNicholl:
Toward an Optimal Power-Aware Scheduling Technique. SYNASC 2012: 135-142 - 2011
- [i2]Dale Daniel, Timothy H. McNicholl:
Effective local connectivity properties. CoRR abs/1106.3318 (2011) - [i1]Timothy H. McNicholl:
Computing links and accessing arcs. CoRR abs/1110.5657 (2011) - 2010
- [j13]Valentin V. Andreev, Timothy H. McNicholl:
Computing Interpolating Sequences. Theory Comput. Syst. 46(2): 340-350 (2010)
2000 – 2009
- 2009
- [j12]Jennifer Chubb, Jeffry L. Hirst, Timothy H. McNicholl:
Reverse mathematics, computability, and partitions of trees. J. Symb. Log. 74(1): 201-215 (2009) - [c5]Valentin V. Andreev, Timothy H. McNicholl:
Computing Conformal Maps onto Canonical Slit Domains. CCA 2009 - 2008
- [j11]Timothy H. McNicholl:
A uniformly computable Implicit Function Theorem. Math. Log. Q. 54(3): 272-279 (2008) - [j10]Timothy H. McNicholl:
Uniformly computable aspects of inner functions: estimation and factorization. Math. Log. Q. 54(5): 508-518 (2008) - [c4]Valentin V. Andreev, Dale Daniel, Timothy H. McNicholl:
Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains. CCA 2008: 127-139 - 2007
- [j9]John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey:
Π10 classes and strong degree spectra of relations. J. Symb. Log. 72(3): 1003-1018 (2007) - [c3]Timothy H. McNicholl:
Uniformly Computable Aspects of Inner Functions. CCA 2007: 27-36 - 2006
- [c2]Timothy H. McNicholl:
Computability and the Implicit Function Theorem. CCA 2006: 3-15 - 2003
- [j8]Timothy H. McNicholl:
Effective embeddings into strong degree structures. Math. Log. Q. 49(3): 219-229 (2003) - 2001
- [j7]Timothy H. McNicholl:
On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets. J. Symb. Log. 66(4): 1543-1560 (2001) - [j6]Timothy H. McNicholl:
A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth. SIGACT News 32(1): 5-8 (2001) - [j5]Timothy H. McNicholl:
Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag. SIGACT News 32(2): 14-15 (2001) - 2000
- [j4]Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan:
The Comlexity of OddAn. J. Symb. Log. 65(1): 1-18 (2000) - [j3]Timothy H. McNicholl:
On The Commutativity of Jumps. J. Symb. Log. 65(4): 1725-1748 (2000) - [j2]Timothy H. McNicholl:
Intrinsic Reducibilities. Math. Log. Q. 46(3): 393-407 (2000)
1990 – 1999
- 1999
- [j1]Timothy H. McNicholl:
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 30(1): 2-4 (1999) - 1996
- [c1]Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan:
On the Query Complexity of Sets. MFCS 1996: 206-217
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-05 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
