default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMargarita V. Korovina
Person information
- affiliation: A.P. Ershov Institute of Informatics Systems of the Siberian Branch of the RAS, Novosibirsk
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Franz Brauße
, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
The ksmt calculus is a δ-complete decision procedure for non-linear constraints. Theor. Comput. Sci. 975: 114125 (2023)- 2021
- [c31]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: 113-130 - [i5]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 abs/2104.13269 (2021) - 2020
- [i4]Margarita V. Korovina, Oleg V. Kudinov:
On the computability of ordered fields. CoRR abs/2007.14801 (2020)
2010 – 2019
- 2019
- [c30]Margarita V. Korovina, Oleg V. Kudinov:
Computable Topology for Reliable Computations. Ershov Informatics Conference 2019: 185-198 - [c29]Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
A CDCL-Style Calculus for Solving Non-linear Constraints. FroCos 2019: 131-148 - [i3]Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
A CDCL-style calculus for solving non-linear constraints. CoRR abs/1905.09227 (2019) - 2018
- [j9]Margarita V. Korovina, Oleg V. Kudinov:
Complexity for partial computable functions over computable Polish spaces. Math. Struct. Comput. Sci. 28(3): 429-447 (2018) - [c28]Margarita V. Korovina, Oleg V. Kudinov:
Weak Reduction Principle and Computable Metric Spaces. CiE 2018: 234-243 - 2017
- [j8]Margarita V. Korovina, Oleg V. Kudinov:
The Rice-Shapiro theorem in Computable Topology. Log. Methods Comput. Sci. 13(4) (2017) - [j7]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): 1285-1286 (2017) - [j6]Margarita V. Korovina, Oleg V. Kudinov:
Computable elements and functions in effectively enumerable topological spaces. Math. Struct. Comput. Sci. 27(8): 1466-1494 (2017) - [c27]Margarita V. Korovina, Oleg V. Kudinov:
Outline of Partial Computability in Computable Topology. CiE 2017: 64-76 - [c26]Margarita V. Korovina, Oleg V. Kudinov:
On Higher Effective Descriptive Set Theory. CiE 2017: 282-291 - [c25]Margarita V. Korovina, Oleg V. Kudinov:
Highlights of the Rice-Shapiro Theorem in Computable Topology. Ershov Informatics Conference 2017: 241-255 - [i2]Margarita V. Korovina, Oleg V. Kudinov:
Rice-Shapiro theorem in Computable Topology. CoRR abs/1708.09820 (2017) - 2015
- [j5]Margarita V. Korovina, Oleg V. Kudinov:
Positive predicate structures for continuous data. Math. Struct. Comput. Sci. 25(8): 1669-1684 (2015) - [c24]Margarita V. Korovina, Oleg V. Kudinov:
Rice's Theorem in Effectively Enumerable Topological Spaces. CiE 2015: 226-235 - [c23]Franz Brauße, Margarita V. Korovina, Norbert Th. Müller:
Towards Using Exact Real Arithmetic for Initial Value Problems. Ershov Memorial Conference 2015: 61-74 - [c22]Franz Brauße, Margarita Vladimirovna Korovina, Norbert Th. Müller:
Using Taylor Models in Exact Real Arithmetic. MACIS 2015: 474-488 - 2014
- [c21]Margarita V. Korovina, Oleg V. Kudinov:
Index Sets as a Measure of Continuous Constraint Complexity. Ershov Memorial Conference 2014: 201-215 - [e1]Andrei Voronkov, Margarita V. Korovina:
HOWARD-60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday. EPiC Series in Computing 42, EasyChair 2014 [contents] - 2011
- [c20]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. Ershov Memorial Conference 2011: 251-261 - 2010
- [j4]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Computing combinatorial types of trajectories in Pfaffian Dynamics. J. Log. Algebraic Methods Program. 79(1): 32-37 (2010) - [c19]Norbert Th. Müller, Margarita V. Korovina:
Making big steps in trajectories. CCA 2010: 106-119
2000 – 2009
- 2009
- [j3]Margarita V. Korovina, Oleg V. Kudinov:
The Uniformity Principle for Sigma-definability. J. Log. Comput. 19(1): 159-174 (2009) - [c18]Margarita V. Korovina, Oleg V. Kudinov:
SigmaK-constraints for Hybrid Systems. Ershov Memorial Conference 2009: 230-241 - 2008
- [j2]Andrei S. Morozov, Margarita V. Korovina:
On sigma-definability without equality over the real numbers. Math. Log. Q. 54(5): 535-544 (2008) - [j1]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Theory Comput. Syst. 43(3-4): 498-515 (2008) - [c17]Margarita V. Korovina, Oleg V. Kudinov:
Towards Computability over Effectively Enumerable Topological Spaces. CCA 2008: 115-125 - 2007
- [c16]Margarita V. Korovina, Oleg V. Kudinov:
The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis. CiE 2007: 416-425 - [c15]Andrei S. Morozov, Margarita V. Korovina:
Remarks on Sigma-definability without the equality test over the Reals. CCA 2007: 305-313 - 2006
- [c14]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. CiE 2006: 267-276 - [c13]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Satisfiability of Viability Constraints for Pfaffian Dynamics. Ershov Memorial Conference 2006: 260-269 - [i1]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 - 2005
- [c12]Margarita V. Korovina, Oleg V. Kudinov:
Towards Computability of Higher Type Continuous Data. CiE 2005: 235-241 - 2004
- [c11]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Pfaffian Hybrid Systems. CSL 2004: 430-441 - 2003
- [c10]Margarita V. Korovina:
Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test. CSL 2003: 330-344 - [c9]Margarita V. Korovina:
Recent Advances in S-Definability over Continuous Data Types. Ershov Memorial Conference 2003: 238-247 - [c8]Margarita V. Korovina:
Gandy's Theorem for Abstract Structures without the Equality Test. LPAR 2003: 290-301 - 2002
- [c7]Margarita V. Korovina:
Fixed points on abstract structures without the equality test. FICS 2002: 58-60 - [c6]Margarita V. Korovina:
Fixed Points on the Real Numbers without the Equality Test. CCA 2002: 104-112 - 2001
- [c5]Margarita V. Korovina, Oleg V. Kudinov:
Semantic Characterisations of Second-Order Computability over the Real Numbers. CSL 2001: 160-172 - [c4]Margarita V. Korovina, Oleg V. Kudinov:
Generalised Computability and Applications to Hybrid Systems. Ershov Memorial Conference 2001: 494-499 - 2000
- [c3]Margarita V. Korovina, Oleg V. Kudinov:
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. CCA 2000: 146-168
1990 – 1999
- 1999
- [c2]Margarita V. Korovina, Oleg V. Kudinov:
A Logical Approach to Specification of Hybrid Systems. Ershov Memorial Conference 1999: 10-16 - 1998
- [c1]Margarita V. Korovina, Oleg V. Kudinov:
Characteristic Properties of Majorant-Computability over the Reals. CSL 1998: 188-203
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
