Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Victor L. Selivanov
2010 – today
- 2013
[j27]- [c25]
- [i5]Matthias Schroeder, Victor L. Selivanov: Some Hierarchies of QCB_0-Spaces. CoRR abs/1304.1647 (2013)
- 2012
- [j26]Victor L. Selivanov: Fine hierarchies via Priestley duality. Ann. Pure Appl. Logic 163(8): 1075-1107 (2012)
- 2011
- [j25]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)
- [c24]Peter Hertling, Victor L. Selivanov: Complexity Issues for Preorders on Finite Labeled Forests. CiE 2011: 112-121
- [c23]
- [c22]Victor L. Selivanov, Anton Konovalov: Boolean Algebras of Regular Languages. Developments in Language Theory 2011: 386-396
- [i4]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
- [j24]Victor L. Selivanov: On the Wadge reducibility of k-partitions. J. Log. Algebr. Program. 79(1): 92-102 (2010)
- [c21]Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva: Definability in the Subword Order. CiE 2010: 246-255
- [c20]Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov: Undecidability in Weihrauch Degrees. CiE 2010: 256-265
2000 – 2009
- 2009
- [j23]Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov: Definability in the h-quasiorder of labeled forests. Ann. Pure Appl. Logic 159(3): 318-332 (2009)
- [j22]Victor L. Selivanov: Hierarchies and reducibilities on regular languages related to modulo counting. ITA 43(1): 95-132 (2009)
- [j21]Svetlana Selivanova, Victor L. Selivanov: Computing the Solution Operators of Symmetric Hyperbolic Systems of PDE. J. UCS 15(6): 1337-1364 (2009)
- [j20]Victor L. Selivanov: Undecidability in Some Structures Related to Computation Theory. J. Log. Comput. 19(1): 177-197 (2009)
- [c19]Oleg V. Kudinov, Victor L. Selivanov: A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. CiE 2009: 290-299
- [c18]Oleg V. Kudinov, Victor L. Selivanov: Definability in the Infix Order on Words. Developments in Language Theory 2009: 454-465
- 2008
- [j19]Victor L. Selivanov: On the Wadge Reducibility of k-Partitions. Electr. Notes Theor. Comput. Sci. 202: 59-71 (2008)
- [j18]Svetlana Selivanova, Victor L. Selivanov: Computing Solutions of Symmetric Hyperbolic Systems of PDE's. Electr. Notes Theor. Comput. Sci. 221: 243-255 (2008)
- [j17]Victor L. Selivanov: On the Difference Hierarchy in Countably Based T0-Spaces. Electr. Notes Theor. Comput. Sci. 221: 257-269 (2008)
- [j16]Victor L. Selivanov, Klaus W. Wagner: Complexity of Topological Properties of Regular omega-Languages. Fundam. Inform. 83(1-2): 197-217 (2008)
- [j15]Victor L. Selivanov: Fine Hierarchy of Regular Aperiodic omega-Languages. Int. J. Found. Comput. Sci. 19(3): 649-675 (2008)
- [j14]Victor L. Selivanov: Wadge Reducibility and Infinite Computations. Mathematics in Computer Science 2(1): 5-36 (2008)
- [j13]Victor L. Selivanov: Fine hierarchies and m-reducibilities in theoretical computer science. Theor. Comput. Sci. 405(1-2): 116-163 (2008)
- [c17]Christian Glaßer, Christian Reitwießner, Victor L. Selivanov: The Shrinking Property for NP and coNP. CiE 2008: 210-220
- [c16]Victor L. Selivanov, Klaus W. Wagner: Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. CiE 2008: 533-543
- [c15]Victor L. Selivanov, Klaus W. Wagner: Complexity of Topological Properties of Regular omega-Languages. Developments in Language Theory 2008: 529-542
- [c14]Christian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS 2008: 337-348
- [i3]Christian Glasser, 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. Electronic Colloquium on Computational Complexity (ECCC) 15(029) (2008)
- 2007
- [j12]Oleg V. Kudinov, Victor L. Selivanov: Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests. J. Log. Comput. 17(6): 1135-1151 (2007)
- [j11]Victor L. Selivanov: Hierarchies of Delta02-measurable k -partitions. Math. Log. Q. 53(4-5): 446-461 (2007)
- [c13]Oleg V. Kudinov, Victor L. Selivanov: Definability in the Homomorphic Quasiorder of Finite Labeled Forests. CiE 2007: 436-445
- [c12]
- [c11]Victor L. Selivanov: Fine Hierarchy of Regular Aperiodic omega -Languages. Developments in Language Theory 2007: 399-410
- [c10]
- [i1]Christian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Electronic Colloquium on Computational Complexity (ECCC) 14(094) (2007)
- 2006
- [j10]Victor L. Selivanov: Towards a descriptive set theory for domain-like structures. Theor. Comput. Sci. 365(3): 258-282 (2006)
- [c9]Oleg V. Kudinov, Victor L. Selivanov: Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. CiE 2006: 289-296
- 2005
- [j9]Victor L. Selivanov: Variations on Wadge Reducibility Extended Abstract. Electr. Notes Theor. Comput. Sci. 120: 159-171 (2005)
- [j8]
- [j7]Victor L. Selivanov, Klaus W. Wagner: A reducibility for the dot-depth hierarchy. Theor. Comput. Sci. 345(2-3): 448-472 (2005)
- [c8]
- 2004
- [c7]Victor L. Selivanov, Klaus W. Wagner: A Reducibility for the Dot-Depth Hierarchy. MFCS 2004: 783-793
- 2003
- [j6]Victor L. Selivanov: Wadge Degrees of [omega]-Languages of Deterministic Turing Machines. ITA 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. ITA 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. Logic 78(1-3): 243-258 (1996)
- 1995
- [j2]
- [c3]
- 1994
- [j1]
- [c2]
1980 – 1989
- 1987
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:16 CEST by the dblp team