Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A tradeoff between search and update time for the implicit dictionary problem
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Expanders, randomness, or time versus space
Proc. of the conference on Structure in complexity theory
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Given a set of n elements from the domain 1, …, m, we investigate how to arrange them in a table of size n, so that searching for an element in the table can be done in constant time.Yao has shown that this cannot be done when the domain is sufficiently large as a function of n ([Yao]). [FNSS] have shown that this can be done when the domain is linear in the number of elements.We give a constructive solution when the domain m is polynomial in the number of elements n, and give a nonconstructive proof for m no larger than exponential in poly(n). We improve upon [Yao] and give better bounds on the maximum m for which implicit O(1) probe search can be done. We achieve our results by showing the tight relationship between hashing and certain encoding problems.