47 citations · 93 across the 6 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.DS2006
Linear Probing with Constant Independence
Anna Pagh, Rasmus Pagh, Milan Ruzic
Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations sinc…
cs.AI2006
A Generic Global Constraint based on MDDs
Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the supporting data structure for a generic global constraint. We give an algorithm for maintaining generaliz…