A Small Approximately Min-Wise Independent Family of Hash Functions
From MaRDI portal
Publication:2709793
DOI10.1006/jagm.2000.1131zbMath0971.68204OpenAlexW1993091968MaRDI QIDQ2709793
Publication date: 17 April 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1131
Geometric probability and stochastic geometry (60D05) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)
Related Items
Binary vectors for fast distance and similarity estimation ⋮ A simple proof that finding a maximal independent set in a graph is in NC ⋮ Spatially-decaying aggregation over a network ⋮ Interval selection in the streaming model ⋮ A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations ⋮ Near-optimal quantum algorithms for string problems ⋮ Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs ⋮ Fingerprints for highly similar streams ⋮ One forward-secure signature scheme using bilinear maps and its applications ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Disjoint bases in a polymatroid ⋮ Unnamed Item ⋮ Construction of Yet Another Forward Secure Signature Scheme Using Bilinear Maps ⋮ Efficient sampling of non-strict turnstile data streams
This page was built for publication: A Small Approximately Min-Wise Independent Family of Hash Functions
