Less Hashing, Same Performance: Building a Better Bloom Filter Export

@article{citeulike:1382044, author = {Kirsch, Adam and Mitzenmacher, Michael}, booktitle = {European Symposium on Algorithms}, citeulike-article-id = {1382044}, citeulike-linkout-0 = {http://www.eecs.harvard.edu/~kirsch/pubs/bbbf/esa06.pdf}, editor = {Azar, Y. and Erlebach, T.}, journal = {Lecture Notes in Computer Science}, keywords = {algorithms, bloom-filter, hashing, probability}, pages = {456--467}, posted-at = {2007-06-12 19:39:14}, priority = {4}, publisher = {Springer-Verlag}, title = {Less Hashing, Same Performance: Building a Better Bloom Filter}, url = {http://www.eecs.harvard.edu/~kirsch/pubs/bbbf/esa06.pdf}, volume = {4158}, year = {2006} }

TY - JOUR ID - citeulike:1382044 L3 - citeulike-article-id:1382044 JF - Lecture Notes in Computer Science EP - 467 TI - Less Hashing, Same Performance: Building a Better Bloom Filter PB - Springer-Verlag VL - 4158 T2 - European Symposium on Algorithms SP - 456 KW - algorithms KW - bloom-filter KW - hashing KW - probability AU - Kirsch, Adam AU - Mitzenmacher, Michael A2 - Azar, Y A2 - Erlebach, T PY - 2006/// UR - http://www.eecs.harvard.edu/~kirsch/pubs/bbbf/esa06.pdf ER -