Add to ORKGThe aim of this work is to create a model of hashing with an acceptable worst case time complexity. The model is based on the idea of universal hashing and the expected time of every operation is constant. The used universal class of functions consists of linear transformations between vector spaces. This class has already been studied with a good asymptotic result. This work improves the result and proves that the expected amortised time of the scheme is constant
Random hashing can provide guarantees regarding the performance of data structures such as hash ta...
In this paper we consider very fast evaluation of strongly universal hash functions, or equivalently...
The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...
The aim of this tutorial article is to provide an introduction to methods based on universal hashing...
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieva...
AbstractAny implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings re...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing a...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
Universal hashing found a lot of applications in computer science. In cryptography the most importan...
We present fast strongly universal string hashing families: they can process data at a rate of 0.2 C...
Using the pigeon-hole principle, we derive a new bound for the key length in a t-wise almost univers...
Random hashing can provide guarantees regarding the performance of data structures such as hash ta...
In this paper we consider very fast evaluation of strongly universal hash functions, or equivalently...
The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. ...
This paper gives an i, put independe, t average linear time algorithm for storage and retrieval on ...
The aim of this tutorial article is to provide an introduction to methods based on universal hashing...
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieva...
AbstractAny implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings re...
In this paper we use linear algebraic methods to analyze the performance of several classes of hash ...
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing a...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
Universal hashing found a lot of applications in computer science. In cryptography the most importan...
We present fast strongly universal string hashing families: they can process data at a rate of 0.2 C...
Using the pigeon-hole principle, we derive a new bound for the key length in a t-wise almost univers...
Random hashing can provide guarantees regarding the performance of data structures such as hash ta...
In this paper we consider very fast evaluation of strongly universal hash functions, or equivalently...
The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a...