| Explicit Deterministic Constructions for Membership in the Bitprobe Model (2001) | |||||||||||||||||
Abstract | |||||||||||||||||
| We look at time-space tradeoffs for the static membership problem in the bit-probe model. The problem is to represent a set of size up to n from a universe of size m using a small number of bits so that given an element of the universe, its membership in the set can be determined with as few bit probes to the representation as possible. | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||