Volume 61, Issue 2

Search all Theory of Computing Systems articles

August 2017

Computer Science Symposium in Russia

Issue Editors:

Andrei A. Bulatov,
Edward A. Hirsch,
Jean-Éric Pin,
Lev D. Beklemishev

17 articles in this issue

Preface
Andrei A. Bulatov
Edward A. Hirsch
Jean-Éric Pin
EditorialNotes 28 February 2017 Pages: 261 - 262
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
Konrad W. Schwerdtfeger
OriginalPaper 28 October 2015 Pages: 263 - 282
Space Saving by Dynamic Algebraization Based on Tree-Depth
Martin Fürer
Huiwen Yu
OriginalPaper 09 March 2017 Pages: 283 - 304
The Query Complexity of Witness Finding
Akinori Kawachi
Benjamin Rossman
Osamu Watanabe
OriginalPaper 19 September 2016 Pages: 305 - 321
Processing Succinct Matrices and Vectors
Markus Lohrey
Manfred Schmidt-Schauß
OriginalPaper 26 December 2015 Pages: 322 - 351
The Half-Levels of the FO₂ Alternation Hierarchy
Lukas Fleischer
Manfred Kufleitner
Alexander Lauser
OriginalPaper 01 October 2016 Pages: 352 - 370
Separation Logic with One Quantified Variable
Stéphane Demri
Didier Galmiche
Daniel Méry
OriginalPaper 31 May 2017 Pages: 371 - 461
Guest Editorial: Computer Science Symposium in Russia
Lev Beklemishev
EditorialNotes 09 May 2017 Pages: 462 - 463
Bounds in Ontology-Based Data Access via Circuit Complexity
Vladimir V. Podolskii
OriginalPaper 19 September 2016 Pages: 464 - 493
Equations Over Free Inverse Monoids with Idempotent Variables
Volker Diekert
Florent Martin
Pedro V. Silva
OriginalPaper 21 July 2016 Pages: 494 - 520
Some Properties of Antistochastic Strings
Alexey Milovanov
OriginalPaper 21 June 2016 Pages: 521 - 535
Rewriting Higher-Order Stack Trees
Vincent Penelle
OriginalPaper Open access 02 May 2017 Pages: 536 - 580
Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
Mikhail Barash
Alexander Okhotin
OriginalPaper 06 June 2016 Pages: 581 - 605
Optimizing Binary Heaps
Stefan Edelkamp
Amr Elmasry
Jyrki Katajainen
OriginalPaper 21 April 2017 Pages: 606 - 636
On Compiling Structured CNFs to OBDDs
Simone Bova
Friedrich Slivovsky
OriginalPaper Open access 26 October 2016 Pages: 637 - 655
On the Satisfiability of Quantum Circuits of Small Treewidth
Mateus de Oliveira Oliveira
OriginalPaper 25 November 2016 Pages: 656 - 688
Satisfiability of ECTL^∗ with Local Tree Constraints
Claudia Carapelle
Shiguang Feng
Markus Lohrey
OriginalPaper 11 January 2017 Pages: 689 - 720

Volume 61, Issue 2

Search

Navigation