Dyn-FO: A Parallel, Dynamic Complexity Class
Bounded Arity Datalog(≠) Queries on Graphs
Relaxing the Uniformity and Independence Assumptions Using the Concept of Fractal Dimension
Query Languages for Bags and Aggregate Functions
Finitely Representable Databases
A Query Language for NC
The Complexity of the Evaluation of Complex Algebra Expressions
Relative Serializability: An Approach for Relaxing the Atomicity of Transactions
Can Datalog Be Approximated?