Back to Results
First PageMeta Content
Information retrieval / Search algorithms / Information science / Hashing / Cryptographic hash functions / Error detection and correction / Hash function / Hash table / Universal hashing / Locality-sensitive hashing


Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define
Add to Reading List

Document Date: 2016-03-06 16:06:05


Open Document

File Size: 55,75 KB

Share Result on Facebook
UPDATE