{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:30:50Z","timestamp":1783791050129,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_61","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"684-695","source":"Crossref","is-referenced-by-count":211,"title":["An Improved Construction for Counting Bloom Filters"],"prefix":"10.1007","author":[{"given":"Flavio","family":"Bonomi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sushil","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Varghese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"61_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal of Computing\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"61_CR2","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: The heavily loaded case. In: Proc. of the 32nd Annual ACM STOC, pp. 745\u2013754 (2000)","DOI":"10.1145\/335305.335411"},{"issue":"7","key":"61_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time tradeoffs in in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: Beyond Bloom filters: From approximate membership checks to approximate state machines. In: Proc. of SIGCOMM (to appear, 2006)","DOI":"10.1145\/1159913.1159950"},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A., Mitzenmacher, M.: Using multiple hash functions to improve IP Lookups. In: Proceedings of IEEE INFOCOM, pp. 1454\u20131463 (2001)","DOI":"10.1109\/INFCOM.2001.916641"},{"issue":"4","key":"61_CR6","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":"61_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral Bloom Filters. In: Proceedings of the 2003 ACM SIGMOD Conference, pp. 241\u2013252 (2003)","DOI":"10.1145\/872757.872787"},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"Dharmapurikar, S., Krishnamurthy, P., Sproull, T., Lockwood, J.: Deep Packet Inspection using Parallel Bloom Filters. In: IEEE Hot Interconnects, vol.\u00a012 (2003)","DOI":"10.1109\/CONECT.2003.1231477"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Dharmapurikar, S., Krishnamurthy, P., Taylor, D.: Longest prefix matching using Bloom filters. In: Proceedings of the ACM SIGCOMM 2003, pp. 201\u2013212 (2003)","DOI":"10.1145\/863955.863979"},{"issue":"3","key":"61_CR10","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 Trans. on Networking\u00a08(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"61_CR11","doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Panigrahy, R.: Balanced allocation on graphs. In: Proc. of the Seventeenth Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 434\u2013443 (2006)","DOI":"10.1145\/1109557.1109606"},{"key":"61_CR12","doi-asserted-by":"crossref","unstructured":"Lu, Y., Prabhakar, B., Bonomi, F.: Perfect Hashing for Network Applications. In: Proc. of ISIT 2006 (to appear, 2006)","DOI":"10.1109\/ISIT.2006.261567"},{"key":"61_CR13","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":"61_CR14","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., V\u00f6cking, B.: The asymptotics of selecting the shortest of two, improved. In: Suhov, Y. (ed.) Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich. American Mathematical Society (2003)","DOI":"10.1090\/trans2\/207\/10"},{"key":"61_CR15","doi-asserted-by":"crossref","unstructured":"Pagh, R., Rodler, F.: Cuckoo Hashing. In: Proc. of the 9th Annual European Symposium on Algorithms, pp. 121\u2013133 (2001)","DOI":"10.1007\/3-540-44676-1_10"},{"key":"61_CR16","unstructured":"Panigrahy, R.: Efficient hashing with lookups in two memory accesses. In: Proc. of the Sixteenth Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 830\u2013839 (2005)"},{"key":"61_CR17","unstructured":"Pagh, A., Pagh, R., Rao, S.: An Optimal Bloom Filter Replacement. In: Proc. of the Sixteenth Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 823\u2013829 (2005)"},{"key":"61_CR18","doi-asserted-by":"crossref","unstructured":"Rajwar, R., Herlihy, M., Lai, K.: Virtualizing Transactional Memory. In: Proc. of the 32nd Annual Int\u2019l. Symp. on Computer Architecture, pp. 494\u2013505 (2005)","DOI":"10.1109\/ISCA.2005.54"},{"key":"61_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-31966-5_32","volume-title":"Passive and Active Network Measurement","author":"M. Sharma","year":"2005","unstructured":"Sharma, M., Byers, J.: Scalable Coordination Techniques for Distributed Network Monitoring. In: Dovrolis, C. (ed.) PAM 2005. LNCS, vol.\u00a03431, pp. 349\u2013352. Springer, Heidelberg (2005)"},{"key":"61_CR20","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. In: Proceedings of the 40 th IEEE-FOCS, pp. 131\u2013140 (1999)","DOI":"10.1109\/SFFCS.1999.814585"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:33:04Z","timestamp":1736541184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11841036_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}