Pages that link to "Item:Q5402541"
From MaRDI portal
The following pages link to Exact and approximate membership testers (Q5402541):
Displayed 10 items.
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- Support optimality and adaptive cuckoo filters (Q832904) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- New hash functions and their use in authentication and set equality (Q1152713) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← 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)
- Bet-or-pass: adversarially robust Bloom filters (Q6169433) (← links)