K-independent hashing
id:
k-independent-hashing-270-9156317
title:
K-independent hashing
text:
In computer science, a family of hash functions is said to be k-independent, k-wise independent or k-universal if selecting a function at random from the family guarantees that the hash codes of any designated k keys are independent random variables. Such families allow good average case performance in randomized algorithms or data structures, even if the input data is chosen by an adversary. The trade-offs between the degree of independence and the efficiency of evaluating the hash function are
brand slug:
wiki
category slug:
encyclopedia
description:
Family of Hash functions
original url:
https://en.wikipedia.org/wiki/K-independent_hashing
date created:
date modified:
2023-10-25T05:18:21Z
main entity:
{"identifier":"Q6322840","url":"https://www.wikidata.org/entity/Q6322840"}
image:
fields total:
13
integrity:
14