default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOleg V. Kudinov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Petr V. Volkov
, Andrey Lukyanov, Alexander V. Goryunov, Daniil Semikov, Oleg V. Kudinov:
Low-Coherence Homodyne Interferometer for Sub-Megahertz Fiber Optic Sensor Readout. Sensors 24(2): 552 (2024)- 2020
- [i3]Margarita V. Korovina, Oleg V. Kudinov:
On the computability of ordered fields. CoRR abs/2007.14801 (2020)
2010 – 2019
- 2019
- [c23]Margarita V. Korovina, Oleg V. Kudinov:
Computable Topology for Reliable Computations. Ershov Informatics Conference 2019: 185-198 - 2018
- [j11]Margarita V. Korovina, Oleg V. Kudinov:
Complexity for partial computable functions over computable Polish spaces. Math. Struct. Comput. Sci. 28(3): 429-447 (2018) - [c22]Margarita V. Korovina, Oleg V. Kudinov:
Weak Reduction Principle and Computable Metric Spaces. CiE 2018: 234-243 - 2017
- [j10]Oleg V. Kudinov, Victor L. Selivanov:
First Order Theories of Some Lattices of Open Sets. Log. Methods Comput. Sci. 13(3) (2017) - [j9]Margarita V. Korovina, Oleg V. Kudinov:
The Rice-Shapiro theorem in Computable Topology. Log. Methods Comput. Sci. 13(4) (2017) - [j8]Margarita V. Korovina, Oleg V. Kudinov:
Computable elements and functions in effectively enumerable topological spaces. Math. Struct. Comput. Sci. 27(8): 1466-1494 (2017) - [c21]Margarita V. Korovina, Oleg V. Kudinov:
Outline of Partial Computability in Computable Topology. CiE 2017: 64-76 - [c20]Margarita V. Korovina, Oleg V. Kudinov:
On Higher Effective Descriptive Set Theory. CiE 2017: 282-291 - [c19]Margarita V. Korovina, Oleg V. Kudinov:
Highlights of the Rice-Shapiro Theorem in Computable Topology. Ershov Informatics Conference 2017: 241-255 - [i2]Oleg V. Kudinov, Victor L. Selivanov:
First Order Theories of Some Lattices of Open Sets. CoRR abs/1705.04564 (2017) - [i1]Margarita V. Korovina, Oleg V. Kudinov:
Rice-Shapiro theorem in Computable Topology. CoRR abs/1708.09820 (2017) - 2016
- [c18]Oleg V. Kudinov, Victor L. Selivanov:
On the Lattices of Effectively Open Sets. CiE 2016: 302-311 - 2015
- [j7]Margarita V. Korovina, Oleg V. Kudinov:
Positive predicate structures for continuous data. Math. Struct. Comput. Sci. 25(8): 1669-1684 (2015) - [c17]Margarita V. Korovina, Oleg V. Kudinov:
Rice's Theorem in Effectively Enumerable Topological Spaces. CiE 2015: 226-235 - 2014
- [c16]Margarita V. Korovina, Oleg V. Kudinov:
Index Sets as a Measure of Continuous Constraint Complexity. Ershov Memorial Conference 2014: 201-215 - 2012
- [j6]Andrey N. Frolov, Iskander Sh. Kalimullin, Valentina S. Harizanov, Oleg V. Kudinov, Russell G. Miller:
Spectra of highn and non-lown degrees. J. Log. Comput. 22(4): 755-777 (2012) - 2010
- [j5]Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky:
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51(1): 85-96 (2010) - [c15]Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva:
Definability in the Subword Order. CiE 2010: 246-255 - [c14]Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov:
Undecidability in Weihrauch Degrees. CiE 2010: 256-265
2000 – 2009
- 2009
- [j4]Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov:
Definability in the h-quasiorder of labeled forests. Ann. Pure Appl. Log. 159(3): 318-332 (2009) - [j3]Margarita V. Korovina, Oleg V. Kudinov:
The Uniformity Principle for Sigma-definability. J. Log. Comput. 19(1): 159-174 (2009) - [c13]Oleg V. Kudinov, Victor L. Selivanov:
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. CiE 2009: 290-299 - [c12]Oleg V. Kudinov, Victor L. Selivanov:
Definability in the Infix Order on Words. Developments in Language Theory 2009: 454-465 - [c11]Margarita V. Korovina, Oleg V. Kudinov:
SigmaK-constraints for Hybrid Systems. Ershov Memorial Conference 2009: 230-241 - 2008
- [c10]Margarita V. Korovina, Oleg V. Kudinov:
Towards Computability over Effectively Enumerable Topological Spaces. CCA 2008: 115-125 - 2007
- [j2]Wesley Calvert, Ekaterina B. Fokina, Sergei S. Goncharov, Julia F. Knight, Oleg V. Kudinov, Andrei S. Morozov, Vadim Puzarenko:
Index sets for classes of high rank structures. J. Symb. Log. 72(4): 1418-1432 (2007) - [j1]Oleg V. Kudinov, Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests. J. Log. Comput. 17(6): 1135-1151 (2007) - [c9]Margarita V. Korovina, Oleg V. Kudinov:
The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis. CiE 2007: 416-425 - [c8]Oleg V. Kudinov, Victor L. Selivanov:
Definability in the Homomorphic Quasiorder of Finite Labeled Forests. CiE 2007: 436-445 - 2006
- [c7]Oleg V. Kudinov, Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. CiE 2006: 289-296 - 2005
- [c6]Margarita V. Korovina, Oleg V. Kudinov:
Towards Computability of Higher Type Continuous Data. CiE 2005: 235-241 - 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 2024-04-24 23:17 CEST 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:
