Pages that link to "Item:Q2921747"
From MaRDI portal
The following pages link to An optimal bloom filter replacement (Q2921747):
Displaying 30 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters (Q323016) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- Support optimality and adaptive cuckoo filters (Q832904) (← links)
- Scalable Bloom filters (Q845946) (← links)
- Improving counting Bloom filter performance with fingerprints (Q903373) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- Deterministic \(k\)-set structure (Q975518) (← links)
- XOR-satisfiability set membership filters (Q1656598) (← links)
- On the analysis of Bloom filters (Q2410578) (← links)
- Improving the performance of invertible Bloom lookup tables (Q2445904) (← links)
- Compressed Bloom filters (Q2787676) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Sliding Bloom Filters (Q2872115) (← links)
- An Optimal Bloom Filter Replacement Based on Matrix Solving (Q3392960) (← links)
- Constructing SAT Filters with a Quantum Annealer (Q3453216) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- Less hashing, same performance: Building a better Bloom filter (Q3522836) (← links)
- M-balance matrix Bloom filter (Q4688327) (← links)
- A new data redundancy elimination algorithm based on Bloom filter data structure (Q4688513) (← links)
- Inferring Insertion Times and Optimizing Error Penalties in Time-decaying Bloom Filters (Q5012614) (← links)
- A Theoretical Perspective on Hyperdimensional Computing (Q5026180) (← links)
- An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique (Q5069671) (← links)
- Distance-Sensitive Bloom Filters (Q5233465) (← links)
- Fast Evaluation of Union-Intersection Expressions (Q5387808) (← links)
- Less Hashing, Same Performance: Building a Better Bloom Filter (Q5449550) (← links)
- Tight bounds for sliding Bloom filters (Q5963376) (← links)
- Xor Filters (Q6039922) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q6103528) (← links)
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable (Q6113958) (← links)
