A Linear Time Algorithm for Finding Minimal Perfect Hash Functions

DOI10.1093/COMJNL/36.6.579MaRDI QIDQ3140119zbMATH OpenOpenAlexFDO

Authors 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 functionsrandom bipartite graphsperfect hash functions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 370478
• scientific article; zbMATH DE number 1875411
• Experimental and Efficient Algorithms
• An optimal algorithm for generating minimal perfect hash functions
• Minimal perfect hashing in polynomial time

Cited in

(7)

• Graphs, hypergraphs and hashing
• Experimental and Efficient Algorithms
• An optimal algorithm for generating minimal perfect hash functions
• Vowel-consonant addressing mode on hashing for English letter-oriented keys
• scientific article; zbMATH DE number 370478 (Why is no real title available?)
• Construct a perfect word hash function in time independent of the size of integers
• Perfect hashing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140119)