Why simple hash functions work: exploiting the entropy in a data stream
M. Mitzenmacher, und S. Vadhan. SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Seite 746--755. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2008)
%0 Conference Paper
%1 1347164
%A Mitzenmacher, Michael
%A Vadhan, Salil
%B SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
%C Philadelphia, PA, USA
%D 2008
%I Society for Industrial and Applied Mathematics
%K bloom hash
%P 746--755
%T Why simple hash functions work: exploiting the entropy in a data stream
@inproceedings{1347164,
added-at = {2008-06-28T22:07:46.000+0200},
address = {Philadelphia, PA, USA},
author = {Mitzenmacher, Michael and Vadhan, Salil},
biburl = {https://www.bibsonomy.org/bibtex/28ff1ceccc103967420b2010d18f61abd/chesteve},
booktitle = {SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms},
interhash = {03e646a240cefd28a79247cf77f91c01},
intrahash = {8ff1ceccc103967420b2010d18f61abd},
keywords = {bloom hash},
location = {San Francisco, California},
pages = {746--755},
publisher = {Society for Industrial and Applied Mathematics},
timestamp = {2008-06-28T22:07:46.000+0200},
title = {Why simple hash functions work: exploiting the entropy in a data stream},
year = 2008
}
