| Publication | Date of Publication | Type |
|---|
| Degrees of Second and Higher-Order Polynomials | 2023-05-05 | Paper |
| Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations | 2023-03-24 | Paper |
| Computing Haar Measures | 2023-02-07 | Paper |
| Exact real computation of solution operators for linear analytic systems of partial differential equations | 2022-03-24 | Paper |
| Bit-complexity of solving systems of linear evolutionary partial differential equations | 2022-03-21 | Paper |
| Average-case polynomial-time computability of hamiltonian dynamics | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992873 | 2021-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150977 | 2021-02-16 | Paper |
| Computability of the Solutions to Navier-Stokes Equations via Effective Approximation | 2020-07-20 | Paper |
| Quantitative Coding and Complexity Theory of Continuous Data | 2020-02-10 | Paper |
| Computational complexity of real powering and improved solving linear differential equations | 2019-10-22 | Paper |
| Definable relations in finite dimensional subspace lattices with involution. II. Quantifier-free and homogeneous descriptions | 2019-07-10 | Paper |
| Randomized Computation of Continuous Data: Is Brownian Motion Computable? | 2019-06-16 | Paper |
| Definable relations in finite-dimensional subspace lattices with involution | 2018-10-30 | Paper |
| Computational Complexity of Quantum Satisfiability | 2018-08-02 | Paper |
| Computing periods | 2018-06-15 | Paper |
| Complexity Theory of (Functions on) Compact Metric Spaces | 2018-04-23 | Paper |
| On the computational complexity of the Dirichlet Problem for Poisson's Equation | 2017-11-22 | Paper |
| On the consistency problem for modular lattices and related structures | 2017-01-25 | Paper |
| Mathematische Logik | 2016-11-17 | Paper |
| Towards Computational Complexity Theory on Advanced Function Spaces in Analysis | 2016-08-17 | Paper |
| On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1$$] | 2016-05-25 | Paper |
| Average-Case Bit-Complexity Theory of Real Functions | 2016-05-25 | Paper |
| On Computability of Navier-Stokes’ Equation | 2015-10-20 | Paper |
| Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy | 2015-08-24 | Paper |
| Relative computability and uniform continuity of relations | 2014-11-20 | Paper |
| From Calculus to Algorithms without Errors | 2014-09-08 | Paper |
| Computational Complexity of Smooth Differential Equations | 2014-03-24 | Paper |
| Real Benefit of Promises and Advice | 2013-08-05 | Paper |
| Revising Type-2 Computation and Degrees of Discontinuity | 2013-05-10 | Paper |
| Kolmogorov Complexity Theory over the Reals | 2013-05-03 | Paper |
| Singular Coverings and Non-Uniform Notions of Closed Set Computability | 2013-05-03 | Paper |
| Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime | 2012-11-21 | Paper |
| Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability | 2012-09-28 | Paper |
| Computational Complexity of Smooth Differential Equations | 2012-09-25 | Paper |
| Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra | 2012-06-01 | Paper |
| Real Analytic Machines and Degrees | 2012-04-02 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics | 2009-11-13 | Paper |
| Real computational universality: the word problem for a class of groups with infinite presentation | 2009-10-19 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| On the coverings of the \(d\)-cube for \(d\leq 6\) | 2009-03-04 | Paper |
| On Faster Integer Calculations Using Non-arithmetic Primitives | 2008-12-02 | Paper |
| Singular coverings and non‐uniform notions of closed set computability | 2008-10-08 | Paper |
| Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation | 2008-09-17 | Paper |
| An explicit solution to Post's problem over the reals | 2008-03-26 | Paper |
| (Short) Survey of Real Hypercomputation | 2007-11-13 | Paper |
| Real hypercomputation and continuity | 2007-09-06 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Geometric spanners with applications in wireless networks | 2007-02-19 | Paper |
| Effectively open real functions | 2007-02-08 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Computable Closed Euclidean Subsets with and without Computable Points | 2006-10-13 | Paper |
| Nonlinear reformulation of Heisenberg's dynamics | 2006-09-28 | Paper |
| Computational power of infinite quantum parallelism | 2006-08-14 | Paper |
| Stability versus speed in a computable algebraic model | 2006-03-20 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Computable operators on regular sets | 2005-02-16 | Paper |
| Computability in linear algebra | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472015 | 2004-08-03 | Paper |
| Computability on Regular Subsets of Euclidean Space | 2003-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331202 | 2002-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532000 | 2002-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753932 | 2001-11-11 | Paper |
