%0 Book Section %1 noKey %A Charles, Denis %A Chellapilla, Kumar %B Algorithms - ESA 2008 %D 2008 %E Halperin, Dan %E Mehlhorn, Kurt %I Springer Berlin Heidelberg %K bloom %P 259-270 %R 10.1007/978-3-540-87744-8_22 %T Bloomier Filters: A Second Look %V 5193 %X A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A %@ 978-3-540-87743-1

@incollection{noKey, abstract = {A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A }, added-at = {2013-06-03T02:04:25.000+0200}, author = {Charles, Denis and Chellapilla, Kumar}, biburl = {https://www.bibsonomy.org/bibtex/214791f757c8c8cbd0de57d435a37cfa9/ytyoun}, booktitle = {Algorithms - ESA 2008}, doi = {10.1007/978-3-540-87744-8_22}, editor = {Halperin, Dan and Mehlhorn, Kurt}, interhash = {bf01c53aab4a046c835b6489712b3ab1}, intrahash = {14791f757c8c8cbd0de57d435a37cfa9}, isbn = {978-3-540-87743-1}, keywords = {bloom}, pages = {259-270}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2013-06-03T02:04:25.000+0200}, title = {Bloomier Filters: A Second Look}, volume = 5193, year = 2008 }