scientific article; zbMATH DE number 6469129
From MaRDI portal
Publication:5501239
zbMATH Open1317.68041MaRDI QIDQ5501239FDOQ5501239
Ronitt Rubinfeld, Ayellet Tal, Bernard Chazelle, Joe Kilian
Publication date: 3 August 2015
Title of this publication is not available (Why is that?)
Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cited In (18)
- Modified binary searching for static tables
- Binary Fuse Filters: Fast and Smaller Than Xor Filters
- Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications
- Adaptive Cuckoo Filters
- Compressed string dictionary search with edit distance one
- Scalable Bloom filters
- Minimal and Monotone Minimal Perfect Hash Functions
- Xor Filters
- Hardness of peeling with stashes
- Bloom Filters in Adversarial Environments
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Title not available (Why is that?)
- An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique
- CuCoTrack: cuckoo filter based connection tracking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimizing static and adaptive probing schedules for rapid event detection
Recommendations
- A cache architecture for counting bloom filters: theory and application 👍 👎
- Scalable Bloom filters 👍 👎
- Improving the performance of invertible Bloom lookup tables 👍 👎
- Cache-, hash-, and space-efficient bloom filters 👍 👎
- On the analysis of Bloom filters 👍 👎
- The power of \(1 + \alpha \) for memory-efficient Bloom filters 👍 👎
- Using Bloom Filters to Speed-up Name Lookup in Distributed Systems 👍 👎
- Optimal Bloom Filters and Adaptive Merging for LSM-Trees 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501239)
