107 citations · 316 across the 21 of their papers we have counts for
4 papers · 1 filter
countBF: A General-purpose High Accuracy and Space Efficient Counting Bloom Filter
Sabuzima Nayak, Ripon Patgiri
Bloom Filter is a probabilistic data structure for the membership query, and it has been intensely experimented in various fields to reduce memory consumption and enhance a system'…
RobustBF: A High Accuracy and Memory Efficient 2D Bloom Filter
Sabuzima Nayak, Ripon Patgiri
Bloom Filter is an important probabilistic data structure to reduce memory consumption for membership filters. It is applied in diverse domains such as Computer Networking, Network…
Shed More Light on Bloom Filter's Variants
Ripon Patgiri, Sabuzima Nayak, Samir Kumar Borgohain
Bloom Filter is a probabilistic membership data structure and it is excessively used data structure for membership query. Bloom Filter becomes the predominant data structure in app…
scaleBF: A High Scalable Membership Filter using 3D Bloom Filter
Ripon Patgiri, Sabuzima Nayak, Samir Kumar Borgohain
Bloom Filter is extensively deployed data structure in various applications and research domain since its inception. Bloom Filter is able to reduce the space consumption in an orde…