Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Parallel hashing and integer sorting
Journal of Algorithms
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
Simulation-based Comparison of Hash Functions for Emulated Shared Memory
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Bucket Hashing and its Application to Fast Message Authentication
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
New classes and applications of hash functions
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
Discrete Applied Mathematics
Maintaining external memory efficient hash tables
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |
New hash families are analyzed, mainly consisting of the hash functions ha,b : {0,..., u - 1} → {0,..., r - 1}, x → ((ax + b) mod(kr)) div k. Universal classes of such functions have already been investigated in [5, 6], and used in severail applications, e.g. [3,9]. The new constructions which are introduced here, improve in several ways upon the former results. Some of them achieve a smaller universality parameter, i.e., two keys collide under a randomly chosen function with a smaller probability. In fact, an optimally universal hash class is presented, which means that the universality parameter achieves the minimum possible value. Furthermore, the bound of the universality parameter of a known, almost strongly universal hash family is improved, and it is shown how to reduce the size of a known class, retaining its properties. Finally, a new composition technique for constructing hash classes for longer keys is presented. Its application leads to efficient hash families which consist of linear functions over the ring of polynomials over Zm.