| 
|
QuoteRef: silvC_2002
Topic:
perfect hash table
Reference
Silverstein, C., "A practical perfect hashing algorithm", in Goldwasser, M.H., Johnson, D.S., McGeoch, C.C. (ed.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Data Structures, Near Neighbor Searches, and Methodology; Fifth and Sixth DIMACS Implementation Challenges, 59, 2002. Google
45 ;;Quote: FKS perfect hashing is an efficient variation of Fredman et. al's algorithm; within 2x of linear probing
Topic: perfect hash table (9 items)