Victor L. Selivanov

According to our database1, Victor L. Selivanov authored at least 72 papers between 1987 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On Classes of Regular Languages Related to Monotone WQOs.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

Computability on Quasi-Polish Spaces.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018
Extending Cooper's theorem to Δ 3 0 Turing degrees.
Computability, 2018

Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract).
Proceedings of the Sailing Routes in the World of Computation, 2018

Polynomial-Time Presentations of Algebraic Number Fields.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
Towards a descriptive theory of cb0-spaces.
Mathematical Structures in Computer Science, 2017

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs.
Logical Methods in Computer Science, 2017

First Order Theories of Some Lattices of Open Sets.
Logical Methods in Computer Science, 2017

Extending Wadge Theory to k-Partitions.
Proceedings of the Unveiling Dynamics and Complexity, 2017

2016
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).
Dagstuhl Reports, 2016

On the Lattices of Effectively Open Sets.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

The Boolean Algebra of Piecewise Testable Languages.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Some hierarchies of QCB 0-spaces.
Mathematical Structures in Computer Science, 2015

Wadge-like reducibilities on arbitrary quasi-Polish spaces.
Mathematical Structures in Computer Science, 2015

Preface to the special issue: Computing with infinite data: topological and logical foundations.
Mathematical Structures in Computer Science, 2015

Duality in Computer Science (Dagstuhl Seminar 15441).
Dagstuhl Reports, 2015

Towards the Effective Descriptive Set Theory.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

Base-Complexity Classifications of QCB0-Spaces.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Hyperprojective Hierarchy of qcb0-Spaces.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Duality in Computer Science (Dagstuhl Seminar 13311).
Dagstuhl Reports, 2013

Total Representations
Logical Methods in Computer Science, 2013

Boolean Algebras of Regular ω-Languages.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
Fine hierarchies via Priestley duality.
Ann. Pure Appl. Logic, 2012

2011
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411).
Dagstuhl Reports, 2011

Boolean Algebras of Regular Languages.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

A Fine Hierarchy of ω-Regular k-Partitions.
Proceedings of the Models of Computation in Context, 2011

Complexity Issues for Preorders on Finite Labeled Forests.
Proceedings of the Models of Computation in Context, 2011

2010
On the Wadge reducibility of k-partitions.
J. Log. Algebr. Program., 2010

10501 Executive Summary - Advances and Applications of Automata on Words and Trees.
Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.
Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

Undecidability in Weihrauch Degrees.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Definability in the Subword Order.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Undecidability in Some Structures Related to Computation Theory.
J. Log. Comput., 2009

Computing the Solution Operators of Symmetric Hyperbolic Systems of PDE.
J. UCS, 2009

Hierarchies and reducibilities on regular languages related to modulo counting.
ITA, 2009

Definability in the h-quasiorder of labeled forests.
Ann. Pure Appl. Logic, 2009

Definability in the Infix Order on Words.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Fine hierarchies and m-reducibilities in theoretical computer science.
Theor. Comput. Sci., 2008

Wadge Reducibility and Infinite Computations.
Mathematics in Computer Science, 2008

Fine Hierarchy of Regular Aperiodic omega-Languages.
Int. J. Found. Comput. Sci., 2008

Computing Solutions of Symmetric Hyperbolic Systems of PDE's.
Electr. Notes Theor. Comput. Sci., 2008

On the Difference Hierarchy in Countably Based T0-Spaces.
Electr. Notes Theor. Comput. Sci., 2008

On the Wadge Reducibility of k-Partitions.
Electr. Notes Theor. Comput. Sci., 2008

Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
Proceedings of the STACS 2008, 2008

Complexity of Topological Properties of Regular omega-Languages.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.
Proceedings of the Logic and Theory of Algorithms, 2008

The Shrinking Property for NP and coNP.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Hierarchies of Delta02-measurable k -partitions.
Math. Log. Q., 2007

Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests.
J. Log. Comput., 2007

Classifying omega-regular partitions.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Fine Hierarchy of Regular Aperiodic omega -Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

A Useful Undecidable Theory.
Proceedings of the Computation and Logic in the Real World, 2007

Definability in the Homomorphic Quasiorder of Finite Labeled Forests.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Towards a descriptive set theory for domain-like structures.
Theor. Comput. Sci., 2006

Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Hierarchies in phi-spaces and applications.
Math. Log. Q., 2005

Variations on Wadge Reducibility Extended Abstract.
Electr. Notes Theor. Comput. Sci., 2005

Some Reducibilities on Regular Sets.
Proceedings of the New Computational Paradigms, 2005

2004
A Reducibility for the Dot-Depth Hierarchy.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines.
ITA, 2003

Wadge Degrees of omega-Languages of Deterministic Turing Machines.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2001
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages.
Proceedings of the STACS 2001, 2001

Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

1996
On Recursively Enumerable Structures.
Ann. Pure Appl. Logic, 1996

1995
Fine Hierarchies and Boolean Terms.
J. Symb. Log., 1995

Fine Hierarchy of Regular omega-Languages.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

1994
Recursiveness of ω-Operations.
Math. Log. Q., 1994

Two Refinements of the Polynomial Hierarcht.
Proceedings of the STACS 94, 1994

1987
Index-Sets of Factor-Objects of the Post Numbering.
Proceedings of the Fundamentals of Computation Theory, 1987


  Loading...