Balanced allocation and dictionaries with tightly packed constant size bins
From MaRDI portal
Publication:2373735
Recommendations
Cites work
- A guided tour of Chernoff bounds
- Almost random graphs with simple hash functions
- Applications of a Splitting Trick
- Average-case analysis of algorithms for matchings and related problems
- Balanced Allocations
- Balanced allocations: the heavily loaded case
- Contention Resolution in Hashing Based Shared Memory Simulations
- Cuckoo hashing
- Efficient hashing with lookups in two memory accesses
- Efficient PRAM simulation on a distributed memory machine
- Fast concurrent access to parallel disks
- Fast priority queues for cached memory
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 1857645 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- Paths in graphs
- Perfectly balanced allocation
- Space efficient hash tables with worst case constant access time
- Uniform hashing in constant time and linear space
Cited in
(33)- On the k-orientability of random graphs
- Balanced allocation through random walk
- Efficiently extendible mappings for balanced data distribution
- Dynamic space efficient hashing
- Hardness-preserving reductions via cuckoo hashing
- c-trie++: a dynamic trie tailored for fast prefix searches
- Generalized cuckoo hashing with a stash, revisited
- Efficient hashing with lookups in two memory accesses
- Sharp load thresholds for cuckoo hashing
- Consistent hashing with bounded loads
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Dense peelable random uniform hypergraphs
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Constant-time retrieval with O( m) extra bits
- Dynamic space efficient hashing
- Load thresholds for cuckoo hashing with double hashing
- Hashing, load balancing and multiple choice
- Automata, Languages and Programming
- Two-way chaining for non-uniform distributions
- Adaptive Cuckoo Filters
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Improved private set intersection for sets with small entries
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Tiny pointers
- Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
- Layered hashing algorithm for real-time systems
- Insertion time of random walk cuckoo hashing below the peeling threshold
- Iceberg hashing: optimizing many hash-table criteria at once
- A new impossibility result for online bipartite matching problems
- Dynamic dictionaries for multisets and counting filters with constant time operations
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)
