Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error

Andrei Romashchenko
2012 Theory of Computing Systems  
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 "x ∈ A?" can be answered very quickly.
doi:10.1007/s00224-012-9425-0 fatcat:c4cczfag5nfz5ejexx676w5f24