{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T21:07:23Z","timestamp":1774732043680,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_42","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"456-467","source":"Crossref","is-referenced-by-count":117,"title":["Less Hashing, Same Performance: Building a Better Bloom Filter"],"prefix":"10.1007","author":[{"given":"Adam","family":"Kirsch","sequence":"first","affiliation":[]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure, 3rd edn. John Wiley & Sons, Chichester (1995)","edition":"3"},{"key":"42_CR2","unstructured":"Bose, P., Guo, H., Kranakis, E., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Tang, Y.: On the false-positive rate of Bloom filters (submitted), \n                    \n                      http:\/\/cg.scs.carleton.ca\/~morin\/publications\/ds\/bloom-submitted.pdf"},{"issue":"4","key":"42_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A. Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network Applications of Bloom Filters: A Survey. Internet Mathematics\u00a01(4), 485\u2013509 (2004)","journal-title":"Internet Mathematics"},{"key":"42_CR4","unstructured":"Cormode, G., Muthukrishnan, S.: Improved Data Stream Summaries: The Count-Min Sketch and its Applications. DIMACS Technical Report 2003-20 (2003)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-30494-4_26","volume-title":"Formal Methods in Computer-Aided Design","author":"P.C. Dillinger","year":"2004","unstructured":"Dillinger, P.C., Manolios, P.: Bloom Filters in Probabilistic Verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol.\u00a03312, pp. 367\u2013381. Springer, Heidelberg (2004)"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-24732-6_5","volume-title":"Model Checking Software","author":"P.C. Dillinger","year":"2004","unstructured":"Dillinger, P.C., Manolios, P.: Fast and Accurate Bitstate Verification for SPIN. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol.\u00a02989, pp. 57\u201375. Springer, Heidelberg (2004)"},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D.P. Dubhashi","year":"1998","unstructured":"Dubhashi, D.P., Ranjan, D.: Balls and Bins: A Case Study in Negative Dependence. Random Structures and Algorithms\u00a013(2), 99\u2013124 (1998)","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"42_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: A scalable wide-area Web cache sharing protocol. IEEE\/ACM Transactions on Networking\u00a08(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"42_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A Classical Introduction to Modern Number Theory","author":"K. Ireland","year":"1990","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Springer, Heidelberg (1990)","edition":"2"},{"key":"42_CR10","unstructured":"Kirsch, A., Mitzenmacher, M.: Building a Better Bloom Filter. Harvard University Computer Science Technical Report TR-02-05 (2005), \n                    \n                      ftp:\/\/ftp.deas.harvard.edu\/techreports\/tr-02-05.pdf"},{"key":"42_CR11","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Lueker, G., Molodowitch, M.: More analysis of double hashing. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 354\u2013359 (1988)","DOI":"10.1145\/62212.62246"},{"issue":"5","key":"42_CR13","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/TNET.2002.803864","volume":"10","author":"M. Mitzenmacher","year":"2002","unstructured":"Mitzenmacher, M.: Compressed Bloom Filters. IEEE\/ACM Transactions on Networking\u00a010(5), 613\u2013620 (2002)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"42_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"42_CR15","unstructured":"Pagh, A., Pagh, R., Srinivas Rao, S.: An Optimal Bloom Filter Replacement. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 823\u2013829 (2005)"},{"issue":"10","key":"42_CR16","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1145\/67933.67941","volume":"32","author":"M.V. Ramakrishna","year":"1989","unstructured":"Ramakrishna, M.V.: Practical performance of Bloom filters and parallel free-text searching. Communications of the ACM\u00a032(10), 1237\u20131239 (1989)","journal-title":"Communications of the ACM"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Schmidt, J.P., Siegel, A.: The analysis of closed hashing under limited randomness. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing (STOC 1990), pp. 224\u2013234 (1990)","DOI":"10.1145\/100216.100245"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:55Z","timestamp":1619507815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11841036_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}