23 search results - page 3 / 5 » A Faster Algorithm for Constructing Minimal Perfect Hash Fun... |
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
106
click to vote
ICONIP
1998
15 years 3 months ago
1998
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
137
click to vote
MYCRYPT
2005
Springer
15 years 7 months ago
2005
Springer
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
116
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
133
Voted
ESA
2009
Springer
15 years 9 months 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 ...