Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Introduction to algorithms
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
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
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Min-Wise versus linear independence (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |