| Publication | Date of Publication | Type |
|---|
| Feasible real random access machines | 2024-06-21 | Paper |
| On the complexity of learning programs | 2024-01-12 | Paper |
| THE DISCONTINUITY PROBLEM | 2023-09-11 | Paper |
| Weihrauch Complexity and the Hagen School of Computable Analysis | 2022-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028441 | 2022-02-09 | Paper |
| Weihrauch Complexity in Computable Analysis | 2022-01-26 | Paper |
| WEIHRAUCH GOES BROUWERIAN | 2021-04-15 | Paper |
| Stashing And Parallelization Pentagons | 2021-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150974 | 2021-02-16 | Paper |
| Completion of choice | 2021-01-25 | Paper |
| Connected choice and the Brouwer fixed point theorem | 2019-07-08 | Paper |
| On the uniform computational content of the Baire category theorem | 2018-12-21 | Paper |
| On the algebraic structure of Weihrauch degrees | 2018-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4585068 | 2018-09-06 | Paper |
| Monte Carlo Computability | 2018-04-19 | Paper |
| A Galois connection between Turing jumps and limits | 2018-02-05 | Paper |
| On the uniform computational content of computability theory | 2018-02-01 | Paper |
| ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM | 2018-01-11 | Paper |
| Addendum to: ``The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma | 2017-05-18 | Paper |
| The Vitali Covering Theorem in the Weihrauch Lattice | 2017-04-04 | Paper |
| Las Vegas Computability and Algorithmic Randomness | 2017-01-24 | Paper |
| The Brouwer Fixed Point Theorem Revisited | 2016-08-17 | Paper |
| Computability and Analysis, a Historical Approach | 2016-08-17 | Paper |
| Randomness and differentiability | 2015-11-03 | Paper |
| Probabilistic computability and choice | 2015-06-01 | Paper |
| On Computable Compact Operators on Banach Spaces | 2013-05-10 | Paper |
| Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces | 2013-05-03 | Paper |
| Computing Uniform Bounds | 2013-04-19 | Paper |
| Weihrauch degrees, omniscience principles and weak computability | 2012-09-28 | Paper |
| Effective choice and boundedness principles in computable analysis | 2012-09-28 | Paper |
| On the Computational Content of the Brouwer Fixed Point Theorem | 2012-08-14 | Paper |
| Computability and analysis: the legacy of Alan Turing | 2012-06-15 | Paper |
| Closed choice and a uniform low basis theorem | 2012-06-01 | Paper |
| The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma | 2012-03-29 | Paper |
| Computability of finite-dimensional linear subspaces and best approximation | 2011-09-12 | Paper |
| Effective Choice and Boundedness Principles in Computable Analysis | 2011-03-21 | Paper |
| Weihrauch degrees, omniscience principles and weak computability | 2011-03-18 | Paper |
| A computable version of Banach's inverse mapping theorem | 2009-03-25 | Paper |
| Plottable Real Number Functions and the Computable Graph Theorem | 2009-03-16 | Paper |
| Borel Complexity of Topological Operations on Computable Metric Spaces | 2009-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3508019 | 2008-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505880 | 2008-06-11 | Paper |
| Borel complexity and computability of the Hahn-Banach theorem | 2008-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384984 | 2008-04-29 | Paper |
| Borel Complexity of Topological Operations on Computable Metric Spaces | 2007-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422248 | 2007-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310876 | 2007-10-15 | Paper |
| Computability of compact operators on computable Banach spaces with bases | 2007-09-17 | Paper |
| Towards computability of elliptic boundary value problems in variational formulation | 2007-02-08 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494231 | 2006-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5718580 | 2006-01-16 | Paper |
| Effective Borel measurability and reducibility of functions | 2005-02-16 | Paper |
| Computability in linear algebra | 2005-01-11 | Paper |
| Effective representations of the space of linear bounded operators | 2004-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737222 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472015 | 2004-08-03 | Paper |
| Computability on subsets of metric spaces. | 2004-03-14 | Paper |
| Recursive quasi-metric spaces. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418667 | 2003-08-11 | Paper |
| Generated quasi-metric hyper and function spaces. | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779146 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4546073 | 2002-08-18 | Paper |
| Topological properties of real number representations. | 2002-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532000 | 2002-05-27 | Paper |
| Realistic models of computability on the real numbers | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503952 | 2000-09-14 | Paper |
| Approaches to Effective Semi‐Continuity of Real Functions | 2000-08-23 | Paper |
| Computability on subsets of Euclidean space. I: Closed and compact subsets | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249367 | 1999-06-17 | Paper |
| Feasible real random access machines | 1999-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218420 | 1999-03-30 | Paper |
| Computable invariance | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364584 | 1997-11-17 | Paper |
| Order-free Recursion on the Real Numbers | 1997-05-14 | Paper |
| Recursive characterization of computable real-valued functions and relations | 1997-02-27 | Paper |
