Exact and approximate membership testers

DOI10.1145/800133.804332zbMath1282.68191OpenAlexW2018423671MaRDI QIDQ5402541

Mark N. Wegman, Robert W. Floyd, George Markowsky, L. Carter, John Gill

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804332

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Information theory (general) (94A15)

Related Items (10)

Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Support optimality and adaptive cuckoo filters ⋮ Bloom Filters in Adversarial Environments ⋮ Bet-or-pass: adversarially robust Bloom filters ⋮ New hash functions and their use in authentication and set equality ⋮ Fast Evaluation of Union-Intersection Expressions ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ On the false-positive rate of Bloom filters ⋮ Tight bounds for sliding Bloom filters ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions]

This page was built for publication: Exact and approximate membership testers