%0 Journal Article %1 journals/rsa/KirschM08 %A Kirsch, Adam %A Mitzenmacher, Michael %D 2008 %J Random Struct. Algorithms %K dblp %N 2 %P 187-218 %T Less hashing, same performance: Building a better Bloom filter. %U http://dblp.uni-trier.de/db/journals/rsa/rsa33.html#KirschM08 %V 33

@article{journals/rsa/KirschM08, added-at = {2008-11-19T00:00:00.000+0100}, author = {Kirsch, Adam and Mitzenmacher, Michael}, biburl = {https://www.bibsonomy.org/bibtex/2b4e701a71f9b3800d2205a084bab132f/dblp}, date = {2008-11-19}, description = {dblp}, ee = {http://dx.doi.org/10.1002/rsa.20208}, interhash = {6ca5513d16057051d2fb863878a8a1b1}, intrahash = {b4e701a71f9b3800d2205a084bab132f}, journal = {Random Struct. Algorithms}, keywords = {dblp}, number = 2, pages = {187-218}, timestamp = {2008-11-20T11:35:53.000+0100}, title = {Less hashing, same performance: Building a better Bloom filter.}, url = {http://dblp.uni-trier.de/db/journals/rsa/rsa33.html#KirschM08}, volume = 33, year = 2008 }