A Linear Time Algorithm for Finding Minimal Perfect Hash Functions

DOI10.1093/comjnl/36.6.579zbMath0786.68042OpenAlexW2135619017MaRDI QIDQ3140119

Bohdan S. Majewski, Zbigniew J. Czech

Publication date: 6 May 1994

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/36.6.579

zbMATH Keywords

pseudorandom functionsperfect hash functionsrandom bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of data (68P99)

Related Items (2)

Perfect hashing ⋮ Vowel-consonant addressing mode on hashing for English letter-oriented keys

This page was built for publication: A Linear Time Algorithm for Finding Minimal Perfect Hash Functions