Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error [chapter]

Andrei Romashchenko
2011 Lecture Notes in Computer Science  
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/978-3-642-20712-9_5 fatcat:tmemdtfsajfljhlgupgzhgnvti