Pages that link to "Item:Q4651478"
From MaRDI portal
The following pages link to On Universal Classes of Extremely Random Constant-Time Hash Functions (Q4651478):
Displayed 12 items.
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Balanced allocation and dictionaries with tightly packed constant size bins (Q2373735) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- Connecting tweakable and multi-key blockcipher security (Q2413014) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence (Q3452844) (← links)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (Q4640336) (← links)
- (Q5002669) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)