<--- Back to Details
First PageDocument Content
Hashing / Data management / Bloom filter / Hash table / Arrays / Hash function / Trie / Lookup table / Throughput / Computing / Search algorithms / Computer programming
Date: 2011-05-14 12:14:37
Hashing
Data management
Bloom filter
Hash table
Arrays
Hash function
Trie
Lookup table
Throughput
Computing
Search algorithms
Computer programming

Add to Reading List

Source URL: static.usenix.org

Download Document from Source Website

File Size: 288,51 KB

Share Document on Facebook

Similar Documents

Cryptography / Block ciphers / Data Encryption Standard / Finite fields / Feistel cipher / ARIA / Advanced Encryption Standard / Differential cryptanalysis / ICE / Interpolation attack / Stream cipher / XTR

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

DocID: 1xUN2 - View Document

Information retrieval / Hashing / Information science / Search algorithms / Locality-sensitive hashing / Hash function / Hash table / Cryptographic hash function / Hash list / MinHash / RabinKarp algorithm

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

DocID: 1xTR9 - View Document

Computing / Software engineering / Computer programming / Object-oriented programming languages / Abstract data types / Object / Java / Iterator / Scala / Abstraction / Java collections framework / Object-oriented programming

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

DocID: 1xTdH - View Document