Results 11 to 20 of about 44,364 (200)
Finding minimal perfect hash functions [PDF]
ACM SIGCSE Bulletin, 1986 A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function.
Gary Haggard, Kevin Karplus
+6 more sources
Balanced families of perfect hash functions and their applications [PDF]
ACM Transactions on Algorithms, 2010 The construction of perfect hash functions is a well-studied topic. In this article, this concept is generalized with the following definition. We say that a family of functions from [ n ] to [ k ] is a δ-balanced ( n,k )-family of perfect hash functions if for every
Noga Alon, Shai Gutner
openalex +6 more sources
GPERF : a perfect hash function generator [PDF]
, 1992 gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element ...
Schmidt, Douglas C., Suda, Tatsuya
core +2 more sources
A letter oriented minimal perfect hashing function [PDF]
ACM SIGPLAN Notices, 1982 Cichelli has presented a simple method for constructing minimal perfect hash tables of identifiers for small static word sets. The hash function value for a word is computed as the sum of the length of the word and the values associated with the first and last letters of the word.
Curtis R. Cook, R. R. Oldehoeft
openalex +3 more sources
Finding and Applying Perfect Hash Functions
Applied Mathematics Letters, 1988 Nick Cercone
openalex +3 more sources
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions [PDF]
BRICS Report Series, 1999 A new way of constructing (minimal) perfect hash functions is described. The<br />technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations.
Rasmus Pagh
openalex +4 more sources
Partially perfect hash functions for intersecting families
, 2018 Consider a large network with unknown number of nodes. Some of these nodes coordinate to perform tasks. The number of such coordination groups is also unknown. The only information about the network available is that any two coordinating groups share at least $t$ nodes.
Tapas Kumar Mishra
openalex +4 more sources
An undergraduate project to compute minimal perfect hashing functions [PDF]
ACM SIGCSE Bulletin, 1992 Some heuristics for computing the character weights in a Cichelli-style, minimal perfect hashing function are given. These ideas should perform best when applied to relatively small, static sets of character strings and they can be used as the foundation for a large programming assignment.
John A. Trono
openalex +3 more sources
A polynomial time generator for minimal perfect hash functions [PDF]
Communications of the ACM, 1985 A perfect hash function PHF is an injection F from a set W of M objects into the set consisting of the first N nonnegative integers where N ⩾ M. If N = M, then F is a minimal perfect hash function, MPHF. PHFs are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly ...
Thomas J. Sager
openalex +3 more sources
Minimal perfect hash functions made simple [PDF]
Communications of the ACM, 1980 A method is presented for computing machine independent, minimal perfect hash functions of the form: hash value ← key length + the associated value of the key's first character + the associated value of the key's last character. Such functions allow single probe retrieval from minimally sized tables of identifier lists.
Richard J. Cichelli
openalex +3 more sources