Perfect hashing

A classic problem in computer science is how to store information so that it can be searched and retrieved efficiently. Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. The aim of the project is to investigate, both from theoretical and practical points of view, algorithms for generating perfect hash functions.
• Zbigniew J Czech, George Havas and Bohdan S Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters, 43 (1992) 257-264.
• George Havas and Bohdan S Majewski, Graph theoretic obstacles to perfect hashing, Congressus Numerantium 98 (1993) 81-93.
• George Havas, Bohdan S Majewski, Nicholas C Wormald and Zbigniew J Czech, Graphs, Hypergraphs and Hashing, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790, 153-165.
• Bohdan S. Majewski, Nicholas C. Wormald, George Havas and Zbigniew J. Czech, A Family of Perfect Hashing Methods, submitted (UQ Technical Report 242).