Randomness in Visual Cryptography
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Lovász Local Lemma and Its Applications to some Combinatorial Arrays
Designs, Codes and Cryptography
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The Budgeted Unique Coverage Problem and Color-Coding
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Algorithms and theory of computation handbook
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Private searching on streaming data
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently. In addition, these (near) minimum size programs have time complexity at most O(log* N) where N is the size of the universe in the case of perfect hashing, and time complexity 0(1) in the case of universal hashing. Thus for universal hashing programs of minimal size and minimal time complexity have been found.