Floris Geerts
Professor of Computer Science · University of Antwerp
My research connects database theory, graph learning, and quantum computing, with a focus on expressive power, generalization, and efficient computation.
Publications
2026
-
Democratizing AI-enhanced Quantum Error Correction
-
Unifying and Extending Strong Simulation of Quantum Circuits
-
AutoGrable: What Is a Good Graph for a Table?
-
QEC Lake: Data Lake for AI-enhanced Quantum Error Correction
-
Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
-
The Boolean Power of ReLU
-
Grables: Tabular learning beyond independent rows
-
Which Algorithms Can Graph Neural Networks Learn?
-
Latent Bridges for Multi-Table Question Answering
-
A Logical View of GNN-Style Computation and the Role of Activation Functions
2025
-
Towards Bridging Generalization and Expressivity of Graph Neural Networks
-
Covered Forest: Fine-grained generalization analysis of graph neural networks
-
Data Management in the Noisy Intermediate-Scale Quantum Era
-
DeepGraphLog for Layered Neurosymbolic AI
-
From Features to Structure: Task-Aware Graph Construction for Relational and Tabular Learning with GNNs
2024
2023
-
The Power of Graph Learning
-
The Expressive Power of Graph Learning
-
A Query Language Perspective on Graph Learning
-
WL meet VC
2022
2021
2020
2019
2018
-
On the Expressive Power of Query Languages for Matrices
-
Revisiting Conditional Functional Dependency Discovery: Splitting the "C" from the "FD"
-
A General Framework for Anytime Approximation in Probabilistic Databases
-
On the expressive power of linear algebra on graphs
-
Editorial: Special Issue on Improving the Veracity and Value of Big Data
-
Topological elementary equivalence of regular semi-algebraic sets in three-dimensional space
-
Explaining Repaired Data with CFDs
-
Bounded Query Rewriting Using Views
-
Constraint Databases
-
Constraint Query Languages
2017
-
Cleaning Data with Forbidden Itemsets
-
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017
-
On the expressive power of query languages for matrices
-
First-order under-approximations of consistent query answers
-
Database Theory Column Report on PODS 2017
2016
2015
-
Space-Bounded Query Approximation
-
Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23-27, 2015
-
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015
-
Querying Big Data by Accessing Small Data
-
First-Order Under-Approximations of Consistent Query Answers
-
Cell-based Causality for Data Repairs
-
On recommendation problems beyond points of interest
2014
-
Interactive correlation clustering
-
Mapping and cleaning
-
On scale independence for querying big data
-
An Overview of the Llunatic System
-
Detecting Errors in Numeric Attributes
-
On the data complexity of relative information completeness
-
Conflict resolution with data currency and consistency
-
That's All Folks! LLUNATIC Goes Open Source
2013
-
Data Quality Problems beyond Consistency and Deduplication
-
Looking at the World Thru Colored Glasses
-
Inferring data currency and consistency for conflict resolution
-
Algebraic structures for capturing the provenance of SPARQL queries
-
Generating, Sampling and Counting Subclasses of Regular Tree Languages
-
Making Queries Tractable on Big Data with Preprocessing
-
The LLUNATIC Data-Cleaning Framework
-
On the Complexity of Package Recommendation Problems
2012
2011
-
Generating, sampling and counting subclasses of regular tree languages
-
Determining the currency of data
-
Uniform Dependency Language for Improving Data Quality
-
Relational completeness of query languages for annotated databases
-
Foreword
-
Discovering Conditional Functional Dependencies
2010
2009
-
Conditional Dependencies: A Principled Approach to Improving Data Quality
-
Database Programming Languages - DBPL 2009, 12th International Symposium, Lyon, France, August 24, 2009. Proceedings
-
Discovering Conditional Functional Dependencies
-
Relative information completeness
-
Constraint Databases
-
Constraint Query Languages
2008
-
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
-
Complexity and composition of synthesized web services
-
XPath satisfiability in the presence of DTDs
-
Semandaq: a data quality system based on conditional functional dependencies
-
A revival of integrity constraints for data cleaning
-
First-order complete and computationally complete query languages for spatio-temporal databases
-
Conditional functional dependencies for capturing data inconsistencies
-
Expressiveness and complexity of XML publishing transducers
2007
-
Relational Completeness of Query Languages for Annotated Databases
-
Conditional Functional Dependencies for Data Cleaning
-
Rewriting Regular XPath Queries on XML Views
-
Expressiveness and complexity of xml publishing transducers
-
Improving Data Quality: Consistency and Accuracy
-
Real Algebraic Geometry and Constraint Databases
2006
-
Annotation propagation revisited for key preserving views
-
iMONDRIAN: A Visual Tool to Annotate and Query Scientific Databases
-
On-line maintenance of simplified weighted graphs for efficient distance queries
-
MONDRIAN: Annotating and Querying Databases through Colors and Blocks
-
SMOQE: A System for Providing Secure Access to XML
-
HaploRec: efficient and accurate large-scale reconstruction of haplotypes
-
On-line topological simplification of weighted graphs
-
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases
2005
-
Satisfiability of XPath Queries with Sibling Axes
-
XPath satisfiability in the presence of DTDs
-
N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets
-
First-order Complete and Computationally Complete Query Languages for Spatio-Temporal Databases
-
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
-
Tight upper bounds on the number of candidate patterns
2004
-
Moving Objects and Their Equations of Motion
-
Tiling Databases
-
A Markov Chain Approach to Reconstruction of Long Haplotypes
-
Relational link-based ranking
-
Frequent Knot Discovery
-
Topological formulation of termination properties of iterates of functions
2003
-
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
-
What You Store is What You Get
-
Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets
-
Expressing the box cone radius in the relational calculus with real polynomial constraints
2001
-
Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension
-
A Theory of Spatio-Temporal Database Queries
-
A Tight Upper Bound on the Number of Candidate Patterns
-
Expressing the cone radius in the relational calculus with real polynomial constraints
-
A Tight Upper Bound on the Number of Candidate Patterns