10 search results - page 1 / 2 » Hash and Displace: Efficient Evaluation of Minimal Perfect H... |
WADS
1999
Springer
13 years 10 months ago
1999
Springer
WWW
2007
ACM
14 years 6 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
SBBD
2008
13 years 7 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
ICGA
2008
13 years 5 months ago
2008
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
ESA
2009
Springer
14 years 9 days ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...