| Publication | Date of Publication | Type |
|---|
| Effective notions of weak convergence of measures on the real line | 2023-01-12 | Paper |
| Hyperarithmetic numerals | 2022-11-02 | Paper |
| Computable Complex Analysis | 2022-01-26 | Paper |
| Effective notions of weak convergence of measures on the real line | 2021-05-31 | Paper |
| ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES | 2021-03-19 | Paper |
| Degrees of and lowness for isometric isomorphism | 2021-01-22 | Paper |
| Computing the exponent of a Lebesgue space | 2021-01-22 | Paper |
| Continuous logic and embeddings of Lebesgue spaces | 2021-01-19 | Paper |
| Analytic computable structure theory and \(L^p\)-spaces. II | 2020-04-01 | Paper |
| The isometry degree of a computable copy of ℓ p 1 | 2020-01-17 | Paper |
| Algorithmic randomness and Fourier analysis | 2019-06-27 | Paper |
| Analytic computable structure theory and $L^p$ spaces | 2019-02-01 | Paper |
| The isometry degree of a computable copy of \(\ell^p\) | 2018-09-06 | Paper |
| Computable copies of ℓ p 1 | 2018-01-18 | Paper |
| Analytic computable structure theory and $L^p$-spaces part 2 | 2017-12-31 | Paper |
| Computing boundary extensions of conformal maps | 2016-10-13 | Paper |
| Asymptotic density and the coarse computability bound | 2016-04-13 | Paper |
| Carathéodory’s Theorem and moduli of local connectivity | 2016-01-25 | Paper |
| A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces | 2015-10-20 | Paper |
| Asymptotic density and the Ershov hierarchy | 2015-06-22 | Paper |
| Asymptotic density and the coarse computability bound | 2015-05-07 | Paper |
| On the Computable Theory of Bounded Analytic Functions | 2013-12-13 | Paper |
| An operator-theoretic existence proof of solutions to planar Dirichlet problems | 2013-10-10 | Paper |
| Computing conformal maps onto circular domains | 2013-07-24 | Paper |
| Computability and the Implicit Function Theorem | 2013-05-10 | Paper |
| Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains | 2013-05-03 | Paper |
| Uniformly Computable Aspects of Inner Functions | 2013-05-03 | Paper |
| Computing links and accessing arcs | 2013-04-09 | Paper |
| Computing boundary extensions of conformal maps part 2 | 2013-04-06 | Paper |
| A potential-theoretic construction of the Schwarz–Christoffel map for finitely connected domains | 2013-03-06 | Paper |
| The power of backtracking and the confinement of length | 2013-03-04 | Paper |
| Effective versions of local connectivity properties | 2012-12-06 | Paper |
| An effective Carathéodory theorem | 2012-12-06 | Paper |
| Computing conformal maps of finitely connected domains onto canonical slit domains | 2012-12-06 | Paper |
| Computing space-filling curves | 2012-12-06 | Paper |
| Computing Conformal Maps onto Canonical Slit Domains | 2012-09-28 | Paper |
| Estimating the error in the Koebe construction | 2012-03-22 | Paper |
| Computing interpolating sequences | 2010-05-10 | Paper |
| Reverse mathematics, computability, and partitions of trees | 2009-03-25 | Paper |
| Uniformly computable aspects of inner functions: estimation and factorization | 2008-10-08 | Paper |
| A uniformly computable Implicit Function Theorem | 2008-06-12 | Paper |
| Computable analysis and Blaschke products | 2007-11-30 | Paper |
| Π10 classes and strong degree spectra of relations | 2007-10-17 | Paper |
| Effective embeddings into strong degree structures | 2003-05-22 | Paper |
| On the convergence of query-bounded computations and logical closure properties of c.e. sets | 2003-01-07 | Paper |
| Intrinsic Reducibilities | 2001-11-23 | Paper |
| On the commutativity of jumps | 2001-04-24 | Paper |
| The complexity of ODDnA | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375806 | 1998-05-10 | Paper |
| Computable Gelfand Duality | N/A | Paper |
| Evaluative presentations | N/A | Paper |
