Victor L. Selivanov

122 papers A 4B 4C 38Misc 1Journal 63Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Complexity issues for the iterated h-preorders.
Comput.
Pavel Alaev, Victor L. Selivanov
2025 C conf
L
CiE
Victor L. Selivanov
2024 J jnl
Ideal presentations and numberings of some classes of effective quasi-Polish spaces.
Comput.
Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov
2024 C conf
Universal Boolean Algebras with Applications to Semantic Classes of Models.
CiE
Mikhail G. Peretyat'kin, Victor L. Selivanov
2023 J jnl
Descriptive complexity of qcb0-spaces.
Theor. Comput. Sci.
Victor L. Selivanov
2023 C conf
Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata.
CiE
Victor L. Selivanov
2023 J jnl
Ideal presentations and numberings of some classes of effective quasi-Polish spaces.
CoRR
Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov
2023 C conf
Logic vs Topology on Regular ømega-languages.
CiE
Vladislav Orekhovskii, Victor L. Selivanov
2023 J jnl
Primitive recursive ordered fields and some applications.
Comput.
Victor L. Selivanov, Svetlana Selivanova
2023 J jnl
Wadge Degrees of Classes of ω-Regular
J. Autom. Lang. Comb.
Victor L. Selivanov
2022 J jnl
A Q-Wadge Hierarchy in quasi-Polish Spaces.
J. Symb. Log.
Victor L. Selivanov
2022 C conf
Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory.
CiE
Victor L. Selivanov
2022 C conf
Enumerating Classes of Effective Quasi-Polish Spaces.
CiE
Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov
2022 J jnl
Non-collapse of the effective Wadge hierarchy.
Comput.
Victor L. Selivanov
2021 J jnl
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision.
Comput.
Svetlana Selivanova, Victor L. Selivanov
2021 — conf
Complexity Issues for the Iterated h-Preorders.
DCFS
Pavel Alaev, Victor L. Selivanov
2021 J jnl
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).
Dagstuhl Reports
Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova
2021 Misc conf
Input-Driven Pushdown Automata on Well-Nested Infinite Strings.
CSR
Alexander Okhotin, Victor L. Selivanov
2021 C conf
Non-collapse of the Effective Wadge Hierarchy.
CiE
Victor L. Selivanov
2021 B conf
Primitive Recursive Ordered Fields and Some Applications.
CASC
Victor L. Selivanov, Svetlana Selivanova
2021 C conf
Searching for Applicable Versions of Computable Structures.
CiE
Pavel Alaev, Victor L. Selivanov
2021 J jnl
Wadge Degrees of Classes of omega-Regular k-Partitions.
CoRR
Victor L. Selivanov
2020 — conf
Classifying ømega-Regular Aperiodic k-Partitions.
DCFS
Victor L. Selivanov
2020 C conf
Degrees of Non-computability of Homeomorphism Types of Polish Spaces.
CiE
Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov
2020 J jnl
Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties.
CoRR
Alexander Okhotin, Victor L. Selivanov
2020 J jnl
Primitive Recursive Ordered Fields and Some Applications.
CoRR
Victor L. Selivanov, Svetlana Selivanova
2020 J jnl
Q-Wadge degrees as free structures.
Comput.
Victor L. Selivanov
2020 J jnl
Turing reducibility in the fine hierarchy.
Ann. Pure Appl. Log.
Alexander G. Melnikov, Victor L. Selivanov, Mars M. Yamaleev
2019 — conf
Computability on Quasi-Polish Spaces.
DCFS
Mathieu Hoyrup, Cristobal Rojas, Victor L. Selivanov, Donald M. Stull
2019 J jnl
Effective Wadge Hierarchy in Computable Quasi-Polish Spaces.
CoRR
Victor L. Selivanov
2019 — conf
On Classes of Regular Languages Related to Monotone WQOs.
DCFS
Mizuhito Ogawa, Victor L. Selivanov
2019 J jnl
Wadge-like degrees of Borel bqo-valued functions.
CoRR
Takayuki Kihara, Victor L. Selivanov
2018 C conf
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract).
CiE
Svetlana V. Selivanova, Victor L. Selivanov
2018 J jnl
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs with Guaranteed Precision.
CoRR
Svetlana Selivanova, Victor L. Selivanov
2018 J jnl
Extending Cooper's theorem to Δ 3 0 Turing degrees.
Comput.
Victor L. Selivanov, Mars M. Yamaleev
2018 C conf
Polynomial-Time Presentations of Algebraic Number Fields.
CiE
Pavel Alaev, Victor L. Selivanov
2018 J jnl
Well Quasiorders and Hierarchy Theory.
CoRR
Victor L. Selivanov
2017 J jnl
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs.
Log. Methods Comput. Sci.
Svetlana Selivanova, Victor L. Selivanov
2017 C conf
Extending Wadge Theory to k-Partitions.
CiE
Victor L. Selivanov
2017 J jnl
First Order Theories of Some Lattices of Open Sets.
CoRR
Oleg V. Kudinov, Victor L. Selivanov
2017 J jnl
First Order Theories of Some Lattices of Open Sets.
Log. Methods Comput. Sci.
Oleg V. Kudinov, Victor L. Selivanov
2017 J jnl
Towards a descriptive theory of cb0-spaces.
Math. Struct. Comput. Sci.
Victor L. Selivanov
2016 J jnl
Base-complexity classifications of qcb0-spaces1.
Comput.
Matthew de Brecht, Matthias Schröder, Victor L. Selivanov
2016 J jnl
Efficient algorithms for membership in boolean hierarchies of regular languages.
Theor. Comput. Sci.
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
2016 C conf
On the Lattices of Effectively Open Sets.
CiE
Oleg V. Kudinov, Victor L. Selivanov
2016 C conf
The Boolean Algebra of Piecewise Testable Languages.
CiE
Anton Konovalov, Victor L. Selivanov
2016 J jnl
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).
Dagstuhl Reports
Jean Goubault-Larrecq, Monika Seisenberger, Victor L. Selivanov, Andreas Weiermann
2015 C conf
Base-Complexity Classifications of QCB
CiE
Matthew de Brecht, Matthias Schröder, Victor L. Selivanov
2015 J jnl
Duality in Computer Science (Dagstuhl Seminar 15441).
Dagstuhl Reports
Mai Gehrke, Achim Jung, Victor L. Selivanov, Dieter Spreen
2015 J jnl
Hyperprojective hierarchy of qcb
Comput.
Matthias Schröder, Victor L. Selivanov
2015 J jnl
Preface to the special issue: Computing with infinite data: topological and logical foundations.
Math. Struct. Comput. Sci.
Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
2015 J jnl
Some hierarchies of QCB
Math. Struct. Comput. Sci.
Matthias Schröder, Victor L. Selivanov
2015 C conf
Towards the Effective Descriptive Set Theory.
CiE
Victor L. Selivanov
2015 J jnl
Wadge-like reducibilities on arbitrary quasi-Polish spaces.
Math. Struct. Comput. Sci.
Luca Motto Ros, Philipp Schlicht, Victor L. Selivanov
2014 — ch.
Complexity issues for Preorders on finite labeled forests.
Logic, Computation, Hierarchies
Peter Hertling, Victor L. Selivanov
2014 J jnl
Hyperprojective Hierarchy of QCB
CoRR
Matthias Schröder, Victor L. Selivanov
2014 C conf
Hyperprojective Hierarchy of qcb
CiE
Matthias Schröder, Victor L. Selivanov
2013 C conf
Boolean Algebras of Regular ω-Languages.
LATA
Victor L. Selivanov, Anton Konovalov
2013 J jnl
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
CoRR
Svetlana Selivanova, Victor L. Selivanov
2013 J jnl
Duality in Computer Science (Dagstuhl Seminar 13311).
Dagstuhl Reports
Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen
2013 J jnl
Some Hierarchies of QCB
CoRR
Matthias Schröder, Victor L. Selivanov
2013 J jnl
Total Representations
Log. Methods Comput. Sci.
Victor L. Selivanov
2012 J jnl
Fine hierarchies via Priestley duality.
Ann. Pure Appl. Log.
Victor L. Selivanov
2011 C conf
A Fine Hierarchy of ω-Regular k-Partitions.
CiE
Victor L. Selivanov
2011 C conf
Boolean Algebras of Regular Languages.
Developments in Language Theory
Victor L. Selivanov, Anton Konovalov
2011 C conf
Complexity Issues for Preorders on Finite Labeled Forests.
CiE
Peter Hertling, Victor L. Selivanov
2011 J jnl
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411).
Dagstuhl Reports
Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
2011 J jnl
The shrinking property for NP and coNP.
Theor. Comput. Sci.
Christian Glaßer, Christian Reitwießner, Victor L. Selivanov
2010 — conf
10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.
Advances and Applications of Automata on Words and Trees
Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas
2010 — conf
10501 Executive Summary - Advances and Applications of Automata on Words and Trees.
Advances and Applications of Automata on Words and Trees
Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas
2010 — ed.
Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010
Advances and Applications of Automata on Words and Trees
Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas
2010 C conf
Definability in the Subword Order.
CiE
Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva
2010 J jnl
On the Wadge reducibility of k-partitions.
J. Log. Algebraic Methods Program.
Victor L. Selivanov
2010 C conf
Undecidability in Weihrauch Degrees.
CiE
Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov
2009 C conf
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.
CiE
Oleg V. Kudinov, Victor L. Selivanov
2009 J jnl
Computing the Solution Operators of Symmetric Hyperbolic Systems of PDE.
J. Univers. Comput. Sci.
Svetlana Selivanova, Victor L. Selivanov
2009 C conf
Definability in the Infix Order on Words.
Developments in Language Theory
Oleg V. Kudinov, Victor L. Selivanov
2009 J jnl
Definability in the h-quasiorder of labeled forests.
Ann. Pure Appl. Log.
Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov
2009 J jnl
Hierarchies and reducibilities on regular languages related to modulo counting.
RAIRO Theor. Informatics Appl.
Victor L. Selivanov
2009 J jnl
Undecidability in Some Structures Related to Computation Theory.
J. Log. Comput.
Victor L. Selivanov
2008 — conf
08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations.
Topological and Game-Theoretic Aspects of Infinite Computations
Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2008 — conf
08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.
Topological and Game-Theoretic Aspects of Infinite Computations
Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2008 C conf
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.
CiE
Victor L. Selivanov, Klaus W. Wagner
2008 C conf
Complexity of Topological Properties of Regular omega-Languages.
Developments in Language Theory
Victor L. Selivanov, Klaus W. Wagner
2008 J jnl
Complexity of Topological Properties of Regular omega-Languages.
Fundam. Informaticae
Victor L. Selivanov, Klaus W. Wagner
2008 C conf
Computing Solutions of Symmetric Hyperbolic Systems of PDE's.
CCA
Svetlana Selivanova, Victor L. Selivanov
2008 J jnl
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
CoRR
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
2008 A conf
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
STACS
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
2008 J jnl
Fine Hierarchy of Regular Aperiodic omega-Languages.
Int. J. Found. Comput. Sci.
Victor L. Selivanov
2008 J jnl
Fine hierarchies and m-reducibilities in theoretical computer science.
Theor. Comput. Sci.
Victor L. Selivanov
2008 C conf
On the Difference Hierarchy in Countably Based T
CCA
Victor L. Selivanov
2008 C conf
The Shrinking Property for NP and coNP.
CiE
Christian Glaßer, Christian Reitwießner, Victor L. Selivanov
2008 J jnl
The Shrinking Property for NP and coNP.
Electron. Colloquium Comput. Complex.
Christian Glaßer, Christian Reitwießner, Victor L. Selivanov
2008 — ed.
Topological and Game-Theoretic Aspects of Infinite Computations, 29.06. - 04.07.2008
Topological and Game-Theoretic Aspects of Infinite Computations
Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2008 J jnl
Wadge Reducibility and Infinite Computations.
Math. Comput. Sci.
Victor L. Selivanov
2007 C conf
A Useful Undecidable Theory.
CiE
Victor L. Selivanov
2007 C conf
Classifying omega-regular partitions.
LATA
Victor L. Selivanov
2007 C conf
Definability in the Homomorphic Quasiorder of Finite Labeled Forests.
CiE
Oleg V. Kudinov, Victor L. Selivanov
2007 J jnl
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
Electron. Colloquium Comput. Complex.
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
2007 C conf
Fine Hierarchy of Regular Aperiodic
Developments in Language Theory
Victor L. Selivanov
2007 J jnl
Hierarchies of Delta
Math. Log. Q.
Victor L. Selivanov
2007 C conf
On the Wadge Reducibility of k-Partitions.
CCA
Victor L. Selivanov
2007 J jnl
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests.
J. Log. Comput.
Oleg V. Kudinov, Victor L. Selivanov
2006 J jnl
Towards a descriptive set theory for domain-like structures.
Theor. Comput. Sci.
Victor L. Selivanov
2006 C conf
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.
CiE
Oleg V. Kudinov, Victor L. Selivanov
2005 J jnl
A reducibility for the dot-depth hierarchy.
Theor. Comput. Sci.
Victor L. Selivanov, Klaus W. Wagner
2005 J jnl
Hierarchies in
Math. Log. Q.
Victor L. Selivanov
2005 C conf
Some Reducibilities on Regular Sets.
CiE
Victor L. Selivanov
2004 B conf
A Reducibility for the Dot-Depth Hierarchy.
MFCS
Victor L. Selivanov, Klaus W. Wagner
2004 C conf
Variations on Wadge Reducibility Extended Abstract.
CCA
Victor L. Selivanov
2003 J jnl
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines.
RAIRO Theor. Informatics Appl.
Victor L. Selivanov
2003 A conf
Wadge Degrees of omega-Languages of Deterministic Turing Machines.
STACS
Victor L. Selivanov
2002 J jnl
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies.
RAIRO Theor. Informatics Appl.
Victor L. Selivanov
2001 A conf
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages.
STACS
Victor L. Selivanov
2001 B conf
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.
FCT
Victor L. Selivanov
1998 J jnl
Fine Hierarchy of Regular Omega-Languages.
Theor. Comput. Sci.
Victor L. Selivanov
1996 J jnl
On Recursively Enumerable Structures.
Ann. Pure Appl. Log.
Victor L. Selivanov
1995 J jnl
Fine Hierarchies and Boolean Terms.
J. Symb. Log.
Victor L. Selivanov
1995 — conf
Fine Hierarchy of Regular omega-Languages.
TAPSOFT
Victor L. Selivanov
1994 J jnl
Recursiveness of ω-Operations.
Math. Log. Q.
Victor L. Selivanov
1994 A conf
Two Refinements of the Polynomial Hierarcht.
STACS
Victor L. Selivanov
1987 B conf
Index-Sets of Factor-Objects of the Post Numbering.
FCT
Victor L. Selivanov