47 citations · 93 across the 6 of their papers we have counts for
3 papers · 1 filter
Fast evaluation of union-intersection expressions
Philip Bille, Anna Pagh, Rasmus Pagh
We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This…
Generic Global Constraints based on MDDs
Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
Constraint Programming (CP) has been successfully applied to both constraint satisfaction and constraint optimization problems. A wide variety of specialized global constraints pro…
Perfect Hashing for Data Management Applications
Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani
Perfect hash functions can potentially be used to compress data in connection with a variety of data management tasks. Though there has been considerable work on how to construct g…