scientific article; zbMATH DE number 370478

zbMATH Open0772.68034MaRDI QIDQ4201415FDOQ4201415

Zbigniew J. Czech, Bohdan S. Majewski

Publication date: 24 August 1993

Title of this publication is not available (Why is that?)

Recommendations

• A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
• scientific article; zbMATH DE number 1688373
• Minimal perfect hashing in polynomial time
• Experimental and Efficient Algorithms
• Simple and Space-Efficient Minimal Perfect Hash Functions

zbMATH Keywords

perfect hash function

Mathematics Subject Classification ID

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

Cited In (7)

• Graphs, hypergraphs and hashing
• A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
• An optimal algorithm for generating minimal perfect hash functions
• Minimal perfect hashing in polynomial time
• Construct a perfect word hash function in time independent of the size of integers
• Hash, Displace, and Compress
• Perfect hashing

This page was built for publication:

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