Machine models and simulations
Handbook of theoretical computer science (vol. A)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Local Properties of Query Languages
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
NC-Algorithms for Graphs with Small Treewidth
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Logics with Aggregate Operators
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Parameterized Complexity
| Hi-index | 0.00 |
We prove an existential version of Gaifman's locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures.