A concept of complexity of hashing is introduced and studied with special attention to the lower bounds of complexity. A new class of rather simple hash-functions is developed. These functions are shown to be near optimal within this concept of complexity
A new algorithm for generating order preserving minimal perfect hash functions is presented. The alg...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...
Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the col...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
Abstract:- This paper describes a new method for Perfect Hashing design, based on forming every Hash...
A perfect hash function for a subset X of f0; 1; \Delta \Delta \Delta ; n \Gamma 1g is an injection...
The aim of this tutorial article is to provide an introduction to methods based on universal hashing...
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items fro...
A new way of constructing (minimal) perfect hash functions is described. Thetechnique considerably r...
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items fro...
We present a three-step algorithm for generating minimal perfect hash functions which runs very fast...
Hashing is so commonly used in computing that one might expect hash functions to be well understood,...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
A new algorithm for generating order preserving minimal perfect hash functions is presented. The alg...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...
Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the col...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
Abstract:- This paper describes a new method for Perfect Hashing design, based on forming every Hash...
A perfect hash function for a subset X of f0; 1; \Delta \Delta \Delta ; n \Gamma 1g is an injection...
The aim of this tutorial article is to provide an introduction to methods based on universal hashing...
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items fro...
A new way of constructing (minimal) perfect hash functions is described. Thetechnique considerably r...
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items fro...
We present a three-step algorithm for generating minimal perfect hash functions which runs very fast...
Hashing is so commonly used in computing that one might expect hash functions to be well understood,...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
A new algorithm for generating order preserving minimal perfect hash functions is presented. The alg...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...
Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the col...
DOI
Add to ORKG