activity
20022019
most citedSpatial Aggregation: Data Model and Implementation

8 citations · 21 across the 13 of their papers we have counts for

collaborators

15 papers

cs.DB2019

Online Analytical Processsing on Graph Data

Leticia Gómez, Bart Kuijpers, Alejandro Vaisman

Online Analytical Processing (OLAP) comprises tools and algorithms that allow querying multidimensional databases. It is based on the multidimensional model, where data can be seen…

cs.DB2016★ 2 cited

A Formal Algebra for OLAP

Bart Kuijpers, Alejandro Vaisman

Online Analytical Processing (OLAP) comprises tools and algorithms that allow querying multidimensional databases. It is based on the multidimensional model, where data can be seen…

cs.CC2012

On the intrinsic complexity of elimination problems in effective Algebraic Geometry

Joos Heintz, Bart Kuijpers, Andres Rojas Paredes

The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the…

cs.DS2011

Evaluating geometric queries using few arithmetic operations

Rafael Grimson, Joos Heintz, Bart Kuijpers

Let $\cp:=(P_1,...,P_s)$ be a given family of -variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounde…

cs.DB2011★ 1 cited

The evaluation of geometric queries: constraint databases and quantifier elimination

Marc Giusti, Joos Heintz, Bart Kuijpers

We model the algorithmic task of geometric elimination (e.g., quantifier elimination in the elementary field theories of real and complex numbers) by means of certain constraint da…

cs.CC2011★ 1 cited

Software Engineering and Complexity in Effective Algebraic Geometry

Joos Heintz, Bart Kuijpers, Andres Rojas Paredes

We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a comput…