Not all keys can be hashed in constant time

Authors:
J. Gil;F. Meyer auf der Heide;A. Wigderson
Affiliations:
Dept. of Gomp. Sc. Hebrew University, Jerusalem, 91904, Israel;Fachbereich 17, Mathematik/Informatik, Univesität. Gll Paderborn, D-4790 Paderborn, Fed.Rep. of Germany;Dept. of Gomp. Sc. Hebrew University, Jerusalem, 91904, Israel
Venue:
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Year:
1990

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
Parallel hashing—an efficient implementation of shared memory

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
How to distribute a dictionary in a complete network

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Should Tables Be Sorted?

Journal of the ACM (JACM)
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A complexity theoretic approach to randomness

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Constant-time parallel integer sorting

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Fast and reliable parallel hashing

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fast hashing on a PRAM—designing by expectation

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Hi-index	0.00