default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor L. Selivanov
Person information
- affiliation: Russian Academy of Sciences, A. P. Ershov Institute of Informatics Systems, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov:
Ideal presentations and numberings of some classes of effective quasi-Polish spaces. Comput. 13(3-4): 325-348 (2024)- [c51]Mikhail G. Peretyat'kin, Victor L. Selivanov:
Universal Boolean Algebras with Applications to Semantic Classes of Models. CiE 2024: 205-217 - 2023
- [j41]Victor L. Selivanov, Svetlana Selivanova:
Primitive recursive ordered fields and some applications. Comput. 12(1): 71-99 (2023) - [j40]Victor L. Selivanov
:
Wadge Degrees of Classes of ω-Regular k-Partitions. J. Autom. Lang. Comb. 28(1-3): 167-199 (2023) - [j39]Victor L. Selivanov:
Descriptive complexity of qcb0-spaces. Theor. Comput. Sci. 945: 113666 (2023) - [c50]Vladislav Orekhovskii, Victor L. Selivanov:
Logic vs Topology on Regular ømega-languages. CiE 2023: 141-153 - [c49]Victor L. Selivanov:
Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata. CiE 2023: 190-201 - [i24]Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov:
Ideal presentations and numberings of some classes of effective quasi-Polish spaces. CoRR abs/2301.08469 (2023) - 2022
- [j38]Victor L. Selivanov:
Non-collapse of the effective Wadge hierarchy. Comput. 11(3-4): 335-358 (2022) - [j37]Victor L. Selivanov:
A Q-Wadge Hierarchy in quasi-Polish Spaces. J. Symb. Log. 87(2): 732-757 (2022) - [c48]Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov:
Enumerating Classes of Effective Quasi-Polish Spaces. CiE 2022: 88-102 - [c47]Victor L. Selivanov:
Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory. CiE 2022: 287-298 - 2021
- [j36]Svetlana Selivanova, Victor L. Selivanov:
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision. Comput. 10(2): 123-140 (2021) - [c46]Victor L. Selivanov, Svetlana Selivanova:
Primitive Recursive Ordered Fields and Some Applications. CASC 2021: 353-369 - [c45]Pavel Alaev, Victor L. Selivanov:
Searching for Applicable Versions of Computable Structures. CiE 2021: 1-11 - [c44]Victor L. Selivanov:
Non-collapse of the Effective Wadge Hierarchy. CiE 2021: 407-416 - [c43]Alexander Okhotin, Victor L. Selivanov:
Input-Driven Pushdown Automata on Well-Nested Infinite Strings. CSR 2021: 349-360 - [c42]Pavel Alaev, Victor L. Selivanov:
Complexity Issues for the Iterated h-Preorders. DCFS 2021: 1-12 - [i23]Victor L. Selivanov:
Wadge Degrees of Classes of omega-Regular k-Partitions. CoRR abs/2104.10358 (2021) - [i22]Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova:
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). Dagstuhl Reports 11(10): 72-93 (2021) - 2020
- [j35]Alexander G. Melnikov, Victor L. Selivanov, Mars M. Yamaleev:
Turing reducibility in the fine hierarchy. Ann. Pure Appl. Log. 171(7): 102766 (2020) - [j34]Victor L. Selivanov:
Q-Wadge degrees as free structures. Comput. 9(3-4): 327-341 (2020) - [c41]Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov:
Degrees of Non-computability of Homeomorphism Types of Polish Spaces. CiE 2020: 189-192 - [c40]Victor L. Selivanov:
Classifying ømega-Regular Aperiodic k-Partitions. DCFS 2020: 193-205 - [i21]Victor L. Selivanov, Svetlana Selivanova:
Primitive Recursive Ordered Fields and Some Applications. CoRR abs/2010.10189 (2020) - [i20]Alexander Okhotin, Victor L. Selivanov:
Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties. CoRR abs/2012.03395 (2020)
2010 – 2019
- 2019
- [c39]Mathieu Hoyrup, Cristobal Rojas, Victor L. Selivanov, Donald M. Stull:
Computability on Quasi-Polish Spaces. DCFS 2019: 171-183 - [c38]Mizuhito Ogawa, Victor L. Selivanov:
On Classes of Regular Languages Related to Monotone WQOs. DCFS 2019: 235-247 - [i19]Takayuki Kihara, Victor L. Selivanov:
Wadge-like degrees of Borel bqo-valued functions. CoRR abs/1909.10835 (2019) - [i18]Victor L. Selivanov:
Effective Wadge Hierarchy in Computable Quasi-Polish Spaces. CoRR abs/1910.13220 (2019) - 2018
- [j33]Victor L. Selivanov, Mars M. Yamaleev:
Extending Cooper's theorem to Δ 3 0 Turing degrees. Comput. 7(2-3): 289-300 (2018) - [c37]Pavel Alaev, Victor L. Selivanov:
Polynomial-Time Presentations of Algebraic Number Fields. CiE 2018: 20-29 - [c36]Svetlana V. Selivanova, Victor L. Selivanov:
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract). CiE 2018: 376-385 - [i17]Svetlana Selivanova, Victor L. Selivanov:
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs with Guaranteed Precision. CoRR abs/1807.03140 (2018) - [i16]Victor L. Selivanov:
Well Quasiorders and Hierarchy Theory. CoRR abs/1809.02941 (2018) - 2017
- [j32]Oleg V. Kudinov, Victor L. Selivanov:
First Order Theories of Some Lattices of Open Sets. Log. Methods Comput. Sci. 13(3) (2017) - [j31]Svetlana Selivanova, Victor L. Selivanov:
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs. Log. Methods Comput. Sci. 13(4) (2017) - [j30]Victor L. Selivanov:
Towards a descriptive theory of cb0-spaces. Math. Struct. Comput. Sci. 27(8): 1553-1580 (2017) - [c35]Victor L. Selivanov:
Extending Wadge Theory to k-Partitions. CiE 2017: 387-399 - [i15]Oleg V. Kudinov, Victor L. Selivanov:
First Order Theories of Some Lattices of Open Sets. CoRR abs/1705.04564 (2017) - 2016
- [j29]Matthew de Brecht, Matthias Schröder, Victor L. Selivanov:
Base-complexity classifications of qcb0-spaces1. Comput. 5(1): 75-102 (2016) - [j28]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient algorithms for membership in boolean hierarchies of regular languages. Theor. Comput. Sci. 646: 86-108 (2016) - [c34]Anton Konovalov, Victor L. Selivanov:
The Boolean Algebra of Piecewise Testable Languages. CiE 2016: 292-301 - [c33]Oleg V. Kudinov, Victor L. Selivanov:
On the Lattices of Effectively Open Sets. CiE 2016: 302-311 - [i14]Jean Goubault-Larrecq, Monika Seisenberger, Victor L. Selivanov, Andreas Weiermann:
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports 6(1): 69-98 (2016) - 2015
- [j27]Matthias Schröder, Victor L. Selivanov:
Hyperprojective hierarchy of qcb0-spaces. Comput. 4(1): 1-17 (2015) - [j26]Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki:
Preface to the special issue: Computing with infinite data: topological and logical foundations. Math. Struct. Comput. Sci. 25(7): 1463-1465 (2015) - [j25]Luca Motto Ros, Philipp Schlicht, Victor L. Selivanov:
Wadge-like reducibilities on arbitrary quasi-Polish spaces. Math. Struct. Comput. Sci. 25(8): 1705-1754 (2015) - [j24]Matthias Schröder, Victor L. Selivanov:
Some hierarchies of QCB 0-spaces. Math. Struct. Comput. Sci. 25(8): 1799-1823 (2015) - [c32]Matthew de Brecht, Matthias Schröder, Victor L. Selivanov:
Base-Complexity Classifications of QCB0-Spaces. CiE 2015: 156-166 - [c31]Victor L. Selivanov:
Towards the Effective Descriptive Set Theory. CiE 2015: 324-333 - [i13]Mai Gehrke, Achim Jung, Victor L. Selivanov, Dieter Spreen:
Duality in Computer Science (Dagstuhl Seminar 15441). Dagstuhl Reports 5(10): 66-88 (2015) - 2014
- [c30]Matthias Schröder, Victor L. Selivanov:
Hyperprojective Hierarchy of qcb0-Spaces. CiE 2014: 352-361 - [p1]Peter Hertling, Victor L. Selivanov:
Complexity issues for Preorders on finite labeled forests. Logic, Computation, Hierarchies 2014: 165-190 - [i12]Matthias Schröder, Victor L. Selivanov:
Hyperprojective Hierarchy of QCB0-spaces. CoRR abs/1404.0297 (2014) - 2013
- [j23]Victor L. Selivanov:
Total Representations. Log. Methods Comput. Sci. 9(2) (2013) - [c29]Victor L. Selivanov, Anton Konovalov:
Boolean Algebras of Regular ω-Languages. LATA 2013: 504-515 - [i11]Matthias Schröder, Victor L. Selivanov:
Some Hierarchies of QCB0-Spaces. CoRR abs/1304.1647 (2013) - [i10]Svetlana Selivanova, Victor L. Selivanov:
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs. CoRR abs/1305.2494 (2013) - [i9]Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen:
Duality in Computer Science (Dagstuhl Seminar 13311). Dagstuhl Reports 3(7): 54-73 (2013) - 2012
- [j22]Victor L. Selivanov:
Fine hierarchies via Priestley duality. Ann. Pure Appl. Log. 163(8): 1075-1107 (2012) - 2011
- [j21]Christian Glaßer, Christian Reitwießner, Victor L. Selivanov:
The shrinking property for NP and coNP. Theor. Comput. Sci. 412(8-10): 853-864 (2011) - [c28]Peter Hertling, Victor L. Selivanov:
Complexity Issues for Preorders on Finite Labeled Forests. CiE 2011: 112-121 - [c27]Victor L. Selivanov:
A Fine Hierarchy of ω-Regular k-Partitions. CiE 2011: 260-269 - [c26]Victor L. Selivanov, Anton Konovalov:
Boolean Algebras of Regular Languages. Developments in Language Theory 2011: 386-396 - [i8]Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki:
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). Dagstuhl Reports 1(10): 14-36 (2011) - 2010
- [j20]Victor L. Selivanov:
On the Wadge reducibility of k-partitions. J. Log. Algebraic Methods Program. 79(1): 92-102 (2010) - [c25]Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva:
Definability in the Subword Order. CiE 2010: 246-255 - [c24]Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov:
Undecidability in Weihrauch Degrees. CiE 2010: 256-265 - [e2]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010. Dagstuhl Seminar Proceedings 10501, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i7]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees 2010 - [i6]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
10501 Executive Summary - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees 2010
2000 – 2009
- 2009
- [j19]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) - [j18]Victor L. Selivanov:
Hierarchies and reducibilities on regular languages related to modulo counting. RAIRO Theor. Informatics Appl. 43(1): 95-132 (2009) - [j17]Svetlana Selivanova, Victor L. Selivanov:
Computing the Solution Operators of Symmetric Hyperbolic Systems of PDE. J. Univers. Comput. Sci. 15(6): 1337-1364 (2009) - [j16]Victor L. Selivanov:
Undecidability in Some Structures Related to Computation Theory. J. Log. Comput. 19(1): 177-197 (2009) - [c23]Oleg V. Kudinov, Victor L. Selivanov:
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. CiE 2009: 290-299 - [c22]Oleg V. Kudinov, Victor L. Selivanov:
Definability in the Infix Order on Words. Developments in Language Theory 2009: 454-465 - 2008
- [j15]Victor L. Selivanov, Klaus W. Wagner:
Complexity of Topological Properties of Regular omega-Languages. Fundam. Informaticae 83(1-2): 197-217 (2008) - [j14]Victor L. Selivanov:
Fine Hierarchy of Regular Aperiodic omega-Languages. Int. J. Found. Comput. Sci. 19(3): 649-675 (2008) - [j13]Victor L. Selivanov:
Wadge Reducibility and Infinite Computations. Math. Comput. Sci. 2(1): 5-36 (2008) - [j12]Victor L. Selivanov:
Fine hierarchies and m-reducibilities in theoretical computer science. Theor. Comput. Sci. 405(1-2): 116-163 (2008) - [c21]Christian Glaßer, Christian Reitwießner, Victor L. Selivanov:
The Shrinking Property for NP and coNP. CiE 2008: 210-220 - [c20]Victor L. Selivanov, Klaus W. Wagner:
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. CiE 2008: 533-543 - [c19]Victor L. Selivanov, Klaus W. Wagner:
Complexity of Topological Properties of Regular omega-Languages. Developments in Language Theory 2008: 529-542 - [c18]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS 2008: 337-348 - [c17]Svetlana Selivanova, Victor L. Selivanov:
Computing Solutions of Symmetric Hyperbolic Systems of PDE's. CCA 2008: 243-255 - [c16]Victor L. Selivanov:
On the Difference Hierarchy in Countably Based T0-Spaces. CCA 2008: 257-269 - [e1]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
Topological and Game-Theoretic Aspects of Infinite Computations, 29.06. - 04.07.2008. Dagstuhl Seminar Proceedings 08271, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i5]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - [i4]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - [i3]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. CoRR abs/0802.2868 (2008) - [i2]Christian Glaßer, Christian Reitwießner, Victor L. Selivanov:
The Shrinking Property for NP and coNP. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j11]Oleg V. Kudinov, Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests. J. Log. Comput. 17(6): 1135-1151 (2007) - [j10]Victor L. Selivanov:
Hierarchies of Delta02-measurable k -partitions. Math. Log. Q. 53(4-5): 446-461 (2007) - [c15]Oleg V. Kudinov, Victor L. Selivanov:
Definability in the Homomorphic Quasiorder of Finite Labeled Forests. CiE 2007: 436-445 - [c14]Victor L. Selivanov:
A Useful Undecidable Theory. CiE 2007: 685-694 - [c13]Victor L. Selivanov:
Fine Hierarchy of Regular Aperiodic omega -Languages. Developments in Language Theory 2007: 399-410 - [c12]Victor L. Selivanov:
Classifying omega-regular partitions. LATA 2007: 529-540 - [c11]Victor L. Selivanov:
On the Wadge Reducibility of k-Partitions. CCA 2007: 59-71 - [i1]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j9]Victor L. Selivanov:
Towards a descriptive set theory for domain-like structures. Theor. Comput. Sci. 365(3): 258-282 (2006) - [c10]Oleg V. Kudinov, Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. CiE 2006: 289-296 - 2005
- [j8]Victor L. Selivanov:
Hierarchies in phi-spaces and applications. Math. Log. Q. 51(1): 45-61 (2005) - [j7]Victor L. Selivanov, Klaus W. Wagner:
A reducibility for the dot-depth hierarchy. Theor. Comput. Sci. 345(2-3): 448-472 (2005) - [c9]Victor L. Selivanov:
Some Reducibilities on Regular Sets. CiE 2005: 430-439 - 2004
- [c8]Victor L. Selivanov, Klaus W. Wagner:
A Reducibility for the Dot-Depth Hierarchy. MFCS 2004: 783-793 - [c7]Victor L. Selivanov:
Variations on Wadge Reducibility Extended Abstract. CCA 2004: 159-171 - 2003
- [j6]Victor L. Selivanov:
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines. RAIRO Theor. Informatics Appl. 37(1): 67-83 (2003) - [c6]Victor L. Selivanov:
Wadge Degrees of omega-Languages of Deterministic Turing Machines. STACS 2003: 97-108 - 2002
- [j5]Victor L. Selivanov:
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies. RAIRO Theor. Informatics Appl. 36(1): 29-42 (2002) - 2001
- [c5]Victor L. Selivanov:
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies. FCT 2001: 323-334 - [c4]Victor L. Selivanov:
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. STACS 2001: 539-550
1990 – 1999
- 1998
- [j4]Victor L. Selivanov:
Fine Hierarchy of Regular Omega-Languages. Theor. Comput. Sci. 191(1-2): 37-59 (1998) - 1996
- [j3]Victor L. Selivanov:
On Recursively Enumerable Structures. Ann. Pure Appl. Log. 78(1-3): 243-258 (1996) - 1995
- [j2]Victor L. Selivanov:
Fine Hierarchies and Boolean Terms. J. Symb. Log. 60(1): 289-317 (1995) - [c3]Victor L. Selivanov:
Fine Hierarchy of Regular omega-Languages. TAPSOFT 1995: 277-287 - 1994
- [j1]Victor L. Selivanov:
Recursiveness of ω-Operations. Math. Log. Q. 40: 204-206 (1994) - [c2]Victor L. Selivanov:
Two Refinements of the Polynomial Hierarcht. STACS 1994: 439-448
1980 – 1989
- 1987
- [c1]Victor L. Selivanov:
Index-Sets of Factor-Objects of the Post Numbering. FCT 1987: 396-400
Coauthor Index
Svetlana Selivanova
aka: Svetlana V. Selivanova
aka: Svetlana V. Selivanova
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-12-26 01:52 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:
