Query languages for bags: expressive power and complexity
ACM SIGACT News
Querying spatial databases via topological invariants
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Adding for-loops to first-order logic
Information and Computation
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Adding For-Loops to First-Order Logic
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Computability by Sequences of Queries
Fundamenta Informaticae
Choiceless Polynomial Time, Counting and the Cai--Fürer--Immerman Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Computability by Sequences of Queries
Fundamenta Informaticae
Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines
Fundamenta Informaticae
Hi-index | 0.00 |