Construct · 1 fields · 1 citations

perfect 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

a two-level hashing scheme that stores a static set with no collisions, giving constant worst-case lookup time in linear space.

In randomized algorithms, perfect hashing refers to a two-level hashing scheme that stores a static set with no collisions, giving constant worst-case lookup time in linear space. This meaning comes from Fredman (1984) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

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

See how perfect 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

constant2 fields · 2 citationsjingle · one word, two constructs static4 fields · 4 citationsjingle · one word, four constructs

References

Fredman, M. L., Komlós, J., & Szemerédi, E. (1984). Storing a Sparse Table with 0 (1) Worst Case Access Time. Journal of the ACM, 31(3), 538-544. https://doi.org/10.1145/828.1884

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