A Space Lower Bound for Dynamic Approximate Membership Data Structures
From MaRDI portal
Publication:5408763
DOI10.1137/120867044zbMath1285.68043OpenAlexW2146450895MaRDI QIDQ5408763
Publication date: 11 April 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/8sm8m910
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items
Constructing SAT Filters with a Quantum Annealer, Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange, Tight bounds for sliding Bloom filters