A Fast, Minimal Memory, Consistent Hash Algorithm John Lamping, Eric Veach Google Abstract

First Page		Document Content
Date: 2014-06-09 20:16:29 Information retrieval Artificial intelligence Hash table Consistent hashing Hash function Extendible hashing Cuckoo hashing Hashing Search algorithms Information science		A Fast, Minimal Memory, Consistent Hash Algorithm John Lamping, Eric Veach Google Abstract Add to Reading List Source URL: arxiv.org Download Document from Source Website File Size: 369,89 KB Share Document on Facebook

	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
	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
	Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions DocID: 1xTdH - View Document