Add to ORKGConsider the set H of all linear (or affine) transformations between two vector spaces over a finite field F. We study how good H is as a class of hash functions, namely we consider hashing a set S of sizen into a range having the same cardinality n by a randomly chosen function from H and look at the expected size of the largest hash bucket. H is a universal class of hash functions for any finite field, butwith respect to our measure different fields behave differently
We give a unified analysis of linear probing hashing with a general bucket size. We use both a combi...
Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing sch...
AbstractIn this paper we analyze the performance of double hashing, a well-known hashing algorithm i...
We show that a randomly chosen linear map over a finite field gives a good hash function in the $\el...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
International audienceThis paper presents the first distributional analysis of a linear probing hash...
The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a...
This lecture discusses a very neat paper of Mitzenmacher and Vadhan [8], which proposes a robust mea...
Hash table with chaining is a data structure that chains objects with identical hash values together...
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieva...
Abstract. We give a unified analysis of linear probing hashing with a gen-eral bucket size. We use b...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
We investigate probabilistic hashing techniques for addressing computational and memory challenges i...
Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the col...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
We give a unified analysis of linear probing hashing with a general bucket size. We use both a combi...
Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing sch...
AbstractIn this paper we analyze the performance of double hashing, a well-known hashing algorithm i...
We show that a randomly chosen linear map over a finite field gives a good hash function in the $\el...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
International audienceThis paper presents the first distributional analysis of a linear probing hash...
The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a...
This lecture discusses a very neat paper of Mitzenmacher and Vadhan [8], which proposes a robust mea...
Hash table with chaining is a data structure that chains objects with identical hash values together...
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieva...
Abstract. We give a unified analysis of linear probing hashing with a gen-eral bucket size. We use b...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
We investigate probabilistic hashing techniques for addressing computational and memory challenges i...
Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the col...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
We give a unified analysis of linear probing hashing with a general bucket size. We use both a combi...
Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing sch...
AbstractIn this paper we analyze the performance of double hashing, a well-known hashing algorithm i...