Parallel Bloom Filters
Parallel Bloom Filters is a parallel data structure that extends the standard Bloom filter by enabling concurrent insertions and queries across multiple processors or threads while maintaining space efficiency and probabilistic membership testing.
30
Publications
2.4K
Citations
83
Authors
33
Institutions
Publications per year
2017–2026
5
Parents
30
Deep packet inspection using parallel bloom filters
Sarang Dharmapurikar, P. Krishnamurthy, Todd Sproull et al. · IEEE Micro · 2004 · 435 citations
Deep packet inspection using parallel Bloom filters
Sarang Dharmapurikar, Praveen Thaggikuppe Krishnamurthy, Todd Sproull et al. · 2004 · 301 citations
1–5 of 30
83
Washington University in St. Louis, United States
5 publications · 1.3K citations
5
h-index
JSS Academy of Higher Education and Research, India
4 publications · 849 citations
4
h-index
3
h-index
3
h-index
University of Wisconsin–Madison, United States
2 publications · 224 citations
2
h-index
1–5 of 83
33

Washington University in St. Louis
St Louis, United States
6 h-index
18 publications
4.6K citations
University of Wisconsin–Madison
Madison, United States
4 h-index
14 publications
1.1K citations
Tsinghua University
Beijing, China
2 h-index
11 publications
189 citations
Texas A&M University
College Station, United States
2 h-index
4 publications
54 citations

Radboud University Nijmegen
Nijmegen, The Netherlands
1 h-index
1 publications
14 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
1 h-index
3 publications
72 citations
National Institute Of Technology Silchar
Silchar, India
1 h-index
3 publications
69 citations
Nokia (United States)
Coppell, United States
1 h-index
1 publications
11 citations
1–8 of 33
2 publications · 64 citations
2
h-index
TPDS · 2 publications · 67 citations
2
h-index
2 publications · 74 citations
2
h-index
1 publications · 92 citations
1
h-index
Conference · 1 publications · 42 citations
1
h-index
1–5