Name
Abstract | ||
|---|---|---|
Bloom filters and their variants are widely used as space-efficient probabilistic data structures for representing sets and are very popular in networking applications. They support fast element insertion and deletion, along with membership queries with the drawback of false positives. Bloom filters can be designed to match the false positive rates that are acceptable for the application domain. H... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TNSM.2021.3059075 | IEEE Transactions on Network and Service Management |
Keywords | Field | DocType |
Base stations,Technological innovation,Hash functions,Testing,Electronic mail,Probabilistic logic,Monitoring | Data structure,False positive rate,Bloom filter,Combinatorial group testing,Computer science,Algorithm,Application domain,Probabilistic logic,False positive paradox,Distributed computing | Conference |
Volume | Issue | ISSN |
18 | 2 | 0743-166X |
Citations | PageRank | References |
3 | 0.37 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sándor Z. Kiss | 1 | 10 | 4.65 |
| Eva Hosszu | 2 | 11 | 3.29 |
| János Tapolcai | 3 | 364 | 41.42 |
| Lajos Rónyai | 4 | 397 | 52.05 |
| Ori Rottenstreich | 5 | 318 | 29.90 |