Tiny families of functions with random properties: a quality-size trade-off for hashing (preliminary version)

DOI10.1145/195058.195410MaRDI QIDQ2817652zbMATHOpenAlexFDO

Authors Oded Goldreich, A. Wigderson

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195058.195410

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Tiny families of functions with random properties: A quality-size trade-off for hashing
• Dispersing Hash functions
• Publication:4941908
• A small approximately min-wise independent family of hash functions
• On a family of universal hash functions

Cited in

(4)

• More efficient DDH pseudorandom generators
• Dispersing Hash functions
• Lower bounds for sampling algorithms for estimating the average
• Extracting randomness: A survey and new constructions

This page was built for publication: Tiny families of functions with random properties: a quality-size trade-off for hashing (preliminary version)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817652)