| Publication | Date of Publication | Type |
|---|
Semantics, specification logic, and Hoare logic of exact real computation
Logical Methods in Computer Science | 2024-06-27 | Paper |
| Degrees of Second and Higher-Order Polynomials | 2023-05-05 | Paper |
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
Journal of Complexity | 2023-03-24 | Paper |
Computing Haar Measures
(available as arXiv preprint) | 2023-02-07 | Paper |
| Computer Science for Continuous Data | 2022-12-21 | 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 |
| Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines | 2021-06-10 | Paper |
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
(available as arXiv preprint) | 2021-06-10 | Paper |
| Real analytic machines and degrees | 2021-02-16 | Paper |
Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
Complexity and 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
Algebra Universalis | 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
Algebra Universalis | 2018-10-30 | Paper |
Computational Complexity of Quantum Satisfiability
Journal of the ACM | 2018-08-02 | Paper |
| Computing periods | 2018-06-15 | Paper |
Complexity theory of (functions on) compact metric spaces
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On the computational complexity of the Dirichlet problem for Poisson's equation
Mathematical Structures in Computer Science | 2017-11-22 | Paper |
On the consistency problem for modular lattices and related structures
International Journal of Algebra and Computation | 2017-01-25 | Paper |
Mathematical logic
Mathematik Kompakt | 2016-11-17 | Paper |
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
Pursuit of the Universal | 2016-08-17 | Paper |
On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1$$]
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
Average-case bit-complexity theory of real functions
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
On computability of Navier-Stokes' equation
Evolving Computability | 2015-10-20 | Paper |
Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
Journal of Complexity | 2015-08-24 | Paper |
Relative computability and uniform continuity of relations
Journal of Logic and Analysis | 2014-11-20 | Paper |
From Calculus to Algorithms without Errors
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Computational complexity of smooth differential equations
Logical Methods in Computer Science | 2014-03-24 | Paper |
Real benefit of promises and advice
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Revising type-2 computation and degrees of discontinuity
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Singular coverings and non-uniform notions of closed set computability
Electronic Notes in Theoretical Computer Science | 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
(available as arXiv preprint) | 2012-09-28 | Paper |
Computational complexity of smooth differential equations
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
Annals of Pure and Applied Logic | 2012-06-01 | Paper |
Real analytic machines and degrees: a topological view on algebraic limiting computation
Logical Methods in Computer Science | 2012-04-02 | Paper |
Fast relative approximation of potential fields.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
Applied Mathematics and Computation | 2009-11-13 | Paper |
Real computational universality: the word problem for a class of groups with infinite presentation
Foundations of Computational Mathematics | 2009-10-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
On the coverings of the \(d\)-cube for \(d\leq 6\)
Discrete Applied Mathematics | 2009-03-04 | Paper |
On Faster Integer Calculations Using Non-arithmetic Primitives
Unconventional Computing | 2008-12-02 | Paper |
Singular coverings and non‐uniform notions of closed set computability
Mathematical Logic Quarterly | 2008-10-08 | Paper |
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
An explicit solution to Post's problem over the reals
Journal of Complexity | 2008-03-26 | Paper |
(Short) Survey of Real Hypercomputation
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Real hypercomputation and continuity
Theory of Computing Systems | 2007-09-06 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Geometric spanners with applications in wireless networks
Computational Geometry | 2007-02-19 | Paper |
Effectively open real functions
Journal of Complexity | 2007-02-08 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Computable Closed Euclidean Subsets with and without Computable Points
(available as arXiv preprint) | 2006-10-13 | Paper |
Nonlinear reformulation of Heisenberg's dynamics
International Journal of Theoretical Physics | 2006-09-28 | Paper |
Computational power of infinite quantum parallelism
International Journal of Theoretical Physics | 2006-08-14 | Paper |
Stability versus speed in a computable algebraic model
Theoretical Computer Science | 2006-03-20 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Computable operators on regular sets
Mathematical Logic Quarterly | 2005-02-16 | Paper |
Computability in linear algebra
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2079882 (Why is no real title available?) | 2004-08-03 | Paper |
| Computability on Regular Subsets of Euclidean Space | 2003-10-06 | Paper |
| scientific article; zbMATH DE number 1741018 (Why is no real title available?) | 2002-06-10 | Paper |
| scientific article; zbMATH DE number 1746051 (Why is no real title available?) | 2002-05-27 | Paper |
| scientific article; zbMATH DE number 1670655 (Why is no real title available?) | 2001-11-11 | Paper |
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation
(available as arXiv preprint) | N/A | Paper |
