title: Bloom filter design
body: <p>I wanted to know where I can find an implementation of the Bloom filter, with some explanation about the choice of the hash functions. </p>
  
  <p>Additionally I have the following questions:<br>
  1) the Bloom filter is known to have false positives. Is it possible to reduce them by using two filters, one for used elements, and one for non-used elements (assuming the set is finite and known a-priori) and compare the two?<br>
  2) are there other similar algorithms in the CS literature?</p>