Floris Geerts

Available identifiers

zbMath Open geerts.florisMaRDI QIDQ359885

List of research outcomes

Publication	Date of Publication	Type
When Can Matrix Query Languages Discern Matrices	2023-02-07	Paper
On the expressive power of message-passing neural networks as global feature map transformers	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5091117	2022-07-21	Paper
Bounded Query Rewriting Using Views	2021-11-25	Paper
Capturing Missing Tuples and Missing Values	2021-11-25	Paper
On the expressive power of linear algebra on graphs	2021-06-24	Paper
Correction to: ``On the expressive power of linear algebra on graphs	2021-06-24	Paper
On the Expressive Power of Query Languages for Matrices	2020-08-06	Paper
The expressive power of kth-order invariant graph networks	2020-07-23	Paper
Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space	2020-05-11	Paper
Algebraic Structures for Capturing the Provenance of SPARQL Queries	2018-08-02	Paper
First-order complete and computationally complete query languages for spatio-temporal databases	2017-07-12	Paper
First-order under-approximations of consistent query answers	2017-03-29	Paper
On the Complexity of Package Recommendation Problems	2014-02-04	Paper
Generating, sampling and counting subclasses of regular tree languages	2013-08-23	Paper
Foundations of data quality management	2012-08-17	Paper
Relational completeness of query languages for annotated databases	2011-05-04	Paper
On database query languages for K-relations	2010-06-11	Paper
Topological formulation of termination properties of iterates of functions	2009-07-09	Paper
XPath satisfiability in the presence of DTDs	2008-12-21	Paper
Database Programming Languages	2006-10-20	Paper
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases	2006-06-01	Paper
Constraint Databases	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q5714257	2005-12-28	Paper
https://portal.mardi4nfdi.de/entity/Q5714258	2005-12-28	Paper
\(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets	2005-12-14	Paper
Discovery Science	2005-08-18	Paper
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases	2005-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4473167	2004-08-04	Paper
Expressing the box cone radius in the relational calculus with real polynomial constraints	2004-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q4414535	2003-07-25	Paper

Research outcomes over time

This page was built for person: Floris Geerts