Index-Sets of Factor-Objects of the Post Numbering. - Victor L. Selivanov (FCT, 1987)

Two Refinements of the Polynomial Hierarcht. - Victor L. Selivanov (STACS, 1994)

Recursiveness of ω-Operations. - Victor L. Selivanov (Math. Log. Q., 1994)

Fine Hierarchies and Boolean Terms. - Victor L. Selivanov (J. Symb. Log., 1995)

On Recursively Enumerable Structures. - Victor L. Selivanov (Ann. Pure Appl. Log., 1996)

Fine Hierarchy of Regular Omega-Languages. - Victor L. Selivanov (Theor. Comput. Sci., 1998)

A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. - Victor L. Selivanov (STACS, 2001)

Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies. - Victor L. Selivanov (RAIRO Theor. Informatics Appl., 2002)

Wadge Degrees of [omega]-Languages of Deterministic Turing Machines. - Victor L. Selivanov (RAIRO Theor. Informatics Appl., 2003)

Variations on Wadge Reducibility Extended Abstract. - Victor L. Selivanov (CCA, 2004)

Some Reducibilities on Regular Sets. - Victor L. Selivanov (CiE, 2005)

Hierarchies in phi-spaces and applications. - Victor L. Selivanov (Math. Log. Q., 2005)

A reducibility for the dot-depth hierarchy. - Victor L. Selivanov; Klaus W. Wagner (Theor. Comput. Sci., 2005)

Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. - Oleg V. Kudinov; Victor L. Selivanov (CiE, 2006)

Towards a descriptive set theory for domain-like structures. - Victor L. Selivanov (Theor. Comput. Sci., 2006)

Definability in the Homomorphic Quasiorder of Finite Labeled Forests. - Oleg V. Kudinov; Victor L. Selivanov (CiE, 2007)

A Useful Undecidable Theory. - Victor L. Selivanov (CiE, 2007)

Fine Hierarchy of Regular Aperiodic omega -Languages. - Victor L. Selivanov (Developments in Language Theory, 2007)

Classifying omega-regular partitions. - Victor L. Selivanov (LATA, 2007)

On the Wadge Reducibility of k-Partitions. - Victor L. Selivanov (CCA, 2007)

Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests. - Oleg V. Kudinov; Victor L. Selivanov (J. Log. Comput., 2007)

Hierarchies of Delta02-measurable k -partitions. - Victor L. Selivanov (Math. Log. Q., 2007)

Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. - Victor L. Selivanov; Klaus W. Wagner (CiE, 2008)

08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. - Peter Hertling; Victor L. Selivanov; Wolfgang Thomas; William W. Wadge; Klaus W. Wagner (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. - Peter Hertling; Victor L. Selivanov; Wolfgang Thomas; William W. Wadge; Klaus W. Wagner (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

On the Difference Hierarchy in Countably Based T0-Spaces. - Victor L. Selivanov (CCA, 2008)

Computing Solutions of Symmetric Hyperbolic Systems of PDE's. - Svetlana Selivanova; Victor L. Selivanov (CCA, 2008)

Complexity of Topological Properties of Regular omega-Languages. - Victor L. Selivanov; Klaus W. Wagner (Fundam. Informaticae, 2008)

Fine Hierarchy of Regular Aperiodic omega-Languages. - Victor L. Selivanov (Int. J. Found. Comput. Sci., 2008)

Wadge Reducibility and Infinite Computations. - Victor L. Selivanov (Math. Comput. Sci., 2008)

Fine hierarchies and m-reducibilities in theoretical computer science. - Victor L. Selivanov (Theor. Comput. Sci., 2008)

A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. - Oleg V. Kudinov; Victor L. Selivanov (CiE, 2009)

Definability in the Infix Order on Words. - Oleg V. Kudinov; Victor L. Selivanov (Developments in Language Theory, 2009)

Definability in the h-quasiorder of labeled forests. - Oleg V. Kudinov; Victor L. Selivanov; Anton V. Zhukov (Ann. Pure Appl. Log., 2009)

Hierarchies and reducibilities on regular languages related to modulo counting. - Victor L. Selivanov (RAIRO Theor. Informatics Appl., 2009)

Computing the Solution Operators of Symmetric Hyperbolic Systems of PDE. - Svetlana Selivanova; Victor L. Selivanov (J. Univers. Comput. Sci., 2009)

Undecidability in Some Structures Related to Computation Theory. - Victor L. Selivanov (J. Log. Comput., 2009)

Definability in the Subword Order. - Oleg V. Kudinov; Victor L. Selivanov; Lyudmila V. Yartseva (CiE, 2010)

Undecidability in Weihrauch Degrees. - Oleg V. Kudinov; Victor L. Selivanov; Anton V. Zhukov (CiE, 2010)

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. - Christian Glaßer; Jean-Eric Pin; Nicole Schweikardt; Victor L. Selivanov; Wolfgang Thomas (Advances and Applications of Automata on Words and Trees, 2010)

10501 Executive Summary - Advances and Applications of Automata on Words and Trees. - Christian Glaßer; Jean-Eric Pin; Nicole Schweikardt; Victor L. Selivanov; Wolfgang Thomas (Advances and Applications of Automata on Words and Trees, 2010)

Complexity Issues for Preorders on Finite Labeled Forests. - Peter Hertling; Victor L. Selivanov (CiE, 2011)

A Fine Hierarchy of ω-Regular k-Partitions. - Victor L. Selivanov (CiE, 2011)

Boolean Algebras of Regular Languages. - Victor L. Selivanov; Anton Konovalov (Developments in Language Theory, 2011)

Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). - Ulrich Berger 001; Vasco Brattka; Victor L. Selivanov; Dieter Spreen; Hideki Tsuiki (Dagstuhl Reports, 2011)

The shrinking property for NP and coNP. - Christian Glaßer; Christian Reitwießner; Victor L. Selivanov (Theor. Comput. Sci., 2011)

Fine hierarchies via Priestley duality. - Victor L. Selivanov (Ann. Pure Appl. Log., 2012)

Boolean Algebras of Regular ω-Languages. - Victor L. Selivanov; Anton Konovalov (LATA, 2013)

Total Representations - Victor L. Selivanov (Log. Methods Comput. Sci., 2013)

Duality in Computer Science (Dagstuhl Seminar 13311). - Mai Gehrke; Jean-Eric Pin; Victor L. Selivanov; Dieter Spreen (Dagstuhl Reports, 2013)

Complexity issues for Preorders on finite labeled forests. - Peter Hertling; Victor L. Selivanov (Logic, Computation, Hierarchies, 2014)

Base-Complexity Classifications of QCB0-Spaces. - Matthew de Brecht; Matthias Schröder 001; Victor L. Selivanov (CiE, 2015)

Towards the Effective Descriptive Set Theory. - Victor L. Selivanov (CiE, 2015)

Hyperprojective hierarchy of qcb0-spaces. - Matthias Schröder 001; Victor L. Selivanov (Comput., 2015)

Duality in Computer Science (Dagstuhl Seminar 15441). - Mai Gehrke; Achim Jung; Victor L. Selivanov; Dieter Spreen (Dagstuhl Reports, 2015)

Preface to the special issue: Computing with infinite data: topological and logical foundations. - Ulrich Berger 001; Vasco Brattka; Victor L. Selivanov; Dieter Spreen; Hideki Tsuiki (Math. Struct. Comput. Sci., 2015)

Wadge-like reducibilities on arbitrary quasi-Polish spaces. - Luca Motto Ros; Philipp Schlicht; Victor L. Selivanov (Math. Struct. Comput. Sci., 2015)

Some hierarchies of QCB 0-spaces. - Matthias Schröder 001; Victor L. Selivanov (Math. Struct. Comput. Sci., 2015)

The Boolean Algebra of Piecewise Testable Languages. - Anton Konovalov; Victor L. Selivanov (CiE, 2016)

On the Lattices of Effectively Open Sets. - Oleg V. Kudinov; Victor L. Selivanov (CiE, 2016)

Base-complexity classifications of qcb0-spaces1. - Matthew de Brecht; Matthias Schröder 001; Victor L. Selivanov (Comput., 2016)

Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). - Jean Goubault-Larrecq; Monika Seisenberger; Victor L. Selivanov; Andreas Weiermann (Dagstuhl Reports, 2016)

Efficient algorithms for membership in boolean hierarchies of regular languages. - Christian Glaßer; Heinz Schmitz; Victor L. Selivanov (Theor. Comput. Sci., 2016)

Extending Wadge Theory to k-Partitions. - Victor L. Selivanov (CiE, 2017)

First Order Theories of Some Lattices of Open Sets. - Oleg V. Kudinov; Victor L. Selivanov (Log. Methods Comput. Sci., 2017)

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs. - Svetlana Selivanova; Victor L. Selivanov (Log. Methods Comput. Sci., 2017)

Towards a descriptive theory of cb0-spaces. - Victor L. Selivanov (Math. Struct. Comput. Sci., 2017)

Polynomial-Time Presentations of Algebraic Number Fields. - Pavel Alaev; Victor L. Selivanov (CiE, 2018)

Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract). - Svetlana V. Selivanova; Victor L. Selivanov (CiE, 2018)

Extending Cooper's theorem to Δ 3 0 Turing degrees. - Victor L. Selivanov; Mars M. Yamaleev (Comput., 2018)

Well Quasiorders and Hierarchy Theory. - Victor L. Selivanov (CoRR, 2018)

Computability on Quasi-Polish Spaces. - Mathieu Hoyrup; Cristobal Rojas; Victor L. Selivanov; Donald M. Stull (DCFS, 2019)

On Classes of Regular Languages Related to Monotone WQOs. - Mizuhito Ogawa; Victor L. Selivanov (DCFS, 2019)

Wadge-like degrees of Borel bqo-valued functions. - Takayuki Kihara; Victor L. Selivanov (CoRR, 2019)

Effective Wadge Hierarchy in Computable Quasi-Polish Spaces. - Victor L. Selivanov (CoRR, 2019)

Degrees of Non-computability of Homeomorphism Types of Polish Spaces. - Mathieu Hoyrup; Takayuki Kihara; Victor L. Selivanov (CiE, 2020)

Classifying ømega-Regular Aperiodic k-Partitions. - Victor L. Selivanov (DCFS, 2020)

Turing reducibility in the fine hierarchy. - Alexander G. Melnikov; Victor L. Selivanov; Mars M. Yamaleev (Ann. Pure Appl. Log., 2020)

Q-Wadge degrees as free structures. - Victor L. Selivanov (Comput., 2020)

Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties. - Alexander Okhotin; Victor L. Selivanov (CoRR, 2020)

Searching for Applicable Versions of Computable Structures. - Pavel Alaev; Victor L. Selivanov (CiE, 2021)

Input-Driven Pushdown Automata on Well-Nested Infinite Strings. - Alexander Okhotin; Victor L. Selivanov (CSR, 2021)

Complexity Issues for the Iterated h-Preorders. - Pavel Alaev; Victor L. Selivanov (DCFS, 2021)

Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision. - Svetlana Selivanova; Victor L. Selivanov (Comput., 2021)

Wadge Degrees of Classes of omega-Regular k-Partitions. - Victor L. Selivanov (CoRR, 2021)

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). - Mathieu Hoyrup; Arno Pauly; Victor L. Selivanov; Mariya Ivanova Soskova (Dagstuhl Reports, 2021)

Enumerating Classes of Effective Quasi-Polish Spaces. - Matthew de Brecht; Takayuki Kihara; Victor L. Selivanov (CiE, 2022)

Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory. - Victor L. Selivanov (CiE, 2022)

Non-collapse of the effective Wadge hierarchy. - Victor L. Selivanov (Comput., 2022)

A Q-Wadge Hierarchy in quasi-Polish Spaces. - Victor L. Selivanov (J. Symb. Log., 2022)

Logic vs Topology on Regular ømega-languages. - Vladislav Orekhovskii; Victor L. Selivanov (CiE, 2023)

Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata. - Victor L. Selivanov (CiE, 2023)

Primitive recursive ordered fields and some applications. - Victor L. Selivanov; Svetlana Selivanova (Comput., 2023)

Wadge Degrees of Classes of ω-Regular k-Partitions. - Victor L. Selivanov (J. Autom. Lang. Comb., 2023)

Descriptive complexity of qcb0-spaces. - Victor L. Selivanov (Theor. Comput. Sci., 2023)

Universal Boolean Algebras with Applications to Semantic Classes of Models. - Mikhail G. Peretyat'kin; Victor L. Selivanov (CiE, 2024)

Ideal presentations and numberings of some classes of effective quasi-Polish spaces. - Matthew de Brecht; Takayuki Kihara; Victor L. Selivanov (Comput., 2024)

Lømega ømega , Lømega 1ømega , and the Wadge Hierarchy. - Victor L. Selivanov (CiE, 2025)