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

DOI10.1145/195058.195410zbMATH Open1345.68117OpenAlexW2024312599MaRDI QIDQ2817652FDOQ2817652

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)

Cited In (3)

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

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)