Almost random graphs with simple hash functions
From MaRDI portal
Recommendations
Cited in
(22)- Hash functions and Cayley graphs
- Balanced allocation and dictionaries with tightly packed constant size bins
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Hardness-preserving reductions via cuckoo hashing
- Efficient set intersection with simulation-based security
- Balls and bins: smaller hash families and faster evaluation
- Mixed hypergraphs for linear-time construction of denser hashing-based data structures
- From independence to expansion and back again
- Bipartite random graphs and Cuckoo hashing
- Applications of a Splitting Trick
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- Power of \(d\) choices with simple tabulation
- Fast pseudorandomness for independence and load balancing (extended abstract)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- Bet-or-pass: adversarially robust Bloom filters
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations
- Optimal non-adaptive cell probe dictionaries and hashing
- Dynamic filter and retrieval with one access to modifiable memory
- Tiny pointers
- Iceberg hashing: optimizing many hash-table criteria at once
- Adversarially robust Bloom filters: monotonicity and betting
- Hashing and canonicalizing Notation 3 graphs
This page was built for publication: Almost random graphs with simple hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581260)
