Implicit O(1) probe search

Amos Fiat, Moni Naor

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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. A.C. Yao has shown that this cannot be done when the domain is sufficiently large as a function of n. A. Fiet et al. 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.

Original languageEnglish
Title of host publicationProc Twenty First Annu ACM Symp Theory Comput
PublisherAssociation for Computing Machinery (ACM)
Pages336-344
Number of pages9
ISBN (Print)0897913078, 9780897913072
DOIs
StatePublished - 1989
EventProceedings of the Twenty First Annual ACM Symposium on Theory of Computing - Seattle, WA, USA
Duration: 15 May 198917 May 1989

Publication series

NameProc Twenty First Annu ACM Symp Theory Comput

Conference

ConferenceProceedings of the Twenty First Annual ACM Symposium on Theory of Computing
CitySeattle, WA, USA
Period15/05/8917/05/89

Fingerprint

Dive into the research topics of 'Implicit O(1) probe search'. Together they form a unique fingerprint.

Cite this