@incollection{clementi2016rumor,
author = "Andrea Clementi and Pierluigi Crescenzi and Carola Doerr and Pierre Fraigniaud and Francesco Pasquale and Riccardo Silvestri",
abstract = "A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstrate that this technique can be usefully applied to Bloom filters and related data structures. Specifically, only two hash functions are necessary to effectively implement a Bloom filter without any loss in the asymptotic false positive probability. This leads to less computation and potentially less need for randomness in practice.",
booktitle = "Random Structure and Algorithms",
doi = "10.1002/rsa",
isbn = "3540388753",
issn = "10429832",
keywords = "bloom filters;double hashing;poisson convergence",
pages = "456--467",
title = "{R}umor {S}preading in {R}andom {E}volving {G}raphs",
url = "http://www.springerlink.com/index/u0157154257lw281.pdf",
year = "2016",
}