{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:55:26Z","timestamp":1775638526624,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540728443","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72845-0_9","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:51:37Z","timestamp":1182862297000},"page":"108-121","source":"Crossref","is-referenced-by-count":60,"title":["Cache-, Hash- and Space-Efficient Bloom Filters"],"prefix":"10.1007","author":[{"given":"Felix","family":"Putze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Singler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bloom, B.H.: Space-time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7) (1970)","DOI":"10.1145\/362686.362692"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics, 1(4) (2004)","DOI":"10.1080\/15427951.2004.10129096"},{"issue":"9","key":"9_CR3","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/TC.1984.1676499","volume":"33","author":"J.G. Cleary","year":"1984","unstructured":"Cleary, J.G.: Compact hash tables using bidirectional linear probing. IEEE Transactions on Computers\u00a033(9), 828\u2013834 (1984)","journal-title":"IEEE Transactions on Computers"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.) Model Checking Software. LNCS, vol.\u00a02989, pp. 57\u201375. Springer, Heidelberg (2004)"},{"issue":"3","key":"9_CR6","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.M., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM TON\u00a08(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM TON"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006","author":"A. Kirsch","year":"2006","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: Building a better Bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 456\u2013467. Springer, Heidelberg (2006)"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0190(94)00032-8","volume":"50","author":"U. Manber","year":"1994","unstructured":"Manber, U., Wu, S.: An algorithm for approximate membership checking with application to password security. Information Processing Letters\u00a050(4), 191\u2013197 (1994)","journal-title":"Information Processing Letters"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Compressed Bloom filters. In: PODC 2001, pp. 144\u2013150 (2001)","DOI":"10.1145\/383962.384004"},{"key":"9_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0935-6","volume-title":"Compression and Coding Algorithms","author":"A. Moffat","year":"2002","unstructured":"Moffat, A., Turpin, A.: Compression and Coding Algorithms. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"9_CR11","unstructured":"Pagh, A., Pagh, R., Rao, S.S.: An optimal Bloom filter replacement. In: SODA 2005, pp. 823\u2013829 (2005)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Sanders, P., Transier, F.: Intersection in integer inverted indices. In: ALENEX 2007 (2007)","DOI":"10.1137\/1.9781611972870.7"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72845-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:52Z","timestamp":1605762352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72845-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728443"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72845-0_9","relation":{},"subject":[]}}