Balanced allocation and dictionaries with tightly packed constant size bins
From MaRDI portal
Publication:2373735
DOI10.1016/J.TCS.2007.02.054zbMATH Open1115.68169OpenAlexW2166542473MaRDI QIDQ2373735FDOQ2373735
Authors: Martin Dietzfelbinger, Christoph Weidling 
Publication date: 16 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.054
Recommendations
data structuresrandomized algorithmsrandom graphsdictionarieshashingbalanced allocationstorage space
Cites Work
- Title not available (Why is that?)
- Paths in graphs
- Almost random graphs with simple hash functions
- Balanced Allocations
- Cuckoo hashing
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- Title not available (Why is that?)
- Efficient PRAM simulation on a distributed memory machine
- Title not available (Why is that?)
- A guided tour of Chernoff bounds
- Average-case analysis of algorithms for matchings and related problems
- Uniform hashing in constant time and linear space
- Efficient hashing with lookups in two memory accesses
- Contention Resolution in Hashing Based Shared Memory Simulations
- Space efficient hash tables with worst case constant access time
- Applications of a Splitting Trick
- Fast priority queues for cached memory
- Balanced allocations: the heavily loaded case
- Fast concurrent access to parallel disks
- Perfectly balanced allocation
Cited In (28)
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Generalized cuckoo hashing with a stash, revisited
- Two-way chaining for non-uniform distributions
- Layered hashing algorithm for real-time systems
- Adaptive Cuckoo Filters
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Load thresholds for cuckoo hashing with double hashing
- Dynamic space efficient hashing
- Dynamic space efficient hashing
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Automata, Languages and Programming
- Consistent hashing with bounded loads
- Efficient hashing with lookups in two memory accesses
- Hashing, load balancing and multiple choice
- Efficiently extendible mappings for balanced data distribution
- Sharp load thresholds for cuckoo hashing
- Improved private set intersection for sets with small entries
- On the \(k\)-orientability of random graphs
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Hardness-preserving reductions via cuckoo hashing
- c-trie++: a dynamic trie tailored for fast prefix searches
- Balanced allocation through random walk
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Balanced allocation and dictionaries with tightly packed constant size bins
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373735)
