Works matching IS 14324350 AND DT 2017 AND VI 61 AND IP 2
Results: 17
Processing Succinct Matrices and Vectors.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 322, doi. 10.1007/s00224-015-9666-9
- By:
- Publication type:
- Article
Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 581, doi. 10.1007/s00224-016-9683-3
- By:
- Publication type:
- Article
Equations Over Free Inverse Monoids with Idempotent Variables.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 494, doi. 10.1007/s00224-016-9693-1
- By:
- Publication type:
- Article
Some Properties of Antistochastic Strings.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 521, doi. 10.1007/s00224-016-9695-z
- By:
- Publication type:
- Article
Bounds in Ontology-Based Data Access via Circuit Complexity.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 464, doi. 10.1007/s00224-016-9707-z
- By:
- Publication type:
- Article
The Query Complexity of Witness Finding.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 305, doi. 10.1007/s00224-016-9708-y
- By:
- Publication type:
- Article
The Half-Levels of the FO Alternation Hierarchy.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 352, doi. 10.1007/s00224-016-9712-2
- By:
- Publication type:
- Article
Separation Logic with One Quantified Variable.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 371, doi. 10.1007/s00224-016-9713-1
- By:
- Publication type:
- Article
On Compiling Structured CNFs to OBDDs.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 637, doi. 10.1007/s00224-016-9715-z
- By:
- Publication type:
- Article
Satisfiability of ECTL with Local Tree Constraints.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 689, doi. 10.1007/s00224-016-9724-y
- By:
- Publication type:
- Article
On the Satisfiability of Quantum Circuits of Small Treewidth.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 656, doi. 10.1007/s00224-016-9727-8
- By:
- Publication type:
- Article
Space Saving by Dynamic Algebraization Based on Tree-Depth.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 283, doi. 10.1007/s00224-017-9751-3
- By:
- Publication type:
- Article
Preface.
- Published in:
- 2017
- By:
- Publication type:
- Editorial
Optimizing Binary Heaps.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 606, doi. 10.1007/s00224-017-9760-2
- By:
- Publication type:
- Article
Rewriting Higher-Order Stack Trees.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 536, doi. 10.1007/s00224-017-9769-6
- By:
- Publication type:
- Article
Guest Editorial: Computer Science Symposium in Russia.
- Published in:
- 2017
- By:
- Publication type:
- Editorial
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 2, p. 263, doi. 10.1007/s00224-015-9663-z
- By:
- Publication type:
- Article