Thumbnail
Access Restriction
Subscribed

Author Alon, Noga ♦ Dietzfelbinger, Martin ♦ Miltersen, Peter Bro ♦ Petrank, Erez ♦ Tardos, Gbor
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1999
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Hashing via linear maps ♦ Universal hashing
Abstract Consider the set H ,$ and consider a random linear mapping of $\textit{D}$ to a smaller vector space $\textit{R}.$ If the cardinality of $\textit{S}$ is larger than $\textit{c}ε|\textit{R}|log|\textit{R}|,$ then with probability 1 - ε, the image of $\textit{S}$ will cover all elements in the range.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1999-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 46
Issue Number 5
Page Count 17
Starting Page 667
Ending Page 683


Open content in new tab

   Open content in new tab
Source: ACM Digital Library