Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
From MaRDI portal
Publication:3521934
DOI10.1007/978-3-540-70575-8_32zbMath1153.68364OpenAlexW1891810191WikidataQ56639229 ScholiaQ56639229MaRDI QIDQ3521934
Rasmus Pagh, Martin Dietzfelbinger
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_32
Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (13)
Sharp load thresholds for cuckoo hashing ⋮ Bloom Filters in Adversarial Environments ⋮ Various improvements to text fingerprinting ⋮ Xor Filters ⋮ Binary Fuse Filters: Fast and Smaller Than Xor Filters ⋮ Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tight tradeoffs in searchable symmetric encryption ⋮ Tight bounds for sliding Bloom filters ⋮ An Optimal Bloom Filter Replacement Based on Matrix Solving ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions]
This page was built for publication: Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
