An optimal algorithm for generating minimal perfect hash functions

DOI10.1016/0020-0190(92)90220-PzbMath0772.68051OpenAlexW2146005787MaRDI QIDQ1199953

Zbigniew J. Czech, George Havas, Bohdan S. Majewski

Publication date: 17 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90220-p

zbMATH Keywords

random graphsprobabilistic algorithmshashing

Mathematics Subject Classification ID

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

Related Items (6)

Finding succinct ordered minimal perfect hash functions ⋮ The self-indexed search algorithm: a bit-level approach to minimal perfect hashing ⋮ Perfect hashing ⋮ Graphs, hypergraphs and hashing ⋮ Vowel-consonant addressing mode on hashing for English letter-oriented keys ⋮ Hash function design for cloud storage data auditing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal perfect hashing in polynomial time
• The expected linearity of a simple equivalence algorithm
• An algebraic approach to Cichelli's perfect hashing
• On the Expected Performance of Path Compression Algorithms
• A Letter-oriented Minimal Perfect Hashing Scheme
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Worst-case Analysis of Set Union Algorithms
• Reciprocal hashing

This page was built for publication: An optimal algorithm for generating minimal perfect hash functions