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
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Parallel hashing and integer sorting
Journal of Algorithms
Towards a theory of nearly constant time parallel algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Dynamic Generation of Discrete Random Variates
Dynamic Generation of Discrete Random Variates
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
New sampling-based summary statistics for improving approximate query answers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal prediction for prefetching in the worst case
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive generation of random events
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Time-Interval Sampling for Improved Estimations in Data Warehouses
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Hi-index | 0.00 |