Simple Fast Parallel Hashing

A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of n keys in O(lglgn) parallel time with high probability, using n processors on a weak version of a crcw pram. Our algorithm uses a novel approach of hashing by \oblivious execution" based on probabilistic analysis to circumvent the parity lower bound barrier at the near-logarithmic time level. The algorithm is simple and is sketched by the following:

• Type: Conference
• Year: 1994
• Where: ICALP
• Authors: Joseph Gil, Yossi Matias
• Keywords: Hash Table, ICALP 1994, Linear Size Data, Parity Lower Bound, Programming Languages