Characteristic Properties of Majorant-Computability over the Reals. - Margarita V. Korovina; Oleg V. Kudinov (CSL, 1998)

A Logical Approach to Specification of Hybrid Systems. - Margarita V. Korovina; Oleg V. Kudinov (Ershov Memorial Conference, 1999)

Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. - Margarita V. Korovina; Oleg V. Kudinov (CCA, 2000)

Semantic Characterisations of Second-Order Computability over the Real Numbers. - Margarita V. Korovina; Oleg V. Kudinov (CSL, 2001)

Generalised Computability and Applications to Hybrid Systems. - Margarita V. Korovina; Oleg V. Kudinov (Ershov Memorial Conference, 2001)

Fixed points on abstract structures without the equality test. - Margarita V. Korovina (FICS, 2002)

Fixed Points on the Real Numbers without the Equality Test. - Margarita V. Korovina (CCA, 2002)

Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test. - Margarita V. Korovina (CSL, 2003)

Recent Advances in S-Definability over Continuous Data Types. - Margarita V. Korovina (Ershov Memorial Conference, 2003)

Gandy's Theorem for Abstract Structures without the Equality Test. - Margarita V. Korovina (LPAR, 2003)

Pfaffian Hybrid Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (CSL, 2004)

Towards Computability of Higher Type Continuous Data. - Margarita V. Korovina; Oleg V. Kudinov (CiE, 2005)

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (CiE, 2006)

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Reliable Implementation of Real Number Algorithms, 2006)

Satisfiability of Viability Constraints for Pfaffian Dynamics. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Ershov Memorial Conference, 2006)

The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis. - Margarita V. Korovina; Oleg V. Kudinov (CiE, 2007)

Remarks on Sigma-definability without the equality test over the Reals. - Andrei S. Morozov; Margarita V. Korovina (CCA, 2007)

Towards Computability over Effectively Enumerable Topological Spaces. - Margarita V. Korovina; Oleg V. Kudinov (CCA, 2008)

On sigma-definability without equality over the real numbers. - Andrei S. Morozov; Margarita V. Korovina (Math. Log. Q., 2008)

Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Theory Comput. Syst., 2008)

SigmaK-constraints for Hybrid Systems. - Margarita V. Korovina; Oleg V. Kudinov (Ershov Memorial Conference, 2009)

The Uniformity Principle for Sigma-definability. - Margarita V. Korovina; Oleg V. Kudinov (J. Log. Comput., 2009)

Making big steps in trajectories - Norbert Th. Müller; Margarita V. Korovina (CCA, 2010)

Computing combinatorial types of trajectories in Pfaffian Dynamics. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (J. Log. Algebraic Methods Program., 2010)

Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. - Margarita V. Korovina; Nicolai N. Vorobjov Jr. (Ershov Memorial Conference, 2011)

Index Sets as a Measure of Continuous Constraint Complexity. - Margarita V. Korovina; Oleg V. Kudinov (Ershov Memorial Conference, 2014)

Rice's Theorem in Effectively Enumerable Topological Spaces. - Margarita V. Korovina; Oleg V. Kudinov (CiE, 2015)

Towards Using Exact Real Arithmetic for Initial Value Problems. - Franz Brauße; Margarita V. Korovina; Norbert Th. Müller (Ershov Memorial Conference, 2015)

Using Taylor Models in Exact Real Arithmetic. - Franz Brauße; Margarita Vladimirovna Korovina; Norbert Th. Müller (MACIS, 2015)

Positive predicate structures for continuous data. - Margarita V. Korovina; Oleg V. Kudinov (Math. Struct. Comput. Sci., 2015)

Outline of Partial Computability in Computable Topology. - Margarita V. Korovina; Oleg V. Kudinov (CiE, 2017)

On Higher Effective Descriptive Set Theory. - Margarita V. Korovina; Oleg V. Kudinov (CiE, 2017)

Highlights of the Rice-Shapiro Theorem in Computable Topology. - Margarita V. Korovina; Oleg V. Kudinov (Ershov Informatics Conference, 2017)

The Rice-Shapiro theorem in Computable Topology. - Margarita V. Korovina; Oleg V. Kudinov (Log. Methods Comput. Sci., 2017)

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. - Hajime Ishihara; Margarita V. Korovina; Arno Pauly; Monika Seisenberger; Dieter Spreen (Math. Struct. Comput. Sci., 2017)

Computable elements and functions in effectively enumerable topological spaces. - Margarita V. Korovina; Oleg V. Kudinov (Math. Struct. Comput. Sci., 2017)

Weak Reduction Principle and Computable Metric Spaces. - Margarita V. Korovina; Oleg V. Kudinov (CiE, 2018)

Complexity for partial computable functions over computable Polish spaces. - Margarita V. Korovina; Oleg V. Kudinov (Math. Struct. Comput. Sci., 2018)

Computable Topology for Reliable Computations. - Margarita V. Korovina; Oleg V. Kudinov (Ershov Informatics Conference, 2019)

A CDCL-Style Calculus for Solving Non-linear Constraints. - Franz Brauße; Konstantin Korovin; Margarita V. Korovina; Norbert Th. Müller (FroCos, 2019)

On the computability of ordered fields. - Margarita V. Korovina; Oleg V. Kudinov (CoRR, 2020)

The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints. - Franz Brauße; Konstantin Korovin; Margarita V. Korovina; Norbert Th. Müller (CADE, 2021)

The ksmt calculus is a δ-complete decision procedure for non-linear constraints. - Franz Brauße; Konstantin Korovin; Margarita V. Korovina; Norbert Th. Müller (Theor. Comput. Sci., 2023)