The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Strongly Universal and Optimally Universal Hashing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Tabulation based 4-universal hashing with applications to second moment estimation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.04 |
Consider the set of vectors over a field having non-zero coefficients only in a fixed sparse set and multiplication defined by convolution, or the set of integers having non-zero digits (in some base b) in a fixed sparse set. We show the existence of an optimal (or almost-optimal, in the latter case) 'magic' multiplier constant that provides a perfect hash function which transfers the information from the given sparse coefficients into consecutive digits. Studying the convolution case we also obtain a result of non-degeneracy for Schur functions as polynomials in the elementary symmetric functions in positive characteristic.