The following pages link to (Q2921747):
Displayed 14 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- Support optimality and adaptive cuckoo filters (Q832904) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← 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)
- 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)
- Fast Evaluation of Union-Intersection Expressions (Q5387808) (← links)
- Tight bounds for sliding Bloom filters (Q5963376) (← 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)