Hashing techniques have long been used to efficiently store and locate data indexed by key. Recently, parallel hashing algorithms have been developed that allow table insertion of many keys in a few parallel steps/The analyses of these algorithms have focused on the expected number of steps required, ignoring the- issue of work complexity. As a result, these algorithms have not been work efficient. In this paper, represent a parallel hashing algorithm that is shown to be work efficient because it performs no more work than its serial counterpart. An analysis of its behavior shows that it performsS=O(logn) expected parallel steps and W - O(n) expected work