The analysis of closed hashing under limited randomness
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
Size-estimation framework with applications to transitive closure and reachability
Journal of Computer and System Sciences
Syntactic clustering of the Web
Selected papers from the sixth international conference on World Wide Web
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A small approximately min-wise independent family of hash functions
Journal of Algorithms
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
Closed Hashing is Computable and Optimally Randomizable with Universal Hash Functions
Closed Hashing is Computable and Optimally Randomizable with Universal Hash Functions
Tabulation based 4-universal hashing with applications to second moment estimation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
New classes and applications of hash functions
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
k-Wise Independent Random Graphs
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Linear Probing with Constant Independence
SIAM Journal on Computing
Exponential time improvement for min-wise based algorithms
Information and Computation
The power of simple tabulation hashing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Linear Probing with 5-wise Independence
SIAM Review
Exponential time improvement for min-wise based algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
SIAM Journal on Computing
Bottom-k and priority sampling, set similarity and subset sums with minimal independence
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Sketching for big data recommender systems using fast pseudo-random fingerprints
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
b-bit minwise hashing in practice
Proceedings of the 5th Asia-Pacific Symposium on Internetware
| Hi-index | 0.00 |
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC'07]. For (1 + ε)-approximate minwise independence, we show that Ω(lg 1/ε)-independent hash functions are required, matching an upper bound of [Indyk, SODA'99]. We also show that the multiply-shift scheme of Dietzfelbinger, most commonly used in practice, fails badly in both applications.