This paper deals with the problem of storing a subset of elements from the bounded universe M = \0, …, M-1\ so that membership queries can be performed efficiently. In particular, we introduce a data structure to represent a subset of N elements of M in a number of bits close to the information-theoretic minimum, B = M N, and use the structure to answer membership queries in constant time.
No takes yet. Share an insight, caveat, or question.
Brodnik et al. (1999) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: