Volume 63, Issue 4

Search all Theory of Computing Systems articles

May 2019

Computer Science Symposium in Russia

Issue Editor:

Pascal Weil

10 articles in this issue

Foreword
Pascal Weil
EditorialNotes 04 July 2018 Pages: 635 - 636
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
Cascade Heap: Towards Time-Optimal Extractions
Maxim Babenko
Ignat Kolesnichenko
Ivan Smirnov
OriginalPaper 18 May 2018 Pages: 637 - 646
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
An Adequacy Theorem for Dependent Type Theory
Thierry Coquand
Simon Huber
OriginalPaper Open access 28 July 2018 Pages: 647 - 665
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
Green’s Relations in Deterministic Finite Automata
Lukas Fleischer
Manfred Kufleitner
OriginalPaper 12 February 2018 Pages: 666 - 687
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)
Viliam Geffert
OriginalPaper 09 February 2018 Pages: 688 - 714
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
Verification of Quantum Computation: An Overview of Existing Approaches
Alexandru Gheorghiu
Theodoros Kapourniotis
Elham Kashefi
OriginalPaper Open access 06 July 2018 Pages: 715 - 808
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC⁰
Alexei Miasnikov
Svetla Vassileva
Armin Weiß
OriginalPaper 12 February 2018 Pages: 809 - 832
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
On Algorithmic Statistics for Space-bounded Algorithms
Alexey Milovanov
OriginalPaper 06 February 2018 Pages: 833 - 848
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
Generic Results for Concatenation Hierarchies
Thomas Place
Marc Zeitoun
OriginalPaper 09 May 2018 Pages: 849 - 901
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)
The Descriptive Complexity of Subgraph Isomorphism Without Numerics
Oleg Verbitsky
Maksim Zhukovskii
OriginalPaper 30 April 2018 Pages: 902 - 921
Part of 2 collections:

Computer Science Symposium in Russia

Computer Science Symposium in Russia (CSR 2017)

Volume 63, Issue 4

Search

Navigation