Duong Q, Nguyen K, Nguyen H, Dao X, do A and Trinh Q. FeCBF: A Novel Sub-Optimal Cascaded Bloom Filter Structure Based on Feature Extraction. IEEE Access. 10.1109/ACCESS.2024.3399062. 12. (67619-67631).

https://ieeexplore.ieee.org/document/10526248/

Li M, Xie R, Chen D, Dai H, Gu R, Huang H, Dou W and Chen G. (2022). A Pareto optimal Bloom filter family with hash adaptivity. The VLDB Journal. 10.1007/s00778-022-00755-z. 32:3. (525-548). Online publication date: 1-May-2023.

https://link.springer.com/10.1007/s00778-022-00755-z

Xie R, Li M, Miao Z, Gu R, Huang H, Dai H and Chen G. (2021). Hash Adaptive Bloom Filter 2021 IEEE 37th International Conference on Data Engineering (ICDE). 10.1109/ICDE51399.2021.00061. 978-1-7281-9184-3. (636-647).

https://ieeexplore.ieee.org/document/9458621/

Luo L, Guo D, Ma R, Rottenstreich O and Luo X. Optimizing Bloom Filter: Challenges, Solutions, and Comparisons. IEEE Communications Surveys & Tutorials. 10.1109/COMST.2018.2889329. 21:2. (1912-1949).

https://ieeexplore.ieee.org/document/8586915/

Yu J, Chen L, Zhang R and Wang K. Finding Needles in a Haystack: Missing Tag Detection in Large RFID Systems. IEEE Transactions on Communications. 10.1109/TCOMM.2017.2666790. 65:5. (2036-2047).

http://ieeexplore.ieee.org/document/7849146/

Fu Y and Biersack E. (2016). False-Positive Probability and Compression Optimization for Tree-Structured Bloom Filters. ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 1:4. (1-39). Online publication date: 21-Sep-2016.

https://doi.org/10.1145/2940324

Ni S, Guo R, Liao X and Jin H. Parallel Bloom Filter on Xeon Phi Many-Core Processors. Proceedings, Part II, of the 15th International Conference on Algorithms and Architectures for Parallel Processing - Volume 9529. (388-405).

https://doi.org/10.1007/978-3-319-27122-4_27

Gosselin-Lavigne M, Gonzalez H, Stakhanova N and Ghorbani A. A Performance Evaluation of Hash Functions for IP Reputation Lookup Using Bloom Filters. Proceedings of the 2015 10th International Conference on Availability, Reliability and Security. (516-521).

https://doi.org/10.1109/ARES.2015.101

Saravanan K and Senthilkumar A. (2014). Investigation on bloom filter and implementation of 3k combined parallel tiger bloom filter design 2014 International Conference on Electronics and Communication Systems (ICECS). 10.1109/ECS.2014.6892509. 978-1-4799-2320-5. (1-7).

http://ieeexplore.ieee.org/document/6892509/

Qiao Y, Li T and Chen S. (2014). Fast Bloom Filters and Their Generalization. IEEE Transactions on Parallel and Distributed Systems. 25:1. (93-103). Online publication date: 1-Jan-2014.

https://doi.org/10.1109/TPDS.2013.46

Xi Tao , Yan Qiao , Jih-Kwon Peir , Shigang Chen , Zhuo Huang and Shih-Lien Lu . (2013). Guided multiple hashing: Achieving near perfect balance for fast routing lookup 2013 21st IEEE International Conference on Network Protocols (ICNP). 10.1109/ICNP.2013.6733607. 978-1-4799-1270-4. (1-10).

http://ieeexplore.ieee.org/document/6733607/

Huang K, Zhang J, Zhang D, Xie G, Salamatian K, Liu A and Li W. A Multi-partitioning Approach to Building Fast and Accurate Counting Bloom Filters. Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing. (1159-1170).

https://doi.org/10.1109/IPDPS.2013.51

Ohara Y. (2013). HCTrie: A structure for indexing hundreds of dimensions for use in file systems search 2013 IEEE 29th Symposium on Mass Storage Systems and Technologies (MSST). 10.1109/MSST.2013.6558431. 978-1-4799-0218-7. (1-5).

http://ieeexplore.ieee.org/document/6558431/

Hao F, Kodialam M, Lakshman T and Puttaswamy K. (2013). Protecting cloud data using dynamic inline fingerprint checks IEEE INFOCOM 2013 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2013.6567098. 978-1-4673-5946-7. (2877-2885).

http://ieeexplore.ieee.org/document/6567098/

Ayday E and Fekri F. (2012). An Iterative Algorithm for Trust Management and Adversary Detection for Delay-Tolerant Networks. IEEE Transactions on Mobile Computing. 11:9. (1514-1531). Online publication date: 1-Sep-2012.

https://doi.org/10.1109/TMC.2011.160

Ayday E and Fekri F. (2012). A secure broadcasting scheme to provide availability, reliability and authentication for wireless sensor networks. Ad Hoc Networks. 10:7. (1278-1290). Online publication date: 1-Sep-2012.

https://doi.org/10.1016/j.adhoc.2012.03.010

Bando M, Lin Y and Chao H. (2012). FlashTrie. IEEE/ACM Transactions on Networking. 20:4. (1262-1275). Online publication date: 1-Aug-2012.

https://doi.org/10.1109/TNET.2012.2188643

Natarajan A, Subramanian S and Premalatha K. (2012). A comparative study of cuckoo search and bat algorithm for Bloom filter optimisation in spam filtering. International Journal of Bio-Inspired Computation. 4:2. (89-99). Online publication date: 1-Jun-2012.

https://doi.org/10.1504/IJBIC.2012.047179

Hua Y, Xiao B, Veeravalli B and Feng D. (2012). Locality-Sensitive Bloom Filter for Approximate Membership Query. IEEE Transactions on Computers. 61:6. (817-830). Online publication date: 1-Jun-2012.

https://doi.org/10.1109/TC.2011.108

Tarkoma S, Rothenberg C and Lagerspetz E. Theory and Practice of Bloom Filters for Distributed Systems. IEEE Communications Surveys & Tutorials. 10.1109/SURV.2011.031611.00024. 14:1. (131-155).

http://ieeexplore.ieee.org/document/5751342/

Natarajan A and Subramanian S. (2012). Bloom filter optimization using Cuckoo Search 2012 International Conference on Computer Communication and Informatics (ICCCI). 10.1109/ICCCI.2012.6158857. 978-1-4577-1583-9. (1-5).

http://ieeexplore.ieee.org/document/6158857/

Hieb J, Schreiver J and Graham J. (2012). Using Bloom Filters to Ensure Access Control and Authentication Requirements for SCADA Field Devices. Critical Infrastructure Protection VI. 10.1007/978-3-642-35764-0_7. (85-97).

http://link.springer.com/10.1007/978-3-642-35764-0_7

Laufer R, Velloso P and Duarte O. (2011). A Generalized Bloom Filter to Secure Distributed Network Applications. Computer Networks: The International Journal of Computer and Telecommunications Networking. 55:8. (1804-1819). Online publication date: 1-Jun-2011.

/doi/10.5555/1982705.1983073

Laufer R, Velloso P and Duarte O. (2011). A Generalized Bloom Filter to Secure Distributed Network Applications. Computer Networks. 10.1016/j.comnet.2010.12.025. 55:8. (1804-1819). Online publication date: 1-Jun-2011.

https://linkinghub.elsevier.com/retrieve/pii/S1389128610003920

Qiao Y, Li T and Chen S. (2011). One memory access bloom filters and their generalization IEEE INFOCOM 2011 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2011.5934972. 978-1-4244-9919-9. (1745-1753).

http://ieeexplore.ieee.org/document/5934972/

Zhao B, Qian W and Zhou A. Towards bipartite graph data management. Proceedings of the second international workshop on Cloud data management. (55-62).

https://doi.org/10.1145/1871929.1871939

Garcia de Oliveira V, Salvador M, Takayassu D, Felix V and Fonseca N. Applying Bloom Filter Addressing in Metro Ethernet Network. Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops. (42-49).

https://doi.org/10.1109/WAINA.2010.104

Sheng B, Li Q and Mao W. Efficient continuous scanning in RFID systems. Proceedings of the 29th conference on Information communications. (1010-1018).

/doi/10.5555/1833515.1833674

Sheng B, Li Q and Mao W. (2010). Efficient Continuous Scanning in RFID Systems IEEE INFOCOM 2010 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2010.5461946. 978-1-4244-5836-3. (1-9).

http://ieeexplore.ieee.org/document/5461946/

Xiao B and Hua Y. (2010). Using Parallel Bloom Filters for Multiattribute Representation on Network Services. IEEE Transactions on Parallel and Distributed Systems. 21:1. (20-32). Online publication date: 1-Jan-2010.

https://doi.org/10.1109/TPDS.2009.39

Guo D, Wu J, Chen H, Yuan Y and Luo X. (2010). The Dynamic Bloom Filters. IEEE Transactions on Knowledge and Data Engineering. 22:1. (120-133). Online publication date: 1-Jan-2010.

https://doi.org/10.1109/TKDE.2009.57

Zhong M, Lu P, Shen K and Seiferas J. Optimizing data popularity conscious bloom filters. Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. (355-364).

https://doi.org/10.1145/1400751.1400798

Ma X, Xu L and Xu L. Blockchain Retrieval Model Based on Elastic Bloom Filter. Web Information Systems and Applications. (527-538).

https://doi.org/10.1007/978-3-030-30952-7_53

Ameri M, Delavar M and Mohajeri J. (2019). Provably secure and efficient PUF‐based broadcast authentication schemes for smart grid applications. International Journal of Communication Systems. 10.1002/dac.3935. 32:8. Online publication date: 25-May-2019.

https://onlinelibrary.wiley.com/doi/10.1002/dac.3935

Hua Y and Liu X. (2019). Locality-Sensitive Bloom Filter for Approximate Membership Query. Searchable Storage in Cloud Computing. 10.1007/978-981-13-2721-6_5. (99-127).

http://link.springer.com/10.1007/978-981-13-2721-6_5

Liu Y, Ge X, Du D and Huang X. (2016). Par-BF: A parallel partitioned Bloom filter for dynamic data sets. The International Journal of High Performance Computing Applications. 10.1177/1094342015618452. 30:3. (259-275). Online publication date: 1-Aug-2016.

http://journals.sagepub.com/doi/10.1177/1094342015618452

Yang X, Vernitski A and Carrea L. (2016). An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters. European Journal of Operational Research. 10.1016/j.ejor.2016.01.042. 252:3. (985-994). Online publication date: 1-Aug-2016.

https://linkinghub.elsevier.com/retrieve/pii/S0377221716000874

Lu J, Yang T, Wang Y, Dai H, Jin L, Song H and Liu B. (2015). One-hashing bloom filter 2015 IEEE 23rd International Symposium on Quality of Service (IWQoS). 10.1109/IWQoS.2015.7404748. 978-1-4673-7113-1. (289-298).

http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7404748

Saravanan K and Senthilkumar A. (2015). An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique. Journal of Discrete Mathematical Sciences and Cryptography. 10.1080/09720529.2014.932129. 18:3. (247-263). Online publication date: 4-May-2015.

http://www.tandfonline.com/doi/full/10.1080/09720529.2014.932129

Liu X, Qi H, Li K, Stojmenovic I, Liu A, Shen Y, Qu W and Xue W. Sampling Bloom Filter-Based Detection of Unknown RFID Tags. IEEE Transactions on Communications. 10.1109/TCOMM.2015.2402660. 63:4. (1432-1442).

http://ieeexplore.ieee.org/document/7039200/

Bremler-Barr A, David S, Harchol Y and Hay D. (2015). Leveraging traffic repetitions for high-speed deep packet inspection IEEE INFOCOM 2015 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2015.7218648. 978-1-4799-8381-0. (2578-2586).

http://ieeexplore.ieee.org/document/7218648/

Liu X, Li K, Min G, Shen Y, Liu A and Qu W. Completely Pinpointing the Missing RFID Tags in a Time-Efficient Way. IEEE Transactions on Computers. 10.1109/TC.2013.197. 64:1. (87-96).

https://ieeexplore.ieee.org/document/6616545/

Talwadker R and Voruganti K. ParaSwift. Proceedings of the 28th USENIX conference on Large Installation System Administration. (119-132).

/doi/10.5555/2717491.2717500

Alzahrani B, Vassilakis V and Reed M. (2014). Selecting Bloom-filter header lengths for secure information centric networking 2014 9th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP). 10.1109/CSNDSP.2014.6923904. 978-1-4799-2581-0. (628-633).

http://ieeexplore.ieee.org/document/6923904/

Li D and Chen P. Optimized Hash Lookup for Bloom Filter Based Packet Routing. Proceedings of the 2013 16th International Conference on Network-Based Information Systems. (31-37).

https://doi.org/10.1109/NBiS.2013.38

Gahyun Park and Minseok Kwon . (2013). An enhanced bloom filter for longest prefix matching 2013 IEEE/ACM 21st International Symposium on Quality of Service (IWQoS). 10.1109/IWQoS.2013.6550276. 978-1-4799-0590-4. (1-6).

http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6550276

Alzahrani B, Vassilakis V and Reed M. (2013). Mitigating brute-force attacks on Bloom-filter based forwarding 2013 Conference on Future Internet Communications (CFIC). 10.1109/CFIC.2013.6566320. 978-1-4799-0059-6. (1-7).

http://ieeexplore.ieee.org/document/6566320/

Hieb J, Schreiver J and Graham J. (2013). A security-hardened appliance for implementing authentication and access control in SCADA infrastructures with legacy field devices. International Journal of Critical Infrastructure Protection. 10.1016/j.ijcip.2013.01.001. 6:1. (12-24). Online publication date: 1-Mar-2013.

https://linkinghub.elsevier.com/retrieve/pii/S1874548213000024

Bando M, Lin Y and Chao H. (2012). FlashTrie. IEEE/ACM Transactions on Networking. 20:4. (1262-1275). Online publication date: 1-Aug-2012.

https://doi.org/10.1109/TNET.2012.2188643

Moraru I and Andersen D. (2012). Exact pattern matching with feed-forward bloom filters. ACM Journal of Experimental Algorithmics. 17. (3.1-3.18). Online publication date: 1-Jul-2012.

https://doi.org/10.1145/2133803.2330085

https://doi.org/10.1109/TPDS.2009.39

Yoon M. Aging Bloom Filter with Two Active Buffers for Dynamic Sets. IEEE Transactions on Knowledge and Data Engineering. 10.1109/TKDE.2009.136. 22:1. (134-138).

http://ieeexplore.ieee.org/document/5066970/

Guo D, He Y and Yang P. (2010). Receiver-oriented design of Bloom filters for data-centric routing. Computer Networks: The International Journal of Computer and Telecommunications Networking. 54:1. (165-174). Online publication date: 1-Jan-2010.

https://doi.org/10.1016/j.comnet.2009.10.002