37 citations · 38 across the 2 of their papers we have counts for
2 papers
cs.DS2004★ 1 cited
Efficient Hashing with Lookups in two Memory Accesses
Rina Panigrahy
The study of hashing is closely related to the analysis of balls and bins. It is well-known that instead of using a single hash function if we randomly hash a ball into two bins an…
cs.CG2004★ 37 cited
Minimum Enclosing Polytope in High Dimensions
Rina Panigrahy
We study the problem of covering a given set of points in a high, -dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that…