2 papers
cs.DS2007
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…
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…