Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Parity declustering for continuous operation in redundant disk arrays
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
Universal hashing and authentication codes
Designs, Codes and Cryptography
A combinatorial design approach to MAXCUT
Proceedings of the seventh international conference on Random structures and algorithms
Universal Hashing and Geometric Codes
Designs, Codes and Cryptography
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
New hash functions for message authentication
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
We introduce a method for constructing optimally universal hash families and equivalently RBIBDs. As a consequence of our construction we obtain minimal optimally universal hash families, if the cardinalities of the universe and the range are powers of the same prime. A corollary of this result is that the necessary conditions for the existence of an RBIBD with parameters v, k, λ, namely v ≡ 0 (mod k) and λ(v - 1) ≡ 0(mod k - 1), are sufficient, if v and k are powers of the same prime. As an application of our construction, we show that the k-MAXCUT algorithm of Hofmeister and Lefmann [A combinatorial design approach to MAXCUT, Random Struct. Algorithms 9 (1996) 163-173] can be implemented such that it has a polynomial running time, in the case that the number of vertices and k are powers of the same prime.