Set Membership with Non-Adaptive Bit Probes


We consider the non-adaptive 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 non-adaptively probing the bit vector at t places. Let sN (m,n, t) be the minimum number of bits of storage… (More)
DOI: 10.4230/LIPIcs.STACS.2017.38


Cite this paper

@inproceedings{Garg2017SetMW, title={Set Membership with Non-Adaptive Bit Probes}, author={Mohit Garg and Jaikumar Radhakrishnan}, booktitle={STACS}, year={2017} }