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

Authors

83

  1. SD
    Sarang Dharmapurikar

    Washington University in St. Louis, United States

    5 publications · 1.3K citations

    5

    h-index

  2. PT
    Praveen Thaggikuppe Krishnamurthy

    JSS Academy of Higher Education and Research, India

    4 publications · 849 citations

    4

    h-index

  3. LY
    Luke Yen

    University of Wisconsin–Madison, United States

    3 publications · 256 citations

    3

    h-index

  4. DE
    David E. Taylor

    Washington University in St. Louis, United States

    3 publications · 548 citations

    3

    h-index

  5. KS
    Karthikeyan Sankaralingam

    University of Wisconsin–Madison, United States

    2 publications · 224 citations

    2

    h-index

1–5 of 83

Venues

  1. Computer Networks

    2 publications · 64 citations

    2

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 67 citations

    2

    h-index

  3. IEEE Transactions on Computers

    2 publications · 74 citations

    2

    h-index

  4. Communications of the ACM

    1 publications · 92 citations

    1

    h-index

  5. Allerton Conference on Communication, Control, and Computing

    Conference · 1 publications · 42 citations

    1

    h-index

1–5