Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Selivanov, Victor"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The shrinking property for
NP
and co
NP
Christian Glaßer
,
Christian Reitwießner
,
Victor Selivanov
Theoretical Computer Science
412
(8-10), 2011, pp. 853-864
Efficient algorithms for membership in Boolean hierarchies of regular languages
Christian Glaßer
,
Heinz Schmitz
,
Victor Selivanov
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 337-348
Fine hierarchy of regular aperiodic
\omega
-languages
Victor Selivanov
International Journal of Foundations of Computer Science
19
(3), 2008, pp. 649-675
Fine hierarchies and
m
-reducibilities in theoretical computer science
Victor L. Selivanov
Theoretical Computer Science
405
(1-2), 2008, pp. 116-163
Towards a descriptive set theory for domain-like structures
Victor L. Selivanov
Theoretical Computer Science
365
(3), 2006, pp. 258-282
A reducibility for the dot-depth hierarchy
Victor L. Selivanov
,
Klaus W. Wagner
Theoretical Computer Science
345
(2-3), 2005, pp. 448-472
A reducibility for the dot-depth hierarchy
Victor L. Selivanov
,
Klaus W. Wagner
Lecture Notes in Computer Science
3153
, 2004, pp. 783-793
Wadge degrees of
\omega
-languages of deterministic Turing machines
Victor Selivanov
Lecture Notes in Computer Science
2607
, 2003, pp. 97-108
A logical approach to decidability of hierarchies of regular star-free languages
Victor L. Selivanov
Lecture Notes in Computer Science
2010
, 2001, pp. 539-550
Fine hierarchy of regular
\omega
-languages
Victor Selivanov
Theoretical Computer Science
191
(1-2), 1998, pp. 37-59