| Publication | Date of Publication | Type |
|---|
| The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints | 2023-09-21 | Paper |
| The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints | 2021-12-01 | Paper |
| Highlights of the Rice-Shapiro Theorem in Computable Topology | 2021-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150980 | 2021-02-16 | Paper |
| On the computability of ordered fields | 2020-07-29 | Paper |
| A CDCL-style calculus for solving non-linear constraints | 2020-05-13 | Paper |
| Weak reduction principle and computable metric spaces | 2018-09-06 | Paper |
| The Rice-Shapiro theorem in Computable Topology | 2018-01-12 | Paper |
| Computable elements and functions in effectively enumerable topological spaces | 2017-11-22 | Paper |
| On images of partial computable functions over computable Polish spaces | 2017-09-11 | Paper |
| Spectrum of the field of computable real numbers | 2017-09-04 | Paper |
| Outline of partial computability in computable topology | 2017-08-04 | Paper |
| On higher effective descriptive set theory | 2017-08-04 | Paper |
| Towards Using Exact Real Arithmetic for Initial Value Problems | 2016-12-21 | Paper |
| Positive predicate structures for continuous data | 2016-07-27 | Paper |
| Using Taylor Models in Exact Real Arithmetic | 2016-05-25 | Paper |
| Reachability in One-Dimensional Controlled Polynomial Dynamical Systems | 2015-12-07 | Paper |
| Index Sets as a Measure of Continuous Constraint Complexity | 2015-12-03 | Paper |
| Rice’s Theorem in Effectively Enumerable Topological Spaces | 2015-10-20 | Paper |
| Towards Computability over Effectively Enumerable Topological Spaces | 2013-05-03 | Paper |
| Remarks on Σ–definability without the equality test over the Reals | 2013-05-03 | Paper |
| Fixed Points on the Real Numbers without the Equality Test | 2013-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2885260 | 2012-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3408145 | 2010-02-24 | Paper |
| Satisfiability of Viability Constraints for Pfaffian Dynamics | 2010-02-02 | Paper |
| Σ K –constraints for Hybrid Systems | 2010-02-02 | Paper |
| Perspectives of System Informatics | 2010-01-05 | Paper |
| Computing combinatorial types of trajectories in Pfaffian dynamics | 2009-12-18 | Paper |
| Bounds on sizes of finite bisimulations of Pfaffian dynamical systems | 2009-05-08 | Paper |
| The Uniformity Principle for -definability | 2009-03-02 | Paper |
| Σ-Definability of countable structures over real numbers, complex numbers, and quaternions | 2008-12-18 | Paper |
| Countable structures \(\Sigma \)-definable over classical continuous number systems | 2008-12-01 | Paper |
| On Σ‐definability without equality over the real numbers | 2008-10-08 | Paper |
| The Uniformity Principle for Σ-Definability with Applications to Computable Analysis | 2007-11-13 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475110 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783306 | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531987 | 2002-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511265 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946102 | 2000-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263799 | 2000-04-25 | Paper |
| A new approach to computability over the reals | 1999-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842548 | 1998-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842549 | 1998-11-05 | Paper |
| Generalized computability on real functions | 1992-09-27 | Paper |
