Perfect hash function

Known as: Minimal perfect hashing, MPHF, Sloppy hashing 
In computer science, a perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
We propose a succinct randomized language model which employs a perfect hash function to encode fingerprints of n-grams and their… (More)
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A perfect hash function (PHF) h : U → [0, m − 1] for a key set S is a function that maps the keys of S to unique values. The… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Czech, Z.J., G. Havas and B.S. Majewski, An optimal algorithm for generating minimal perfect hash functions, Information… (More)
Is this relevant?
Review
1992
Review
1992
U biquitous in areas including artificial intelligence, data structures, database management , file processing, and information… (More)
  • figure 5
  • figure 9
Is this relevant?
Highly Cited
1990
Highly Cited
1990
gperf is a “software-tool generating-tool” designed to automate the generation of perfect hash functions. This paper describes… (More)
  • figure 2
  • table 1
  • table 2
  • figure 6
  • table 4
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert… (More)
Is this relevant?
1986
1986
A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set… (More)
  • figure 3
  • figure 2
Is this relevant?
1984
1984
A fast perfect hash function is presented which allows the 63 Adat reserved words to be differentiated quickly from other Ada… (More)
Is this relevant?
1982
1982
Cichelli has presented a simple method for constructing minimal perfect hash tables of identifiers for small static word sets… (More)
  • figure I
  • table I
  • table 2
Is this relevant?
Highly Cited
1977
Highly Cited
1977
A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of… (More)
  • table I
  • table II
  • table III
  • table V
  • table VI
Is this relevant?