Add to ORKGThis paper demonstrates how a broad collection of hash function families can be expressed as dynamical systems. We then show that this representation can be useful for analysis. In particular, we provide an analysis which proves that a widely-used family of double hash functions will transform any initial distribution of keys into the uniform distribution over the table space
International audienceThis paper presents the first distributional analysis of a linear probing hash...
A number of recent papers have considered the influence of modern computer memory hierarchies on the...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...
This paper demonstrates how a broad collection of hash function families can be expressed as dynamic...
Pre-PrintIn this paper an efficient open addressing hash function called exponential hashing is deve...
Pre-PrintIn this paper an efficient open address hash function called exponential hashing is develop...
AbstractIn this paper we analyze the performance of double hashing, a well-known hashing algorithm i...
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieva...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
Abstract Hash functions are among the oldest and most widely used data structures in computer scienc...
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing a...
In the talk, we shall discuss quality measures for hash functions used in data structures and algori...
Hash functions are often used to consistently assign objects to particular resources, for example t...
In the talk, we shall discuss quality measures for hash functions used in data structures and algori...
Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the col...
International audienceThis paper presents the first distributional analysis of a linear probing hash...
A number of recent papers have considered the influence of modern computer memory hierarchies on the...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...
This paper demonstrates how a broad collection of hash function families can be expressed as dynamic...
Pre-PrintIn this paper an efficient open addressing hash function called exponential hashing is deve...
Pre-PrintIn this paper an efficient open address hash function called exponential hashing is develop...
AbstractIn this paper we analyze the performance of double hashing, a well-known hashing algorithm i...
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieva...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
Abstract Hash functions are among the oldest and most widely used data structures in computer scienc...
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing a...
In the talk, we shall discuss quality measures for hash functions used in data structures and algori...
Hash functions are often used to consistently assign objects to particular resources, for example t...
In the talk, we shall discuss quality measures for hash functions used in data structures and algori...
Quick proofs are given for the characterization (due to Schay, Raver, Hanan, and Palermo) of the col...
International audienceThis paper presents the first distributional analysis of a linear probing hash...
A number of recent papers have considered the influence of modern computer memory hierarchies on the...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...