Parameterized complexity for the database theorist
ACM SIGMOD Record
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Machine-based methods in parameterized complexity theory
Theoretical Computer Science
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science - Implementation and application of automata
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Conjunctive query evaluation by search-tree revisited
Theoretical Computer Science
Efficient core computation in data exchange
Journal of the ACM (JACM)
Parameterized Complexity and Logic
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Modeling and querying probabilistic XML data
ACM SIGMOD Record
A tractability result for reasoning with incomplete first-order knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database theory: query languages
Algorithms and theory of computation handbook
Generic expression hardness results for primitive positive formula comparison
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Extension Preservation Theorems on Classes of Acyclic Finite Structures
SIAM Journal on Computing
ICDT'07 Proceedings of the 11th international conference on Database Theory
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
First-Order queries over one unary function
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Conjunctive query evaluation by search tree revisited
ICDT'05 Proceedings of the 10th international conference on Database Theory
Tree automata and XPath on compressed trees
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Some characterizations of γ and β-acyclicity of hypergraphs
Information Processing Letters
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Database Size Estimation by Query Performance -- A Complexity Aspect
UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
Generic expression hardness results for primitive positive formula comparison
Information and Computation
Enumerating with constant delay the answers to a query
Proceedings of the 16th International Conference on Database Theory
Enumeration of first-order queries on classes of structures with bounded expansion
Proceedings of the 32nd symposium on Principles of database systems
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |