Computer Science Symposium in Russia
ISSN:
1432-4350 (Print)
1433-0490 (Online)
In this topical collection (10 articles)
-
OriginalPaper
Cascade Heap: Towards Time-Optimal Extractions
Maxim Babenko, Ignat Kolesnichenko, Ivan Smirnov Pages 637-646 -
OriginalPaper
An Adequacy Theorem for Dependent Type Theory
Thierry Coquand, Simon Huber Pages 647-665 -
OriginalPaper
Green’s Relations in Deterministic Finite Automata
Lukas Fleischer, Manfred Kufleitner Pages 666-687 -
OriginalPaper
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)
Viliam Geffert Pages 688-714 -
OriginalPaper
Generic Results for Concatenation Hierarchies
Thomas Place, Marc Zeitoun Pages 849-901 -
OriginalPaper
The Descriptive Complexity of Subgraph Isomorphism Without Numerics
Oleg Verbitsky, Maksim Zhukovskii Pages 902-921
Continue reading...
To view the rest of this content please follow the download PDF link above.