An optimal algorithm for generating minimal perfect hash functions

DOI10.1016/0020-0190(92)90220-PMaRDI QIDQ1199953zbMATH OpenOpenAlexFDO

Authors 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 graphshashingprobabilistic algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 370478
• scientific article; zbMATH DE number 1875411
• Minimal perfect hashing in polynomial time
• A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 177800 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 370478 (Why is no real title available?)
• scientific article; zbMATH DE number 194543 (Why is no real title available?)
• A Letter-oriented Minimal Perfect Hashing Scheme
• An algebraic approach to Cichelli's perfect hashing
• Minimal perfect hashing in polynomial time
• On the Expected Performance of Path Compression Algorithms
• Reciprocal hashing
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• The expected linearity of a simple equivalence algorithm
• Worst-case Analysis of Set Union Algorithms

Cited in

(11)

• Graphs, hypergraphs and hashing
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
• Ribbon: fast succinct static retrieval and approximate membership
• A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
• Vowel-consonant addressing mode on hashing for English letter-oriented keys
• Finding succinct ordered minimal perfect hash functions
• Minimal perfect hashing in polynomial time
• Construct a perfect word hash function in time independent of the size of integers
• An ordered minimal perfect hashing scheme based upon Euler's theorem
• Perfect hashing
• Hash function design for cloud storage data auditing

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

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