Margarita V. Korovina

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 19

Top Topics

Linear Constraints

Topology Preservation

Top Venues

Math. Struct. Comput. Sci.

Ershov Memorial Conference

Publications

Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller
-complete decision procedure for non-linear constraints. Theor. Comput. Sci. 975 (2023)
Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller
The ksmt calculus is a δ-complete decision procedure for non-linear constraints. CoRR (2021)
Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller
The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints. CADE (2021)
Margarita V. Korovina, Oleg V. Kudinov
On the computability of ordered fields. CoRR (2020)
Margarita V. Korovina, Oleg V. Kudinov
Computable Topology for Reliable Computations. Ershov Informatics Conference (2019)
Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller
A CDCL-style calculus for solving non-linear constraints. CoRR (2019)
Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller
A CDCL-Style Calculus for Solving Non-linear Constraints. FroCos (2019)
Margarita V. Korovina, Oleg V. Kudinov
Weak Reduction Principle and Computable Metric Spaces. CiE (2018)
Margarita V. Korovina, Oleg V. Kudinov
Complexity for partial computable functions over computable Polish spaces. Math. Struct. Comput. Sci. 28 (3) (2018)
Margarita V. Korovina, Oleg V. Kudinov
Outline of Partial Computability in Computable Topology. CiE (2017)
Margarita V. Korovina, Oleg V. Kudinov
On Higher Effective Descriptive Set Theory. CiE (2017)
Margarita V. Korovina, Oleg V. Kudinov
Highlights of the Rice-Shapiro Theorem in Computable Topology. Ershov Informatics Conference (2017)
Margarita V. Korovina, Oleg V. Kudinov
Rice-Shapiro theorem in Computable Topology. CoRR (2017)
Hajime Ishihara, Margarita V. Korovina, Arno Pauly, Monika Seisenberger, Dieter Spreen
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. Math. Struct. Comput. Sci. 27 (8) (2017)
Margarita V. Korovina, Oleg V. Kudinov
The Rice-Shapiro theorem in Computable Topology. Log. Methods Comput. Sci. 13 (4) (2017)
Margarita V. Korovina, Oleg V. Kudinov
Computable elements and functions in effectively enumerable topological spaces. Math. Struct. Comput. Sci. 27 (8) (2017)
Franz Brauße, Margarita V. Korovina, Norbert Th. Müller
Towards Using Exact Real Arithmetic for Initial Value Problems. Ershov Memorial Conference (2015)
Margarita V. Korovina, Oleg V. Kudinov
Rice's Theorem in Effectively Enumerable Topological Spaces. CiE (2015)
Margarita V. Korovina, Oleg V. Kudinov
Positive predicate structures for continuous data. Math. Struct. Comput. Sci. 25 (8) (2015)
Margarita V. Korovina, Oleg V. Kudinov
Index Sets as a Measure of Continuous Constraint Complexity. Ershov Memorial Conference (2014)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. Ershov Memorial Conference (2011)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Computing combinatorial types of trajectories in Pfaffian Dynamics. J. Log. Algebraic Methods Program. 79 (1) (2010)
Norbert Th. Müller, Margarita V. Korovina
Making big steps in trajectories CCA (2010)
Margarita V. Korovina, Oleg V. Kudinov
-constraints for Hybrid Systems. Ershov Memorial Conference (2009)
Margarita V. Korovina, Oleg V. Kudinov
The Uniformity Principle for Sigma-definability. J. Log. Comput. 19 (1) (2009)
Andrei S. Morozov, Margarita V. Korovina
Remarks on Sigma-definability without the equality test over the Reals. Electron. Notes Theor. Comput. Sci. 202 (2008)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Theory Comput. Syst. 43 (3-4) (2008)
Andrei S. Morozov, Margarita V. Korovina
On sigma-definability without equality over the real numbers. Math. Log. Q. 54 (5) (2008)
Margarita V. Korovina, Oleg V. Kudinov
Towards Computability over Effectively Enumerable Topological Spaces. Electron. Notes Theor. Comput. Sci. 221 (2008)
Margarita V. Korovina, Oleg V. Kudinov
-Definability with Applications to Computable Analysis. CiE (2007)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Satisfiability of Viability Constraints for Pfaffian Dynamics. Ershov Memorial Conference (2006)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Reliable Implementation of Real Number Algorithms (2006)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. CiE (2006)
Margarita V. Korovina, Oleg V. Kudinov
Towards Computability of Higher Type Continuous Data. CiE (2005)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Pfaffian Hybrid Systems. CSL (2004)
Margarita V. Korovina
Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test. CSL (2003)
Margarita V. Korovina
Gandy's Theorem for Abstract Structures without the Equality Test. LPAR (2003)
Margarita V. Korovina
Recent Advances in S-Definability over Continuous Data Types. Ershov Memorial Conference (2003)
Margarita V. Korovina
Fixed points on abstract structures without the equality test. FICS (2002)
Margarita V. Korovina
Fixed Points on the Real Numbers without the Equality Test. Electron. Notes Theor. Comput. Sci. 66 (1) (2002)
Margarita V. Korovina, Oleg V. Kudinov
Generalised Computability and Applications to Hybrid Systems. Ershov Memorial Conference (2001)
Margarita V. Korovina, Oleg V. Kudinov
Semantic Characterisations of Second-Order Computability over the Real Numbers. CSL (2001)
Margarita V. Korovina, Oleg V. Kudinov
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. CCA (2000)
Margarita V. Korovina, Oleg V. Kudinov
A Logical Approach to Specification of Hybrid Systems. Ershov Memorial Conference (1999)
Margarita V. Korovina, Oleg V. Kudinov
Characteristic Properties of Majorant-Computability over the Reals. CSL (1998)