A lower bound for dynamic approximate membership data structures

DOI10.1109/FOCS.2010.81MaRDI QIDQ6990269zbMATH OpenFDO

Authors Ely Porat, Shachar Lovett

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1109/FOCS.2010.81

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(2)

• Succinct filters for sets of unknown sizes
• Dynamic filter and retrieval with one access to modifiable memory

This page was built for publication: A lower bound for dynamic approximate membership data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990269)