| 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
(available as arXiv preprint) | 2022-12-09 | Paper |
| On the expressive power of linear algebra on graphs | 2022-07-21 | Paper |
Bounded query rewriting using views
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Capturing missing tuples and missing values
ACM Transactions on Database Systems | 2021-11-25 | Paper |
On the expressive power of linear algebra on graphs
Theory of Computing Systems | 2021-06-24 | Paper |
Correction to: ``On the expressive power of linear algebra on graphs
Theory of Computing Systems | 2021-06-24 | Paper |
On the expressive power of query languages for matrices
(available as arXiv preprint) | 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
Mathematical Logic Quarterly | 2020-05-11 | Paper |
Algebraic Structures for Capturing the Provenance of SPARQL Queries
Journal of the ACM | 2018-08-02 | Paper |
First-order complete and computationally complete query languages for spatio-temporal databases
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
First-order under-approximations of consistent query answers
International Journal of Approximate Reasoning | 2017-03-29 | Paper |
On the complexity of package recommendation problems
SIAM Journal on Computing | 2014-02-04 | Paper |
Generating, sampling and counting subclasses of regular tree languages
Theory of Computing Systems | 2013-08-23 | Paper |
Foundations of data quality management
Synthesis Lectures on Data Management | 2012-08-17 | Paper |
Relational completeness of query languages for annotated databases
Journal of Computer and System Sciences | 2011-05-04 | Paper |
On database query languages for K-relations
Journal of Applied Logic | 2010-06-11 | Paper |
Topological formulation of termination properties of iterates of functions
Information Processing Letters | 2009-07-09 | Paper |
XPath satisfiability in the presence of DTDs
Journal of the ACM | 2008-12-21 | Paper |
Database Programming Languages
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases
SIAM Journal on Computing | 2006-06-01 | Paper |
Constraint Databases
Lecture Notes in Computer Science | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2241916 (Why is no real title available?) | 2005-12-28 | Paper |
| scientific article; zbMATH DE number 2241917 (Why is no real title available?) | 2005-12-28 | Paper |
\(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets
Acta Informatica | 2005-12-14 | Paper |
Discovery Science
Lecture Notes in Computer Science | 2005-08-18 | Paper |
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
Theoretical Computer Science | 2005-06-10 | Paper |
| scientific article; zbMATH DE number 2080410 (Why is no real title available?) | 2004-08-04 | Paper |
Expressing the box cone radius in the relational calculus with real polynomial constraints
Discrete & Computational Geometry | 2004-02-05 | Paper |
| scientific article; zbMATH DE number 1953132 (Why is no real title available?) | 2003-07-25 | Paper |
