 | 2010 |
|---|
| 43 |       | Victor L. Selivanov:
On the Wadge reducibility of k-partitions.
J. Log. Algebr. Program. 79(1): 92-102 (2010) |
| 2009 |
|---|
| 42 | | Oleg V. Kudinov,
Victor L. Selivanov:
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.
CiE 2009: 290-299 |
| 41 | | Oleg V. Kudinov,
Victor L. Selivanov:
Definability in the Infix Order on Words.
Developments in Language Theory 2009: 454-465 |
| 40 | | 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) |
| 39 | | Victor L. Selivanov:
Hierarchies and reducibilities on regular languages related to modulo counting.
ITA 43(1): 95-132 (2009) |
| 38 | | Victor L. Selivanov:
Undecidability in Some Structures Related to Computation Theory.
J. Log. Comput. 19(1): 177-197 (2009) |
| 2008 |
|---|
| 37 | | Christian Glaßer,
Christian Reitwießner,
Victor L. Selivanov:
The Shrinking Property for NP and coNP.
CiE 2008: 210-220 |
| 36 | | Victor L. Selivanov,
Klaus W. Wagner:
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.
CiE 2008: 533-543 |
| 35 | | Victor L. Selivanov,
Klaus W. Wagner:
Complexity of Topological Properties of Regular omega-Languages.
Developments in Language Theory 2008: 529-542 |
| 34 | | Christian Glasser,
Heinz Schmitz,
Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
STACS 2008: 337-348 |
| 33 | | Christian Glasser,
Heinz Schmitz,
Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
CoRR abs/0802.2868: (2008) |
| 32 | | Victor L. Selivanov:
On the Wadge Reducibility of k-Partitions.
Electr. Notes Theor. Comput. Sci. 202: 59-71 (2008) |
| 31 | | Svetlana Selivanova,
Victor L. Selivanov:
Computing Solutions of Symmetric Hyperbolic Systems of PDE's.
Electr. Notes Theor. Comput. Sci. 221: 243-255 (2008) |
| 30 | | Victor L. Selivanov:
On the Difference Hierarchy in Countably Based T0-Spaces.
Electr. Notes Theor. Comput. Sci. 221: 257-269 (2008) |
| 29 | | 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) |
| 28 | | Victor L. Selivanov,
Klaus W. Wagner:
Complexity of Topological Properties of Regular omega-Languages.
Fundam. Inform. 83(1-2): 197-217 (2008) |
| 27 | | Victor L. Selivanov:
Fine Hierarchy of Regular Aperiodic omega-Languages.
Int. J. Found. Comput. Sci. 19(3): 649-675 (2008) |
| 26 | | Victor L. Selivanov:
Fine hierarchies and m-reducibilities in theoretical computer science.
Theor. Comput. Sci. 405(1-2): 116-163 (2008) |
| 2007 |
|---|
| 25 | | Oleg V. Kudinov,
Victor L. Selivanov:
Definability in the Homomorphic Quasiorder of Finite Labeled Forests.
CiE 2007: 436-445 |
| 24 | | Victor L. Selivanov:
A Useful Undecidable Theory.
CiE 2007: 685-694 |
| 23 | | Victor L. Selivanov:
Fine Hierarchy of Regular Aperiodic omega -Languages.
Developments in Language Theory 2007: 399-410 |
| 22 | | 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) |
| 21 | | Oleg V. Kudinov,
Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests.
J. Log. Comput. 17(6): 1135-1151 (2007) |
| 20 | | Victor L. Selivanov:
Hierarchies of Delta02-measurable k -partitions.
Math. Log. Q. 53(4-5): 446-461 (2007) |
| 2006 |
|---|
| 19 | | Oleg V. Kudinov,
Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.
CiE 2006: 289-296 |
| 18 | | Victor L. Selivanov:
Towards a descriptive set theory for domain-like structures.
Theor. Comput. Sci. 365(3): 258-282 (2006) |
| 2005 |
|---|
| 17 | | Victor L. Selivanov:
Some Reducibilities on Regular Sets.
CiE 2005: 430-439 |
| 16 | | Victor L. Selivanov:
Variations on Wadge Reducibility Extended Abstract.
Electr. Notes Theor. Comput. Sci. 120: 159-171 (2005) |
| 15 | | Victor L. Selivanov:
Hierarchies in phi-spaces and applications.
Math. Log. Q. 51(1): 45-61 (2005) |
| 14 | | Victor L. Selivanov,
Klaus W. Wagner:
A reducibility for the dot-depth hierarchy.
Theor. Comput. Sci. 345(2-3): 448-472 (2005) |
| 2004 |
|---|
| 13 | | Victor L. Selivanov,
Klaus W. Wagner:
A Reducibility for the Dot-Depth Hierarchy.
MFCS 2004: 783-793 |
| 2003 |
|---|
| 12 | | Victor L. Selivanov:
Wadge Degrees of omega-Languages of Deterministic Turing Machines.
STACS 2003: 97-108 |
| 11 | | Victor L. Selivanov:
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines.
ITA 37(1): 67-83 (2003) |
| 2002 |
|---|
| 10 | | Victor L. Selivanov:
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies.
ITA 36(1): 29-42 (2002) |
| 2001 |
|---|
| 9 | | Victor L. Selivanov:
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.
FCT 2001: 323-334 |
| 8 | | Victor L. Selivanov:
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages.
STACS 2001: 539-550 |
| 1998 |
|---|
| 7 | | Victor L. Selivanov:
Fine Hierarchy of Regular Omega-Languages.
Theor. Comput. Sci. 191(1-2): 37-59 (1998) |
| 1996 |
|---|
| 6 |  | Victor L. Selivanov:
On Recursively Enumerable Structures.
Ann. Pure Appl. Logic 78(1-3): 243-258 (1996) |
| 1995 |
|---|
| 5 | | Victor L. Selivanov:
Fine Hierarchy of Regular omega-Languages.
TAPSOFT 1995: 277-287 |
| 4 | | Victor L. Selivanov:
Fine Hierarchies and Boolean Terms.
J. Symb. Log. 60(1): 289-317 (1995) |
| 1994 |
|---|
| 3 | | Victor L. Selivanov:
Two Refinements of the Polynomial Hierarcht.
STACS 1994: 439-448 |
| 2 | | Victor L. Selivanov:
Recursiveness of omega-Operations.
Math. Log. Q. 40: 204-206 (1994) |
| 1987 |
|---|
| 1 | | Victor L. Selivanov:
Index-Sets of Factor-Objects of the Post Numbering.
FCT 1987: 396-400 |
