Construct · 1 fields · 1 citations

universal hashing: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Randomized algorithms

choosing a hash function at random from a family in which any two keys collide with small probability, giving good expected behavior on any input.

In randomized algorithms, universal hashing refers to choosing a hash function at random from a family in which any two keys collide with small probability, giving good expected behavior on any input. This meaning comes from Carter (1979) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how universal hashing sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

hash2 fields · 3 citationsjingle · one word, two constructs family3 fields · 3 citationsjingle · one word, three constructs function5 fields · 6 citationsjingle · one word, five constructs

References

Carter, J. L., & Wegman, M. N. (1979). Universal classes of hash functions. Journal of Computer and System Sciences, 18(2), 143-154. https://doi.org/10.1016/0022-0000(79)90044-8

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct