The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of type "Is x in A?" can be answered very quickly. H.Buhrman, P.B.Miltersen, J.Radhakrishnan, and S.Venkatesh proposed a bit-probe scheme based on expanders. Their scheme needs space of O(n m) bits, and requires to read only one randomly chosen bit from the memory to answer a query. The answer is correct with higharXiv:1102.5538v4 fatcat:mfcc7n2cnbfo3fw7kr2v6ov7oq