Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ICALP
1994
Springer

favoriteEmaildiscussreport

139views Programming Languages» more ICALP 1994»

Simple Fast Parallel Hashing

13 years 8 months ago

Simple Fast Parallel Hashing

Download theory.stanford.edu

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:

Joseph Gil, Yossi Matias

Real-time Traffic

Hash Table | ICALP 1994 | Linear Size Data | Parity Lower Bound | Programming Languages |

claim paper

Related Content

» Bucket Hashing and its Application to Fast Message Authentication

» Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class The Case of Large Universe...

» Attacks on Fast Double Block Length Hash Functions

» Accelerating the Whirlpool Hash Function Using Parallel Table Lookup and Fast Cyclical Per...

» Data Structure Optimization of ASPATH in BGP

» Optimized Implementation of Extendible Hashing to Support Large File System Directory

» A fast realtime memory authentication protocol

» Pattern matching in LempelZiv compressed strings fast simple and deterministic

» A Simple Fault Tolerant Distributed Hash Table

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	ICALP
Authors	Joseph Gil, Yossi Matias

Comments (0)