default search action
Theory of Computing Systems, Volume 61
Volume 61, Number 1, July 2017
- Marcelo Arenas:
Foreword: Special Issue on Database Theory. 1 - Paraschos Koutris, Tova Milo, Sudeepa Roy, Dan Suciu
:
Answering Conjunctive Queries with Inequalities. 2-30 - Juan L. Reutter
Regular Queries on Graph Databases. 31-83 - Martin Schuster, Thomas Schwentick:
Games for Active XML Revisited. 84-155 - Nadime Francis:
Asymptotic Determinacy of Path Queries Using Union-of-Paths Views. 156-190 - Leopoldo E. Bertossi
From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back. 191-232 - Bas Ketsman
Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data. 233-260
Volume 61, Number 2, August 2017
- Andrei A. Bulatov, Edward A. Hirsch, Jean-Éric Pin:
Preface. 261-262 - Konrad W. Schwerdtfeger:
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. 263-282 - Martin Fürer
Space Saving by Dynamic Algebraization Based on Tree-Depth. 283-304 - Akinori Kawachi, Benjamin Rossman, Osamu Watanabe
The Query Complexity of Witness Finding. 305-321 - Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. 322-351 - Lukas Fleischer, Manfred Kufleitner
The Half-Levels of the FO2 Alternation Hierarchy. 352-370 - Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling
Separation Logic with One Quantified Variable. 371-461 - Lev D. Beklemishev:
Guest Editorial: Computer Science Symposium in Russia. 462-463 - Vladimir V. Podolskii
Bounds in Ontology-Based Data Access via Circuit Complexity. 464-493 - Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations Over Free Inverse Monoids with Idempotent Variables. 494-520 - Alexey Milovanov:
Some Properties of Antistochastic Strings. 521-535 - Vincent Penelle:
Rewriting Higher-Order Stack Trees. 536-580 - Mikhail Barash, Alexander Okhotin
Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts. 581-605 - Stefan Edelkamp
Optimizing Binary Heaps. 606-636 - Simone Bova, Friedrich Slivovsky
On Compiling Structured CNFs to OBDDs. 637-655 - Mateus de Oliveira Oliveira
On the Satisfiability of Quantum Circuits of Small Treewidth. 656-688 - Claudia Carapelle
Satisfiability of ECTL∗ with Local Tree Constraints. 689-720
Volume 61, Number 3, October 2017
- Hadas Shachnai, Meirav Zehavi
Parameterized Algorithms for Graph Partitioning Problems. 721-738 - George B. Mertzios, Mordechai Shalom
Online Regenerator Placement. 739-754 - Igor Razgon:
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth. 755-776 - Julien Baste
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. 777-794 - Fedor V. Fomin
Parameterized Complexity of Secluded Connectivity Problems. 795-819 - Lakshmi Anantharamu, Bogdan S. Chlebus
Adversarial Multiple Access Channels with Individual Injection Rates. 820-850 - Hubie Chen, Moritz Müller:
The Parameterized Space Complexity of Embedding Along a Path. 851-870 - Flávio Keidi Miyazawa
A PTAS for the Geometric Connected Facility Location Problem. 871-892 - Jia Jie Liu, Shun-Chieh Chang, Chiou-Jiun Lin:
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs. 893-906 - Eleni C. Akrida
The Complexity of Optimal Design of Temporally Connected Graphs. 907-944
Volume 61, Number 4, November 2017
- Ernst W. Mayr:
Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015). 945-947 - Sayan Bhattacharya, Wolfgang Dvorák
Welfare Maximization with Friends-of-Friends Network Externalities. 948-986 - Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan:
Minimum-Cost Flows in Unit-Capacity Networks. 987-1010 - Telikepalli Kavitha:
New Pairwise Spanners. 1011-1036 - Jakub Lacki, Piotr Sankowski:
Optimal Decremental Connectivity in Planar Graphs. 1037-1053 - Jacob Holm
Dynamic Planar Embeddings of Dynamic Graphs. 1054-1083 - Pascal Schweitzer
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. 1084-1127 - Joan Boyar
The Advice Complexity of a Class of Hard Online Problems. 1128-1177 - Martin Delacourt
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata. 1178-1213 - Mathieu Hoyrup
On the Information Carried by Programs About the Objects they Compute. 1214-1236 - Neeraj Kayal, Chandan Saha:
Multi-k-ic Depth Three Circuit Lower Bound. 1237-1251 - Andrew Lewis-Pye, Wolfgang Merkle:
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015). 1252-1253 - Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan
Semiautomatic Structures. 1254-1287 - Ludwig Staiger
Exact Constructive and Computable Dimensions. 1288-1314 - Bruno Bauwens
Conditional Probabilities and van Lambalgen's Theorem Revisited. 1315-1336 - Tom F. Sterkenburg
A Generalized Characterization of Algorithmic Probability. 1337-1352 - Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
Layerwise Computability and Image Randomness. 1353-1375 - Vasco Brattka
On the Uniform Computational Content of Computability Theory. 1376-1426 - Bjørn Kjos-Hanssen
On the Complexity of Automatic Complexity. 1427-1439 - Nikolai K. Vereshchagin
Short lists with short programs from programs of functions and strings. 1440-1450
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: