Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Relational queries over interpreted structures
Journal of the ACM (JACM)
Logics capturing local properties
ACM Transactions on Computational Logic (TOCL)
Logics with aggregate operators
Journal of the ACM (JACM)
Lower bounds for invariant queries in logics with counting
Theoretical Computer Science - Complexity and logic
A Framework for the Investigation of Aggregate Functions in Database Queries
ICDT '99 Proceedings of the 7th International Conference on Database Theory
ICDT '01 Proceedings of the 8th International Conference on Database Theory
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Counting and Locality over Finite Structures: A Survey
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Logics Capturing Local Properties
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science - Database theory
Approximate pattern matching and transitive closure logics
Theoretical Computer Science
Approximate Pattern Matching is Expressible in Transitive Closure Logic
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The complexity of planarity testing
Information and Computation
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Arithmetic, first-order logic, and counting quantifiers
ACM Transactions on Computational Logic (TOCL)
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Locality of Queries and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
One-input-face MPCVP is hard for l, but in LogDCFL
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Solutions and query rewriting in data exchange
Information and Computation
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Hi-index | 0.00 |