Skip to search formSkip to main contentSkip to account menu

K-independent hashing

Known as: K-universal hashing 
In computer science, a family of hash functions is said to be -independent or -universal if selecting a function at random from the family guarantees… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
ByteChernoff boundComputer scienceDouble hashing

Broader (1)

Error detection and correction

Search for papers about K-independent hashing

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)