Journal of the ACM (JACM)
More analysis of double hashing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The cost distribution of clustering in random probing
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Almost random graphs with simple hash functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Journal of Algorithms
Deterministic load balancing and dictionaries in the parallel disk model
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Linear probing with constant independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Less hashing, same performance: building a better bloom filter
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
String hashing for linear probing
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Explicit construction of a small epsilon-net for linear threshold functions
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the k-independence required by linear probing and minwise independence
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
SIAM Journal on Computing
Linear Probing with 5-wise Independence
SIAM Review
Hi-index | 0.00 |