Set Membership with a Few Bit Probes
Data Structures and Algorithms
2015-04-09 v1
Abstract
We consider the bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form "Is x in S?" by adaptively probing the bit vector at t places. Let s(m,n,t) be the minimum number of bits of storage needed for such a scheme. Several recent works investigate s(m,n,t) for various ranges of the parameter; we obtain improvements over some of the bounds shown by Buhrman, Miltersen, Radhakrishnan, and Srinivasan (2002) and Alon and Feige (2009).
Cite
@article{arxiv.1504.02035,
title = {Set Membership with a Few Bit Probes},
author = {Mohit Garg and Jaikumar Radhakrishnan},
journal= {arXiv preprint arXiv:1504.02035},
year = {2015}
}
Comments
19 pages, expanded version of 'Set membership with a few bit probes. SODA 2015: 776-784' (with additional results)