scientific article; zbMATH DE number 6469129

zbMath1317.68041MaRDI QIDQ5501239

Ronitt Rubinfeld, Ayellet Tal, Joe Kilian, Bernard Chazelle

Publication date: 3 August 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Approximation algorithms (68W25)

Related Items

Compressed string dictionary search with edit distance one ⋮ Hardness of peeling with stashes ⋮ Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications ⋮ Scalable Bloom filters ⋮ Bloom Filters in Adversarial Environments ⋮ An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique ⋮ Minimal and Monotone Minimal Perfect Hash Functions ⋮ CuCoTrack: cuckoo filter based connection tracking ⋮ Xor Filters ⋮ Binary Fuse Filters: Fast and Smaller Than Xor Filters ⋮ Optimizing static and adaptive probing schedules for rapid event detection ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Optimal Bloom Filter Replacement Based on Matrix Solving ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ Adaptive Cuckoo Filters