Dynamic dictionaries for multisets and counting filters with constant time operations
From MaRDI portal
(Redirected from Publication:832853)
Recommendations
Cites work
- scientific article; zbMATH DE number 177800 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- scientific article; zbMATH DE number 1875412 (Why is no real title available?)
- scientific article; zbMATH DE number 7759279 (Why is no real title available?)
- An Improved Construction for Counting Bloom Filters
- An optimal bloom filter replacement
- Applications of a Splitting Trick
- Balanced allocation and dictionaries with tightly packed constant size bins
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Compact dictionaries for variable-length keys and data with applications
- De Dictionariis Dynamicis Pauco Spatio Utentibus
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Efficient Storage and Retrieval by Content and Address of Static Files
- Efficient hashing with lookups in two memory accesses
- Exact and approximate membership testers
- Low redundancy in static dictionaries with constant query time
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Space efficient hash tables with worst case constant access time
- Two-Way Chaining with Reassignment
Cited in
(2)
This page was built for publication: Dynamic dictionaries for multisets and counting filters with constant time operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832853)
