The following pages link to Compressed Bloom filters (Q2787676):
Displaying 11 items.
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters (Q323016) (← links)
- A cache architecture for counting bloom filters: theory and application (Q415792) (← links)
- A symmetric cryptographic scheme for data integrity verification in cloud databases (Q781030) (← links)
- Scalable Bloom filters (Q845946) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- Receiver-oriented design of bloom filters for data-centric routing (Q2269165) (← links)
- Hardened bloom filters, with an application to unobservability (Q2442961) (← links)
- Sliding Bloom Filters (Q2872115) (← links)
- Less hashing, same performance: Building a better Bloom filter (Q3522836) (← links)
- Public-Key Puncturable Encryption: Modular and Compact Constructions (Q5041162) (← links)
- Formal Methods in Computer-Aided Design (Q5492993) (← links)
