Dynamic dictionaries for multisets and counting filters with constant time operations
From MaRDI portal
Publication:832853
DOI10.1007/978-3-030-83508-8_11OpenAlexW3189096268MaRDI QIDQ832853FDOQ832853
Authors: Ioana O. Bercea, Guy Even 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_11
Cites Work
- Title not available (Why is that?)
- Efficient Storage and Retrieval by Content and Address of Static Files
- Title not available (Why is that?)
- An optimal bloom filter replacement
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Balanced allocation and dictionaries with tightly packed constant size bins
- Efficient hashing with lookups in two memory accesses
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- Low redundancy in static dictionaries with constant query time
- Title not available (Why is that?)
- Space efficient hash tables with worst case constant access time
- Applications of a Splitting Trick
- Title not available (Why is that?)
- Two-Way Chaining with Reassignment
- Exact and approximate membership testers
- De Dictionariis Dynamicis Pauco Spatio Utentibus
- Compact dictionaries for variable-length keys and data with applications
- An Improved Construction for Counting Bloom Filters
- Title not available (Why is that?)
Cited In (1)
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)
