| The Ksmt Calculus Is A Delta-Complete Decision Procedure For Non-Linear Constraints | 0 | 0.34 | 2021 |
| Weak Reduction Principle and Computable Metric Spaces. | 0 | 0.34 | 2018 |
| Complexity for partial computable functions over computable Polish spaces. | 1 | 0.37 | 2018 |
| THE RICE-SHAPIRO THEOREM IN COMPUTABLE TOPOLOGY | 0 | 0.34 | 2017 |
| Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. | 0 | 0.34 | 2017 |
| Outline Of Partial Computability In Computable Topology | 1 | 0.37 | 2017 |
| Highlights Of The Rice-Shapiro Theorem In Computable Topology | 0 | 0.34 | 2017 |
| Computable elements and functions in effectively enumerable topological spaces. | 2 | 0.38 | 2017 |
| On Higher Effective Descriptive Set Theory | 2 | 0.43 | 2017 |
| Positive predicate structures for continuous data. | 4 | 0.47 | 2015 |
| Towards Using Exact Real Arithmetic For Initial Value Problems | 0 | 0.34 | 2015 |
| Rice's Theorem in Effectively Enumerable Topological Spaces. | 1 | 0.36 | 2015 |
| Index Sets As A Measure Of Continuous Constraint Complexity | 3 | 0.46 | 2014 |
| Computing combinatorial types of trajectories in Pfaffian Dynamics | 1 | 0.37 | 2010 |
| Making Big Steps In Trajectories | 4 | 0.61 | 2010 |
| The Uniformity Principle for Sigma-definability | 1 | 0.37 | 2009 |
| SigmaK-constraints for Hybrid Systems | 0 | 0.34 | 2009 |
| Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems | 0 | 0.34 | 2008 |
| On sigma-definability without equality over the real numbers | 0 | 0.34 | 2008 |
| Remarks on Sigma-definability without the equality test over the Reals | 0 | 0.34 | 2008 |
| Towards Computability over Effectively Enumerable Topological Spaces | 12 | 0.87 | 2008 |
| The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis | 0 | 0.34 | 2007 |
| Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems | 4 | 0.53 | 2006 |
| Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems | 11 | 0.82 | 2006 |
| Satisfiability of viability constraints for Pfaffian dynamics | 0 | 0.34 | 2006 |
| Towards computability of higher type continuous data | 9 | 1.10 | 2005 |
| Gandy's Theorem for Abstract Structures without the Equality Test | 6 | 0.61 | 2003 |
| Recent advances in Sigma-definability over continuous data types | 0 | 0.34 | 2003 |
| Fixed points on abstract structures without the equality test | 1 | 0.36 | 2002 |
| Semantic Characterisations of Second-Order Computability over the Real Numbers | 3 | 0.57 | 2001 |
| Generalised Computability and Applications to Hybrid Systems | 0 | 0.34 | 2001 |
| Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory | 3 | 0.48 | 2000 |
| A Logical Approach to Specification of Hybrid Systems | 3 | 0.44 | 1999 |
| Characteristic Properties of Majorant-Computability over the Reals | 12 | 0.90 | 1998 |
