Cite

A Multi-partitioning Approach to Building Fast and Accurate Counting Bloom Filters

MLA

Institute of Computing Technology [Biejing] (ICT) ; Chinese Academy of Science (CAS), et al. “A Multi-Partitioning Approach to Building Fast and Accurate Counting Bloom Filters.” 2013 IEEE 27th International Symposium on Parallel & Distributed Processing (IPDPS),. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.ocn893166617&authtype=sso&custid=ns315887. Accessed 5 Feb. 2025.



APA

Institute of Computing Technology [Biejing] (ICT) ; Chinese Academy of Science (CAS), Computer and Communication School ; Hunan University, Laboratoire d’Informatique, S. T. de l’Information et de la C. (LISTIC) ; U. de S., Computer Science and Engineering Dept. (MSU CS) ; Michigan State University, Huang, K., Zhang, D., Xie, G., Kavé, S., Liu, A., & Li, W. (n.d.). A Multi-partitioning Approach to Building Fast and Accurate Counting Bloom Filters. 2013 IEEE 27th International Symposium on Parallel & Distributed Processing (IPDPS),.



Chicago

Institute of Computing Technology [Biejing] (ICT) ; Chinese Academy of Science (CAS), Computer and Communication School ; Hunan University, Systèmes, Traitement de l’Information et de la Connaissance (LISTIC) ; Université de Savoie Laboratoire d’Informatique, Computer Science and Engineering Dept. (MSU CS) ; Michigan State University, Kun Huang, Dafang Zhang, Gaogang Xie, Salamatian Kavé, Alex Liu, and Wei Li. 2025. “A Multi-Partitioning Approach to Building Fast and Accurate Counting Bloom Filters.” 2013 IEEE 27th International Symposium on Parallel & Distributed Processing (IPDPS),. Accessed February 5. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.ocn893166617&authtype=sso&custid=ns315887.