<--- Back to Details
First PageDocument Content
Applied mathematics / Hashing / Randomized algorithm / Method of conditional probabilities / Universal hashing / Chernoff bound / Tabulation hashing / Random walk / Algorithm / Search algorithms / Mathematics / Theoretical computer science
Date: 2014-12-17 20:04:41
Applied mathematics
Hashing
Randomized algorithm
Method of conditional probabilities
Universal hashing
Chernoff bound
Tabulation hashing
Random walk
Algorithm
Search algorithms
Mathematics
Theoretical computer science

Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04

Add to Reading List

Source URL: cs.yale.edu

Download Document from Source Website

File Size: 1,75 MB

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