DOIAbstract
AbstractA brief explanation of perfect hash function search is presented followed by an informal analysis of the problem
AbstractA brief explanation of perfect hash function search is presented followed by an informal analysis of the problem
Given a set S of n distinct keys, a function f that bijectively maps the keys of S into the range (0...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
A perfect hash function for a subset X of f0; 1; \Delta \Delta \Delta ; n \Gamma 1g is an injection...
AbstractNew methods for computing perfect hash functions and applications of such functions to the p...
AbstractA brief explanation of perfect hash function search is presented followed by an informal ana...
AbstractNew methods for computing perfect hash functions and applications of such functions to the p...
A perfect hash function, PHF, is an injection, F, from a set, W, of M objects into the set consistin...
Abstract:- This paper describes a new method for Perfect Hashing design, based on forming every Hash...
A minimal perfect hash function (MPHF) is a function from a set of M objects to the first M non-nega...
Minimal perfect hash functions have been shown to be useful to compress data in several data managem...
Minimal perfect hash functions have been shown to be useful to compress data in several data managem...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
A new way of constructing (minimal) perfect hash functions is described. Thetechnique considerably r...
A heuristic is given for finding minimal perfect hash functions without extensive searching. The pr...
A parallel algorithm for conducting a search for a first solution to the problem of generating minim...
Given a set S of n distinct keys, a function f that bijectively maps the keys of S into the range (0...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
A perfect hash function for a subset X of f0; 1; \Delta \Delta \Delta ; n \Gamma 1g is an injection...
AbstractNew methods for computing perfect hash functions and applications of such functions to the p...
AbstractA brief explanation of perfect hash function search is presented followed by an informal ana...
AbstractNew methods for computing perfect hash functions and applications of such functions to the p...
A perfect hash function, PHF, is an injection, F, from a set, W, of M objects into the set consistin...
Abstract:- This paper describes a new method for Perfect Hashing design, based on forming every Hash...
A minimal perfect hash function (MPHF) is a function from a set of M objects to the first M non-nega...
Minimal perfect hash functions have been shown to be useful to compress data in several data managem...
Minimal perfect hash functions have been shown to be useful to compress data in several data managem...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
A new way of constructing (minimal) perfect hash functions is described. Thetechnique considerably r...
A heuristic is given for finding minimal perfect hash functions without extensive searching. The pr...
A parallel algorithm for conducting a search for a first solution to the problem of generating minim...
Given a set S of n distinct keys, a function f that bijectively maps the keys of S into the range (0...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
A perfect hash function for a subset X of f0; 1; \Delta \Delta \Delta ; n \Gamma 1g is an injection...
Add to ORKG