<--- Back to Details
First PageDocument Content
Information retrieval / Information science / Hashing / Search algorithms / Universal hashing / Hash table / Linear probing / Hash function / Bloom filter / Cuckoo hashing / Randomness extractor / Cryptographic hash function
Date: 2007-11-16 13:42:30
Information retrieval
Information science
Hashing
Search algorithms
Universal hashing
Hash table
Linear probing
Hash function
Bloom filter
Cuckoo hashing
Randomness extractor
Cryptographic hash function

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Add to Reading List

Source URL: www.eecs.harvard.edu

Download Document from Source Website

File Size: 247,55 KB

Share Document on Facebook

Similar Documents

MinCounter: An Efficient Cuckoo Hashing Scheme for Cloud Storage Systems Yuanyuan Sun Yu Hua Dan Feng

MinCounter: An Efficient Cuckoo Hashing Scheme for Cloud Storage Systems Yuanyuan Sun Yu Hua Dan Feng

DocID: 1tLMg - View Document

History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡  Udi Wieder§

History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡ Udi Wieder§

DocID: 1t8LN - View Document

History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡  Udi Wieder§

History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡ Udi Wieder§

DocID: 1rysW - View Document

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

DocID: 1r5sy - View Document

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

DocID: 1qUBE - View Document